default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 10
Volume 10, Number 1, January 1985
- Peter Brucker, W. Papenjohann:
An out-of-kilter method for the algebraic circulation problem. 1-18 - Peter Butkovic
:
Necessary solvability conditions of systems of linear extremal equations. 19-26 - Don Coppersmith, Uzi Vishkin:
Solving NP-hard problems in 'almost trees': Vertex cover. 27-45 - Alan M. Frieze:
On the value of a random minimum spanning tree problem. 47-56 - Alan M. Frieze, Geoffrey R. Grimmett:
The shortest-path problem for graphs with random arc-lengths. 57-77 - Hiroshi Imai:
On combinatorial structures of line drawings of polyhedra. 79-92 - Fred S. Roberts:
Applications of edge coverings by cliques. 93-109 - Andries E. Brouwer:
Some new two-weight codes and strongly regular graphs. 111-114
Volume 10, Number 2, February 1985
- A. H. G. Rinnooy Kan:
Preface. 115 - Wolfgang W. Bein, Peter Brucker, Arie Tamir:
Minimum cost flow algorithms for series-parallel networks. 117-124 - Celso C. Ribeiro, Michel Minoux:
A heuristic approach to hard constrained shortest path problems. 125-137 - Martin E. Dyer, Alan M. Frieze:
On the complexity of partitioning graphs into connected subgraphs. 139-153 - Chris N. Potts:
Analysis of a linear programming heuristic for scheduling unrelated parallel machines. 155-164 - Manfred Kunde, Horst Steppat:
First fit decreasing scheduling on uniform multiprocessors. 165-177 - Gerald L. Thompson, Sharad Singhal:
A successful algorithm for the undirected Hamiltonian path problem. 179-195 - Colin McDiarmid:
On some conditioning results in the probabilistic analysis of algorithms. 197-201 - W. Cook:
A note on matchings and separability. 203-209
Volume 10, Number 3, March 1985
- Eric Allender:
On the number of cycles possible in digraphs with large girth. 211-225 - Charles E. Blair, Robert G. Jeroslow:
Constructive characterizations of the value function of a mixed-integer program II. 227-240 - Jacek Blazewicz, Jerzy R. Nawrocki:
Dynamic storage allocation with limited compaction - complexity and some practical implications. 241-253 - Yung-ching Chu:
An extended result of Kleitman and Saks concerning binary trees. 255-259 - Naoki Katoh, Toshihide Ibaraki:
An efficient algorithm for the parametric resource allocation problem. 261-274 - Takashi Kayano:
Extremal length of an infinite network related to an accessible boundary point. 275-285 - Burkhard Monien, Ewald Speckenmeyer:
Solving satisfiability in less than 2n steps. 287-295 - Kokichi Sugihara:
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications. 297-312 - Jayme Luiz Szwarcfiter, Ronaldo C. M. Persiano, Antonio A. F. Oliveira:
Orientations with single source and sink. 313-321
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 2026-03-07 22:52 CET 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:
