default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 5
Volume 5, Number 1, January 1983
- L. B. Wilson, C. S. Edwards, Victor J. Rayward-Smith:
Preface. v - E. M. L. Beale:
A mathematical programming model for the long term development of an off-shore gas field. 1-9 - Jacek Blazewicz
, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Scheduling subject to resource constraints: classification and complexity. 11-24 - T. Brian Boffey, J. R. Green:
Design of electricity supply networks. 25-38 - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
On the complexity of finding multi-constrained spanning trees. 39-50 - C. S. Edwards, C. H. Elphick:
Lower bounds for the clique and the chromatic numbers of a graph. 51-64 - Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan:
Surrogate duality relaxation for job shop scheduling. 65-75 - John Franco, Marvin C. Paull:
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. 77-87 - Alan M. Frieze, J. Yadegar:
On the quadratic assignment problem. 89-98 - A. M. A. Hariri, Chris N. Potts:
An algorithm for single machine sequencing with release dates to minimize total weighted completion time. 99-109 - Robert W. Irving:
NP-completeness of a family of graph-colouring problems. 111-117 - Anthony Mansfield:
On the computational complexity of a merge recognition problem. 119-122 - Colin McDiarmid:
On the chromatic forcing number of a random graph. 123-132 - D. J. A. Welsh:
Randomised algorithms. 133-145 - H. Paul Williams:
A characterisation of all feasible solutions to an integer program. 147-155
Volume 5, Number 2, February 1983
- C. K. Bailey, Edgar M. Palmer, J. W. Kennedy:
Points by degree and orbit size in chemical trees, II. 157-164 - Vasek Chvátal:
On the bicycle problem. 165-173 - Satoru Fujishige:
Canonical decompositions of symmetric submodular systems. 175-190 - John W. Kennedy, Louis V. Quintas:
Extremal f-trees and embedding spaces for molecular graphs. 191-209 - Takao Nishizeki, Takao Asano, Takahiro Watanabe:
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. 211-222 - Helmut Prodinger, Friedrich J. Urbanek:
On monotone functions of tree structures. 223-239 - Arun K. Pujari, Ashok K. Mittal, S. K. Gupta:
A convex polytope of diameter one. 241-242 - Juhani Karhumäki, Matti Linna:
A note on morphic characterization of languages. 243-246 - Egon Balas:
Disjunctive programming: To: E. Balas in: P.L. Hammer, E.L. Johnson and B.H. Korete, eds., Discrete Optimization II, Ann. Discrete Math 5 (North-Holland, Amsterdam, 1979) 3-51. 247-248 - Thomas Zaslavsky:
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74. 248
Volume 5, Number 3, March 1983
- Marc Davio, Christian Ronse:
Rotator design. 253-277 - Juhani Karhumäki:
On cube-free ω-words generated by binary morphisms. 279-297 - Tohru Kikuno, Noriyoshi Yoshida, Yoshiaki Kakuda:
A linear algorithm for the domination number of a series-parallel graph. 299-311 - Kokichi Sugihara:
A unifying approach to descriptive geometry and mechanisms. 313-328
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-09-02 00: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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
