Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 1
Volume 1, Numbers 1-2, September 1979
- Ronald D. Armstrong, Abraham Charnes, F. Phillips:
Page cuts for integer interval linear programming. 1-14 - Aviezri S. Fraenkel, Yaacov Yesha:
Complexity of problems in games, graphs and algebraic equations. 15-30 - Robert R. Meyer:
Equivalent constraints for discrete sets. 31-50 - Marjorie Senechal:
Color groups. 51-73 - Les R. Foulds, D. F. Robinson:
Construction properties of combinatorial deltahedra. 75-87 - Charles H. Kappauf, Gary J. Koehler:
The mixed postman problem. 89-103 - Maria M. Klawe:
Optimal strategies for a fair betting game. 105-115 - Donald E. Knuth:
Lexicographic permutations with restrictions. 117-125 - André Thayse:
Discrete function expansions in integer powers. 127-136 - T. C. Wesselkamper:
The algebraic representation of partial functions. 137-142
Volume 1, Number 3, November 1979
- Werner Ainhirn, Hermann A. Maurer:
On ε productions for terminals in E0L forms. 155-166 - Ulrich Derigs:
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective. 167-180 - Peter C. Fishburn:
Heights of representative systems. 181-199 - Michel Habib, M. C. Maurer:
On the X-join decomposition for undirected graphs. 201-207 - Wen-Lian Hsu, George L. Nemhauser:
Easy and hard bottleneck location problems. 209-215 - James B. Saxe:
On the number of range queries in k-space. 217-225
Volume 1, Number 4, December 1979
- Peter C. Fishburn, William V. Gehrlein, Eric Maskin:
Condorcet proportions and Kelly's conjectures. 229-252 - Alan M. Frieze
:
An algorithm for algebraic assignment problems. 253-259 - Franco Giannessi:
Continued fractions and explicit solutions of a particular discrete optimization problem. 261-275 - Donald Goldfarb, William Y. Sit:
Worst case behavior of the steepest edge simplex method. 277-285 - Janet Somers, Ilan Adler:
The max-flow problem with parametric capacities. 287-300 - Maretsugu Yamasaki:
Maximization of input conductances of an infinite network. 301-309
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-18 21:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
