Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A convoy scheduling problem
J. Bovet
,
C. Constantin
,
D. de Werra
Discrete Applied Mathematics
30
, 1991, pp. 1-14
NP-completeness of edge-colouring some restricted graphs
Leizhen Cai
,
John A. Ellis
Discrete Applied Mathematics
30
, 1991, pp. 15-27
Appoximation algorithms for hitting objects with straight lines
Refael Hassin
,
Nimrod Megiddo
Discrete Applied Mathematics
30
, 1991, pp. 29-42
On an edge ranking problem of trees and graphs
Ananth V. Iyer
,
H. Donald Ratliff
,
Gopalakrishnan Vijayan
Discrete Applied Mathematics
30
, 1991, pp. 43-52
Parallel machines scheduling with nonsimultaneous machine available time
Chung-Yee Lee
Discrete Applied Mathematics
30
, 1991, pp. 53-61
When each hexagon of a hexagonal system covers it
Fu-ji Zhang
,
Rong-si Chen
Discrete Applied Mathematics
30
, 1991, pp. 63-75
A note on isomorphic simulation of automata by networks of two-state automata
Zoltán ésik
Discrete Applied Mathematics
30
, 1991, pp. 77-82
Binary vectors with exactly
k
nonoverlapping
m
-tuples of consecutive ones
F.K. Hwang
,
S. Papastavridis
Discrete Applied Mathematics
30
, 1991, pp. 83-86
A difficulty in particular Shannon-like games
Yohei Yamasaki
Discrete Applied Mathematics
30
, 1991, pp. 87-90
Some recent results on niche graphs
Stephen Bowser
,
Charles A. Cable
Discrete Applied Mathematics
30
, 1991, pp. 101-108
The basic cyclic scheduling problem with deadlines
Philippe Chretienne
Discrete Applied Mathematics
30
, 1991, pp. 109-123
The relationship between the threshold dimension of split graphs and various dimensional parameters
Margaret B. Cozzens
,
Mark D. Halsey
Discrete Applied Mathematics
30
, 1991, pp. 125-135
On the use of augmenting chains in chain packings
D. de Werra
,
F.S. Roberts
Discrete Applied Mathematics
30
, 1991, pp. 137-149
Lopsided Lovász local lemma and Latin transversals
Paul Erdŏs
,
Joel Spencer
Discrete Applied Mathematics
30
, 1991, pp. 151-154
A deletion game on hypergraphs
Aviezri S. Fraenkel
,
Edward R. Scheinerman
Discrete Applied Mathematics
30
, 1991, pp. 155-162
Cut-threshold graphs
Peter L. Hammer
,
Frédéric Maffray
,
Maurice Queyranne
Discrete Applied Mathematics
30
, 1991, pp. 163-179
The continuous center set of a network
Pierre Hansen
,
Martine Labbé
,
Brigitte Nicolas
Discrete Applied Mathematics
30
, 1991, pp. 181-195
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
Marek Libura
Discrete Applied Mathematics
30
, 1991, pp. 197-211
Holes in random graphs
Tomasz Łuczak
Discrete Applied Mathematics
30
, 1991, pp. 213-219
Lattice bandwidth of random graphs
Colin McDiarmid
,
Zevi Miller
Discrete Applied Mathematics
30
, 1991, pp. 221-227
Connectivity of generalized prisms over
G
B.L. Piazza
,
R.D. Ringeisen
Discrete Applied Mathematics
30
, 1991, pp. 229-233
Threshold spectra via the Ehrenfeucht game
Joel H. Spencer
Discrete Applied Mathematics
30
, 1991, pp. 235-252
A note on compact graphs
G. Tinhofer
Discrete Applied Mathematics
30
, 1991, pp. 253-264
A generalization of the zero-one principle for sorting algorithms
Dorothea Wagner
,
Frank Wagner
Discrete Applied Mathematics
30
, 1991, pp. 265-273