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=99
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cyclic graphs
F. Göbel
,
E.A. Neutel
Discrete Applied Mathematics
99
(1-3), 2000, pp. 3-12
On some infinite series of
(r,1)
-designs
Harald Gropp
Discrete Applied Mathematics
99
(1-3), 2000, pp. 13-21
On the strong chromatic index of cyclic multigraphs
Pavol Gvozdjak
,
Peter Horák
,
Mariusz Meszka
,
Zdzislaw Skupień
Discrete Applied Mathematics
99
(1-3), 2000, pp. 23-38
Independent sets with domination constraints
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
Discrete Applied Mathematics
99
(1-3), 2000, pp. 39-54
Tree partitioning under constraints - Clustering for vehicle routing problems
Anja Hamacher
,
Winfried Hochstättler
,
Christoph Moll
Discrete Applied Mathematics
99
(1-3), 2000, pp. 55-69
Reducible configurations for the cycle double cover conjecture
Andreas Huck
Discrete Applied Mathematics
99
(1-3), 2000, pp. 71-90
Connected domination and dominating clique in trapezoid graphs
Ekkehard Köhler
Discrete Applied Mathematics
99
(1-3), 2000, pp. 91-110
Domination and total domination on asteroidal triple-free graphs
Dieter Kratsch
Discrete Applied Mathematics
99
(1-3), 2000, pp. 111-123
Structural aspects of ordered polymatroids
Ulrich Krüger
Discrete Applied Mathematics
99
(1-3), 2000, pp. 125-148
Covering a rectangle with six and seven circles
J.B.M. Melissen
,
P.C. Schuur
Discrete Applied Mathematics
99
(1-3), 2000, pp. 149-156
N
-extendible posets, and how to minimize total weighted completion time
Markus Peter
,
Georg Wambach
Discrete Applied Mathematics
99
(1-3), 2000, pp. 157-167
Recognizing
k
-path graphs
Erich Prisner
Discrete Applied Mathematics
99
(1-3), 2000, pp. 169-181
On complexity, representation and approximation of integral multicommodity flows
Anand Srivastav
,
Peter Stangier
Discrete Applied Mathematics
99
(1-3), 2000, pp. 183-208
Uncolorable mixed hypergraphs
Zsolt Tuza
,
Vitaly Voloshin
Discrete Applied Mathematics
99
(1-3), 2000, pp. 209-227
Recognition of tractable satisfiability problems through balanced polynomial representations
Joost P. Warners
,
Hans van Maaren
Discrete Applied Mathematics
99
(1-3), 2000, pp. 229-244
Pancyclic out-arcs of a vertex in tournaments
Tianxing Yao
,
Yubao Guo
,
Kemin Zhang
Discrete Applied Mathematics
99
(1-3), 2000, pp. 245-249
Subtrees of bipartite digraphs - The minimum degree condition
Irmina A. Zioƚo
Discrete Applied Mathematics
99
(1-3), 2000, pp. 251-259
On the classification of
NP
-complete problems in terms of their correlation coefficient
Eric Angel
,
Vassilis Zissimopoulos
Discrete Applied Mathematics
99
(1-3), 2000, pp. 261-277
How to survive while visiting a graph
Claudio Arbib
,
Michele Flammini
,
Enrico Nardelli
Discrete Applied Mathematics
99
(1-3), 2000, pp. 279-293
Recognition and isomorphism of tree-like
P_4
-connected graphs
Luitpold Babel
Discrete Applied Mathematics
99
(1-3), 2000, pp. 295-315
Not every 2-tough graph is Hamiltonian
D. Bauer
,
H.J. Broersma
,
H.J. Veldman
Discrete Applied Mathematics
99
(1-3), 2000, pp. 317-321
Chordality and 2-factors in tough graphs
D. Bauer
,
G.Y. Katona
,
D. Kratsch
,
H.J. Veldman
Discrete Applied Mathematics
99
(1-3), 2000, pp. 323-329
Counting symmetric configurations
v_3
Anton Betten
,
Gunnar Brinkmann
,
Tomaz̑ Pisanski
Discrete Applied Mathematics
99
(1-3), 2000, pp. 331-338
Optimal paths in network games with
p
players
R. Boliac
,
Lozovanu
,
D. Solomon
Discrete Applied Mathematics
99
(1-3), 2000, pp. 339-348
Recognizing the
P_4
-structure of block graphs
Andreas Brandstädt
,
Van Bang Le
Discrete Applied Mathematics
99
(1-3), 2000, pp. 349-366
Seiten 1
2
>