Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2013 | 2009 | 2002 | 2000 | 1999 | 1998 | 1997
Number of items: 11.

2013

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2013) Fully decomposable split graphs. European journal of combinatorics, 34 (3). pp. 567-575. ISSN 0195-6698

2009

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2009) Fully decomposable split graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 105-112).

2002

Broersma, H.J. and Kloks, T. and Kratsch, D. and Müller, H. (2002) A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica, 32 (4). pp. 594-610. ISSN 0178-4617

2000

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (2000) Chordality and 2-factors in tough graphs. Discrete Mathematics, 99 (1-3). pp. 323-329. ISSN 0012-365X

Broersma, Hajo and Koppius, Otto and Tuinstra, Hilde and Huck, Andreas and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (2000) Degree-preserving trees. Networks, 35 (1). pp. 26-39. ISSN 0028-3045

1999

Broersma, Hajo and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (1999) Independent Sets in Asteroidal Triple-Free Graphs. SIAM Journal on Discrete Mathematics, 12 (2). pp. 276-287. ISSN 0895-4801

1998

Broersma, Hajo and Huck, Andreas and Kloks, Ton and Koppius, Otto and Kratsch, Dieter and Müller, Haiko and Tuinstra, Hilde (1998) Degree-preserving forests. In: Mathematical foundations of computer science 1998. Lecture notes in computer science, 1450 . Springer, pp. 713-721. ISBN 9783540648277

Broersma, Hajo and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (1998) A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. In: Graph-Theoretic Concepts in Computer Science. Lecture notes in computer science, 1517 . Springer, pp. 88-99. ISBN 9783540651956

Kloks, T. and Kratsch, D. and Wong, C.K. (1998) Minimum fill-in on circle and circular-arc graphs. Journal of algorithms, 28 (2). pp. 272-289. ISSN 0196-6774

1997

Broersma, Hajo and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (1997) Independent sets in asteroidal triple-free graphs. In: Automata, Languages and Programming. Lecture notes in computer science, 1256 . Springer. ISBN 9783540631651

Kloks, Ton and Kratsch, Dieter and Spinrad, Jeremy (1997) On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical computer science, 175 (2). pp. 309-335. ISSN 0304-3975

This list was generated on Fri Dec 19 05:20:34 2014 CET.