default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 9
Volume 9, Number 1, September 1984
- Reuven Bar-Yehuda, Shlomo Moran:
On approximation problems related to the independent set and vertex cover problems. 1-10 - Charles E. Blair, Robert G. Jeroslow:
Extensions of a theorem of Balas. 11-26 - Derek G. Corneil, Yehoshua Perl:
Clustering and domination in perfect graphs. 27-39 - Meigu Guan:
On the windy postman problem. 41-46 - Daniel A. Marcus:
Gale diagrams of convex polytopes and positive spanning sets of vectors. 47-67 - Keijo Ruohonen:
A note on off-line machines with 'brownian' input heads. 69-75 - Kokichi Sugihara:
An algebraic and combinatorial approach to the analysis of line drawings of polyhedra. 77-104 - Peter Buser:
On the bipartition of graphs. 105-109
Volume 9, Number 2, October 1984
- Thomas Andreae:
Note on a pursuit game played on graphs. 111-115 - Ramaswamy Chandrasekaran, Arie Tamir:
Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree. 117-123 - Christian Choffrut, Karel Culík II:
On extendibility of unavoidable sets. 125-137 - Françoise Fogelman-Soulié:
Frustration and stability in random boolean networks. 139-156 - Martin Charles Golumbic, Clyde L. Monma, William T. Trotter:
Tolerance graphs. 157-170 - Daniel Granot, Frieda Granot:
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope. 171-185 - D. Miklós:
Linear binary codes with intersection properties. 187-196 - Uzi Vishkin:
An optimal parallel connectivity algorithm. 197-207 - Ulrich Faigle:
A vector exchange property of submodular systems. 209-211 - Yoji Kajitani, Shuichi Ueno:
A matroid generalization of theorems of Lewin and Gallai. 213-216
Volume 9, Number 3, November 1984
- Charles E. Blair, Robert G. Jeroslow:
Constructive characterizations of the value-function of a mixed-integer program I. 217-233 - Jörg R. Mühlbacher, Frank X. Steinparz, Gottfried Tinhofer:
On certain classes of fractional matchings. 235-244 - Claudine Peyrat:
Diameter vulnerability of graphs. 245-250 - Fred S. Roberts
:
Applications of Ramsey theory. 251-261 - Eugeniusz Toczylowski:
A perfect matching algorithm for sparse bipartite graphs. 263-268 - Walter Whiteley:
A correspondence between scene analysis and motions of frameworks. 269-295 - Veikko Keränen:
On k-repetition freeness of length uniform morphisms over a binary alphabet. 297-300 - Moshe Sniedovich:
C-programming problems: a class of non-linear optimization problems. 301-305
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 2025-11-20 00:16 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:
