default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 6
Volume 6, Number 1, May 1983
- Béla Bollobás, Andrew Thomason:
Parallel sorting. 1-11 - M. S. Burgin, E. Ya. Gabovich:
Equivalence among optimization problems on matrix sets. 13-24 - N. G. de Bruijn:
Denumerations of rooted trees and multisets. 25-33 - János Demetrovics, Gy. Gyepesi:
Some generalized type functional dependencies formalized as equality set on matrices. 35-47 - Daniel J. Kleitman, Robert A. Lew:
An algorithm for collapsing sign alternating sequences of real numbers. 49-53 - Haruko Okamura:
Multicommodity flows in graphs. 55-62 - Toshimasa Watanabe, Tadashi Ae, Akira Nakamura:
On the NP-hardness of edge-deletion and -contraction problems. 63-78 - Alan M. Frieze
:
An extension of Christofides heuristic to the k-person travelling salesman problem. 79-83 - Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida:
Two routing problems with the limitation of fuel. 85-89 - Rolf G. Karlsson, Patricio V. Poblete:
An O(mlog logD) algorithm for shortest paths. 91-93 - Françoise Fogelman, Eric Goles, Gérard Weisbuch:
Transient length in sequential iteration of threshold functions. 95-98 - Christoph Maas:
Some results about the interval number of a graph. 99-102
Volume 6, Number 2, July 1983
- Brian Alspach, Peter Eades, Gordon Rose:
A lower-bound for the number of productions required for a certain class of languages. 109-115 - Susan F. Assmann, Daniel J. Kleitman:
The number of rounds needed to exchange information within a graph. 117-125 - P. L. Buzytsky, Gregory A. Freiman:
An effective formula for the number of solutions of a system of two 0, 1-equations. 127-133 - A. C. Hayes, David G. Larman:
The vertices of the knapsack polytope. 135-138 - Renu C. Laskar, Douglas R. Shier:
On powers and centers of chordal graphs. 139-147 - Chien-Hua M. Lin, Harvey M. Salkin:
An efficient algorithm for the complete set partitioning problem. 149-156 - Willi Maurer:
Bivalent trees and forests or upper bounds for the probability of a union revisited. 157-171 - I. Morihara, T. Ibaraki, T. Hasegawa:
Bin packing and multiprocessor scheduling problems with side constraint on job types. 173-191 - Svatopluk Poljak, Ales Pultr, Vojtech Rödl:
On qualitatively independent partitions and related problems. 193-205 - Michael D. Beeler:
A new Van der Waerden number. 207 - Dietmar Dorninger, Helmut Länger:
An explicit formula for the solution of the Fisher-Wright selection model in population genetics. 209-211 - Manohar Lal Kaushik:
Comments on "a note on Reed-Muller codes". 213-214
Volume 6, Number 3, September 1983
- Margaret B. Cozzens, Fred S. Roberts:
Computing the boxicity of a graph by covering its complement by cointerval graphs. 217-228 - Mark K. Goldberg:
A nonfactorial algorithm for testing isomorphism of two graphs. 229-236 - Pierre Hansen:
Recognizing sign solvable graphs. 237-241 - Dorit S. Hochbaum:
Efficient bounds for the stable set, vertex cover and set packing problems. 243-254 - George Markowsky, Andrew Wohlgemuth:
Intersection-union systems. 255-262 - Grzegorz Rozenberg, R. Verraedt:
The goodness of {S, a}-EOL forms is decidable. 263-299 - Rainer Schrader:
Approximations to clustering and subgraph problems on trees. 301-309 - Marc Roubens, Philippe Vincke:
Linear orders and semiorders close to an interval order. 311-314 - Ronald D. Dutton, Robert C. Brigham:
A characterization of competition graphs. 315-317 - J. Richard Lundgren, John S. Maybee:
A characterization of graphs of competition number m. 319-322 - Fred S. Roberts, Jeffrey E. Steif:
A characterization of competition graphs of arbitrary digraphs. 323-326
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-20 23:39 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:
