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: Author="Kratsch, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of AT-free graphs and a generic algorithm for solving triangulaiton problems
H.J. Broersma
,
T. Kloks
,
D. Kratsch
,
H. Müller
Algorithmica
32
(4), 2002, pp. 594-610
Approximating bandwidth by mixing layouts of interval graphs
D. Kratsch
,
L. Stewart
SIAM Journal on Discrete Mathematics
15
(4), 2002, pp. 435-449
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
Minimum fill-in on circle and circular-arc graphs
T. Kloks
,
D. Kratsch
,
C.K. Wong
Journal of Algorithms
28
(2), 1998, pp. 272-289
Listing all minimal separators of a graph
T. Kloks
,
D. Kratsch
SIAM Journal on Computing
27
(3), 1998, pp. 605-613
Minimum fill-in on circle and circular-arc graphs
T. Kloks
,
D. Kratsch
,
C.K. Wong
Lecture Notes in Computer Science
1099
, 1996, pp. 256-267
Rankings of graphs
H.L. Bodlaender
,
J.S. Deogun
,
K. Jansen
,
T. Kloks
,
D. Kratsch
,
H. Müller
,
Zs. Tuza
Lecture Notes in Computer Science
903
, 1995, pp. 292-304
Diametral path graphs
J.S. Deogun
,
D. Kratsch
Lecture Notes in Computer Science
1017
, 1995, pp. 344-357
Dominoes
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
903
, 1995, pp. 106-120
Approximating the bandwidth for asteroidal triple-free graphs
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
979
, 1995, pp. 434-447
Finding and counting small induced subgraphs efficiently
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
1017
, 1995, pp. 14-23
Computing a perfect edge without vertex elimination ordering of a chordal biparite graph
T. Kloks
,
D. Kratsch
Information Processing Letters
55
, 1995, pp. 11-16
Treewidth of chordal bipartite graphs
T. Kloks
,
D. Kratsch
Journal of Algorithms
19
(2), 1995, pp. 266-281
On vertex ranking for permutation and other graphs
J.S. Deogun
,
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
775
, 1994, pp. 747-758
Finding all minimal separators of a graph
T. Kloks
,
D. Kratsch
Lecture Notes in Computer Science
775
, 1994, pp. 759-768
Computing treewidth and minimum fill-in: All you need are the minimal separators
T. Kloks
,
H. Bodlaender
,
H. Müller
,
D. Kratsch
Lecture Notes in Computer Science
726
, 1993, pp. 260-271
Treewidth of chordal bipartite graphs
T. Kloks
,
D. Kratsch
Lecture Notes in Computer Science
665
, 1993, pp. 80-89
On domination problems for permutation and other graphs
A. Brandstadt
,
D. Kratsch
Theoretical Computer Science
54
(2-3), 1987, October, pp. 181-198
On the restriction of some
NP
-complete graph problems to permutation graphs
A. Brandstädt
,
D. Kratsch
Lecture Notes in Computer Science
199
, 1985, pp. 53-62