default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 30
Volume 30, Number 1, January 1991
- Jean Bovet, C. Constantin, Dominique de Werra:
A convoy scheduling problem. 1-14 - Leizhen Cai, John A. Ellis:
NP-completeness of edge-colouring some restricted graphs. 15-27 - Refael Hassin, Nimrod Megiddo:
Approximation algorithms for hitting objects with straight lines. 29-42 - Ananth V. Iyer, H. Donald Ratliff, Gopalakrishnan Vijayan:
On an edge ranking problem of trees and graphs. 43-52 - Chung-Yee Lee:
Parallel machines scheduling with nonsimultaneous machine available time. 53-61 - Fuji Zhang, Rong-si Chen:
When each hexagon of a hexagonal system covers it. 63-75 - Zoltán Ésik:
A note on isomorphic simulation of automata by networks of two-state automata. 77-82 - Frank K. Hwang, S. Papastavridis:
Binary vectors with exactly k nonoverlapping m-tuples of consecutive ones. 83-86 - Yohei Yamasaki:
A difficulty in particular Shannon-like games. 87-90 - Hosam M. Mahmoud
, Boris G. Pittel:
Corrigendum. 91
Volume 30, Numbers 2-3, February 1991
- Peter L. Hammer, Pierre Hansen, Fred S. Roberts:
Acknowledgement. 99 - Stephen Bowser, Charles Cable:
Some recent results on niche graphs. 101-108 - Philippe Chrétienne:
The basic cyclic scheduling problem with deadlines. 109-123 - Margaret B. Cozzens, Mark D. Halsey:
The relationship between the threshold dimension of split graphs and various dimensional parameters. 125-135 - Dominique de Werra, Fred S. Roberts:
On the use of augmenting chains in chain packings. 137-149 - Paul Erdös, Joel Spencer:
Lopsided Lovász Local Lemma and Latin transversals. 151-154 - Aviezri S. Fraenkel, Edward R. Scheinerman:
A deletion game on hypergraphs. 155-162 - Peter L. Hammer, Frédéric Maffray, Maurice Queyranne:
Cut-threshold graphs. 163-179 - Pierre Hansen, Martine Labbé, Brigitte Nicolas:
The continuous center set of a network. 181-195 - Marek Libura:
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. 197-211 - Tomasz Luczak:
Holes in random graphs. 213-219 - Colin McDiarmid, Zevi Miller:
Lattice bandwidth of random graphs. 221-227 - Barry L. Piazza, Richard D. Ringeisen:
Connectivity of generalized prisms over G. 229-233 - Joel Spencer:
Threshold spectra via the Ehrenfeucht game. 235-252 - Gottfried Tinhofer:
A note on compact graphs. 253-264 - Dorothea Wagner, Frank Wagner:
A generalization of the zero-one principle for sorting algorithms. 265-273
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-21 20:30 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:
