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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hard-to-color graphs for connected sequential colorings
Luitpold Babel
,
Gottfried Tinhofer
Discrete Applied Mathematics
51
(1-2), 1994, pp. 3-25
On edge-hamiltonian Cayley graphs
Ulrike Baumann
Discrete Applied Mathematics
51
(1-2), 1994, pp. 27-37
Subgraphs, closures and hamiltonicity
H.J. Broersma
,
I. Schiermeyer
Discrete Applied Mathematics
51
(1-2), 1994, pp. 39-46
A parallel algorithm for computing Steiner trees in strongly chordal graphs
Elias Dahlhaus
Discrete Applied Mathematics
51
(1-2), 1994, pp. 47-61
PLA folding in special graph classes
Peter Damaschke
Discrete Applied Mathematics
51
(1-2), 1994, pp. 63-74
Average distance and independence number
P. Dankelmann
Discrete Applied Mathematics
51
(1-2), 1994, pp. 75-83
Constructing colorings for diagrams
Stefan Felsner
,
Jens Gustedt
,
Michel Morvan
,
Jean-Xavier Rampon
Discrete Applied Mathematics
51
(1-2), 1994, pp. 85-93
Hamiltonicity of bipartite biclaw-free graphs
E. Flandrin
,
J.L. Fouquet
,
H. Li
Discrete Applied Mathematics
51
(1-2), 1994, pp. 95-102
A lower bounds for the shortness coefficient of a class of graphs
J. Harant
,
H. Walther
Discrete Applied Mathematics
51
(1-2), 1994, pp. 103-105
Hamiltonicity of a type of interchange graphs
Xuelliang Li
,
Fuji Zhang
Discrete Applied Mathematics
51
(1-2), 1994, pp. 107-111
On ordered graphs and graph orderings
Jaroslav Nes̑etȓil
Discrete Applied Mathematics
51
(1-2), 1994, pp. 113-116
How to find overfull subgraphs in graphs with large maximum degree
Thomas Niessen
Discrete Applied Mathematics
51
(1-2), 1994, pp. 117-125
A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs
Frank Pfeiffer
Discrete Applied Mathematics
51
(1-2), 1994, pp. 127-135
On reliable graphs with static routing plans
Werner Poguntke
Discrete Applied Mathematics
51
(1-2), 1994, pp. 137-146
Algorithms for interval catch digraphs
Erich Prisner
Discrete Applied Mathematics
51
(1-2), 1994, pp. 147-157
Algorithmic characterizations of interval ordered hypergraphs and applications
A. Quilliot
,
Sun Xiao Chao
Discrete Applied Mathematics
51
(1-2), 1994, pp. 159-170
Remark on the dimer problem
Horst Sachs
,
Holger Zernitz
Discrete Applied Mathematics
51
(1-2), 1994, pp. 171-179
Remarks on Hamiltonian properties of powers of digraphs
Günter Schaar
Discrete Applied Mathematics
51
(1-2), 1994, pp. 181-186
Inequalities for minimal covering sets in set systems of given rank
Zsolt Tuza
Discrete Applied Mathematics
51
(1-2), 1994, pp. 187-195
Chromatic number of prime distance graphs
M. Voigt
,
H. Walther
Discrete Applied Mathematics
51
(1-2), 1994, pp. 197-209
On graphs with equal domination and covering numbers
Lutz Volkmann
Discrete Applied Mathematics
51
(1-2), 1994, pp. 211-217
Computing the jump number on semi-orders is polynomial
A. von Arnim
,
C. de la Higuera
Discrete Applied Mathematics
51
(1-2), 1994, pp. 219-232
Embedding graphs of small size
Mariusz Woźniak
Discrete Applied Mathematics
51
(1-2), 1994, pp. 233-241
A parallel tabu search algorithm for large traveling salesman problems
C.-N. Fiechter
Discrete Applied Mathematics
51
(3), 1994, pp. 243-267
On the computation of pfaffians
G. Galbiati
,
F. Maffioli
Discrete Applied Mathematics
51
(3), 1994, pp. 269-275
Seiten 1
2
>