default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 3
Volume 3, Number 1, February 1981
- József Beck, Tibor Fiala:
"Integer-making" theorems. 1-8 - Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. 9-18 - Raymond A. Cuninghame-Green:
Integer programming by long division. 19-25 - Peter C. Fishburn:
Inverted orders for monotone scoring rules. 27-36 - Richard M. Karp, James B. Orlin
:
Parametric shortest path algorithms with an application to cyclic staffing. 37-45 - Klarner A. Klarner:
Mathematical crystal growth I. 47-52 - André Thayse:
Universal algorithms for evaluating boolean functions. 53-65 - R. E. Krichevskii, B. Ya. Ryabko, A. Yu. Haritonov:
Optimal key for taxons ordered in accordance with their frequencies. 67-72 - Timo Lepistö:
A note on perfect Lee-codes over small alphabets. 73-74 - K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs. 75-76
Volume 3, Number 2, April 1981
- Dominique Durand, Claude-Marcel Bruneau:
Graph theory and molecular distribution : Part I: copolycondensation of polyfunctional monomers bearing identical reactive groups. 79-91 - Eric Goles, J. Olivos:
Comportement periodique des fonctions a seuil binaires et applications. 93-105 - Melvin F. Janowitz:
Continuous L-cluster methods. 107-112 - David A. Klarner:
Mathematical crystal growth II. 113-117 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Colorings and interpretations: a connection between graphs and grammar forms. 119-135 - Clyde L. Monma:
Sequencing with general precedence constraints. 137-150 - Toshimasa Watanabe, Tadashi Ae, Akira Nakamura:
On the removal of forbidden graphs by edge-deletion or by edge-contraction. 151-153
Volume 3, Number 3, July 1981
- Marlene J. Colbourn, Charles J. Colbourn:
Concerning the complexity of deciding isomorphism of block designs. 155-162 - Derek G. Corneil, H. Lerchs, L. Stewart Burlingham:
Complement reducible graphs. 163-174 - David Gale, Themistocles Politof:
Substitutes and complements in network flow problems. 175-186 - Peter J. Slater:
Accretion centers: A generalization of branch weight centroids. 187-192 - Laurence A. Wolsey:
The b-hull of an integer program. 193-201 - Zeev Zeitlin:
Minimization of maximum absolute deviation in integers. 203-220 - Diane B. Holdridge, James A. Davis:
Comment on "A note on perfect lee-codes". 221
Volume 3, Number 4, November 1981
- Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era:
Balancing signed graphs. 227-233 - Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Basic formulas and languages Part I. The theory. 235-255 - Aviezri S. Fraenkel:
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete. 257-262 - Hiroaki Ishii, Shogo Shiode, Toshio Nishida, Yoshikazu Namasuya:
Stochastic spanning tree problem. 263-273 - Silvano Martello, Paolo Toth:
A Bound and Bound algorithm for the zero-one multiple knapsack problem. 275-288 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Decidability and density in two-symbol grammar forms. 289-299 - Svatopluk Poljak, Vojtech Rödl, Daniel Turzík:
Complexity of representation of graphs by set systems. 301-312 - George Gens, Eugene Levner:
Fast approximation algorithm for job sequencing with deadlines. 313-318 - Grzegorz Rozenberg, Arto Salomaa:
Table systems with unconditional transfer. 319-322
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-11-04 20:45 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:
