dblp.uni-trier.dewww.uni-trier.de

Dieter Kratsch Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
114EEIyad A. Kanj, Dieter Kratsch: Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON 2009: 388-397
113EEHenning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
112EELjiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR abs/0909.4224: (2009)
111EEFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. 109(14): 795-798 (2009)
110EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5): (2009)
2008
109EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Faster Steiner Tree Computation in Polynomial-Space. ESA 2008: 430-441
108EEPinar Heggernes, Dieter Kratsch, Daniel Meister: Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227
107EEFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
106EESerge Gaspers, Dieter Kratsch, Mathieu Liedloff: On Independent Sets and Bicliques in Graphs. WG 2008: 171-182
105EEDieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni: Exact Algorithms for Dominating Set. Encyclopedia of Algorithms 2008
104EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster than 2 n . Algorithmica 52(2): 153-166 (2008)
103EEDieter Kratsch, Haiko Müller, Ioan Todinca: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics 156(10): 1936-1947 (2008)
102EEDieter Kratsch, Jeremy Spinrad, R. Sritharan: A new characterization of HH-free graphs. Discrete Mathematics 308(20): 4833-4835 (2008)
101EEFedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger: Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. 38(3): 1058-1079 (2008)
2007
100 Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
99 Andreas Brandstädt, Dieter Kratsch, Haiko Müller: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers Springer 2007
98EEAndreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad: 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007
97EEJan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Exact Algorithms for L (2, 1)-Labeling of Graphs. MFCS 2007: 513-524
96EEFedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff: Branch and Recharge: Exact Algorithms for Generalized Domination. WADS 2007: 507-518
95EEDieter Kratsch, Mathieu Liedloff: An exact algorithm for the minimum dominating clique problem. Theor. Comput. Sci. 385(1-3): 226-240 (2007)
94EEFedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. 41(2): 381-393 (2007)
2006
93EEHans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
92EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Solving Connected Dominating Set Faster Than 2n. FSTTCS 2006: 152-163
91EEDieter Kratsch, Mathieu Liedloff: An Exact Algorithm for the Minimum Dominating Clique Problem. IWPEC 2006: 130-141
90EEJohanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279
89EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and conquer: a simple O(20.288n) independent set algorithm. SODA 2006: 18-25
88EESerge Gaspers, Dieter Kratsch, Mathieu Liedloff: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT 2006: 148-159
87EETon Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu: Improved bottleneck domination algorithms. Discrete Applied Mathematics 154(11): 1578-1592 (2006)
86EEDieter Kratsch, Jeremy Spinrad: Minimal fill in O(n2.69) time. Discrete Mathematics 306(3): 366-371 (2006)
85EEDieter Kratsch, Jeremy Spinrad: Between O(nm) and O(nalpha). SIAM J. Comput. 36(2): 310-325 (2006)
84EEDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006)
2005
83 Dieter Kratsch: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers Springer 2005
82EEMaw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng: On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. COCOON 2005: 808-817
81EEFedor V. Fomin, Pinar Heggernes, Dieter Kratsch: Exact Algorithms for Graph Homomorphisms. FCT 2005: 161-171
80EEFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Measure and Conquer: Domination - A Case Study. ICALP 2005: 191-203
79 Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the EATCS 87: 47-77 (2005)
78EEAndreas Brandstädt, Dieter Kratsch: On the structure of (P5, gem)-free graphs. Discrete Applied Mathematics 145(2): 155-166 (2005)
77EEHans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005)
2004
76EEFedor V. Fomin, Dieter Kratsch, Ioan Todinca: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP 2004: 568-580
75EEFedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger: Exact (Exponential) Algorithms for the Dominating Set Problem. WG 2004: 245-256
74EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
73EEVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Discrete Applied Mathematics 136(2-3): 183-196 (2004)
2003
72EEHans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72
71EEDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167
70EEDieter Kratsch, Jeremy Spinrad: Between O(nm) and O(n alpha). SODA 2003: 709-716
69EEDieter Kratsch, Haiko Müller, Ioan Todinca: Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321
68EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
2002
67EEHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002)
66 Harald Hempel, Dieter Kratsch: On claw-free asteroidal triple-free graphs. Discrete Applied Mathematics 121(1-3): 155-180 (2002)
65EEFedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating minimum cocolorings. Inf. Process. Lett. 84(5): 285-290 (2002)
64EEHans L. Bodlaender, Dieter Kratsch: Kayles and Nimbers. J. Algorithms 43(1): 106-119 (2002)
63EEJitender S. Deogun, Dieter Kratsch: Dominating Pair Graphs. SIAM J. Discrete Math. 15(3): 353-366 (2002)
62EEDieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discrete Math. 15(4): 435-449 (2002)
2001
61EEFedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli: Approximating Minimum Cocolourings. FCT 2001: 118-125
60EELuitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu: Efficient algorithms for graphs with few P4's. Discrete Mathematics 235(1-3): 29-51 (2001)
59EEVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Electronic Notes in Discrete Mathematics 8: 98-101 (2001)
58EETon Kloks, Dieter Kratsch, Haiko Müller: On the Structure of Graphs with Bounded Asteroidal Number. Graphs and Combinatorics 17(2): 295-306 (2001)
2000
57EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. WG 2000: 161-171
56EETon Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller: Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
55EEDieter Kratsch: Domination and Total Domination on Asteroidal Triple-free Graphs. Discrete Applied Mathematics 99(1-3): 111-123 (2000)
54EEDouglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman: Chordality and 2-factors in Tough Graphs. Discrete Applied Mathematics 99(1-3): 323-329 (2000)
53EETon Kloks, Dieter Kratsch, Haiko Müller: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000)
52EEHajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000)
1999
51EEDieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. STACS 1999: 248-258
50EEHarald Hempel, Dieter Kratsch: On Claw-Free Asteroidal Triple-Free Graphs. WG 1999: 377-390
49EEJitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discrete Applied Mathematics 98(1-2): 39-63 (1999)
48EEDieter Kratsch, Lorna Stewart: Approximating Bandwidth by Mixing Layouts of Interval Graphs. Electronic Notes in Discrete Mathematics 3: 106-109 (1999)
47EETon Kloks, Dieter Kratsch, Haiko Müller: On the structure of graphs with bounded asteroidal number. Electronic Notes in Discrete Mathematics 3: 94 (1999)
46 Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999)
45EEHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 12(2): 276-287 (1999)
1998
44EEHajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
43EEHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG 1998: 88-99
42EEDieter Kratsch, Jean-Xavier Rampon: Tree-visibility orders. Discrete Mathematics 190(1-3): 163-175 (1998)
41EETon Kloks, Dieter Kratsch, Haiko Müller: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998)
40 Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998)
39EEHans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller: Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(2): (1998)
38 Ton Kloks, Dieter Kratsch: Listing All Minimal Separators of a Graph. SIAM J. Comput. 27(3): 605-613 (1998)
37EEHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Rankings of Graphs. SIAM J. Discrete Math. 11(1): 168-181 (1998)
1997
36EEHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
35EETon Kloks, Dieter Kratsch, Haiko Müller: Asteroidal Sets in Graphs. WG 1997: 229-241
34EEDieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. Discrete Applied Mathematics 77(3): 259-270 (1997)
33EEJitender S. Deogun, Dieter Kratsch, George Steiner: 1-Tough cocomparability graphs are hamiltonian. Discrete Mathematics 170(1-3): 99-106 (1997)
32EEJitender S. Deogun, Dieter Kratsch, George Steiner: An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. Inf. Process. Lett. 61(3): 121-127 (1997)
31EEDieter Kratsch, Lorna Stewart: Total Domination and Transformation. Inf. Process. Lett. 63(3): 167-170 (1997)
30EETon Kloks, Dieter Kratsch, Jeremy Spinrad: On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175(2): 309-335 (1997)
1996
29EETon Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267
28EEDieter Kratsch, Jenö Lehel, Haiko Müller: Toughness, hamiltonicity and split graphs. Discrete Mathematics 150(1-3): 231-245 (1996)
27EEDieter Kratsch, Jean-Xavier Rampon: Width two posets are reconstructible. Discrete Mathematics 162(1-3): 305-310 (1996)
1995
26EETon Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447
25EETon Kloks, Dieter Kratsch, Haiko Müller: Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23
24EEJitender S. Deogun, Dieter Kratsch: Diametral Path Graphs. WG 1995: 344-357
23EETon Kloks, Dieter Kratsch: Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Inf. Process. Lett. 55(1): 11-16 (1995)
22 Ton Kloks, Dieter Kratsch: Treewidth of Chordal Bipartite Graphs. J. Algorithms 19(2): 266-281 (1995)
21EEHans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8(4): 606-616 (1995)
1994
20 Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch: Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1994: 508
19EEJitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
18EETon Kloks, Dieter Kratsch: Finding All Minimal Separators of a Graph. STACS 1994: 759-768
17EETon Kloks, Dieter Kratsch, Haiko Müller: Dominoes. WG 1994: 106-120
16EEHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
15EEJohn G. Gimbel, Dieter Kratsch, Lorna Stewart: On Cocolourings and Cochromatic Numbers of Graphs. Discrete Applied Mathematics 48(2): 111-127 (1994)
14EEDieter Kratsch, Peter Damaschke, Anna Lubiw: Dominating cliques in chordal graphs. Discrete Mathematics 128(1-3): 269-275 (1994)
13 Dieter Kratsch, Lane A. Hemaspaandra: On the Complexity of Graph Reconstruction. Mathematical Systems Theory 27(3): 257-273 (1994)
1993
12EETon Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1993: 260-271
11EEHans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125
10EETon Kloks, Dieter Kratsch: Treewidth of Bipartite Graphs. STACS 1993: 80-89
9 Dieter Kratsch, Lorna Stewart: Domination on Cocomparability Graphs. SIAM J. Discrete Math. 6(3): 400-417 (1993)
1992
8 Hans L. Bodlaender, Dieter Kratsch: The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. 106(2): 309-326 (1992)
1991
7 Dieter Kratsch, Lane A. Hemachandra: On the Complexity of Graph Reconstruction. FCT 1991: 318-328
1990
6EEDieter Kratsch: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. Discrete Mathematics 86(1-3): 225-238 (1990)
5 Peter Damaschke, Haiko Müller, Dieter Kratsch: Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36(5): 231-236 (1990)
1987
4 Dieter Kratsch: Finding the Minimum Bandwidth of an Interval Graphs Inf. Comput. 74(2): 140-158 (1987)
3 Andreas Brandstädt, Dieter Kratsch: On Domination Problems for Permutation and Other Graphs. Theor. Comput. Sci. 54: 181-198 (1987)
1986
2 Andreas Brandstädt, Dieter Kratsch: On Partitions of Permutations into Increasing and Decreasing Subsequences. Elektronische Informationsverarbeitung und Kybernetik 22(5/6): 263-273 (1986)
1985
1 Andreas Brandstädt, Dieter Kratsch: On the restriction of some NP-complete graph problems to permutation graphs. FCT 1985: 53-62

Coauthor Index

1Luitpold Babel [60]
2Douglas Bauer [54]
3Hans L. Bodlaender [8] [11] [12] [16] [20] [21] [37] [39] [64] [72] [77] [93]
4Yvan Le Borgne [56]
5Vincent Bouchitté [59] [73]
6Andreas Brandstädt [1] [2] [3] [72] [77] [78] [98] [99] [100]
7Ljiljana Brankovic [112]
8Hajo Broersma (H. J. Broersma) [36] [43] [44] [45] [52] [67]
9Maw-Shang Chang [82]
10Johanne Cohen [90]
11Peter Damaschke [5] [14]
12Jitender S. Deogun [16] [19] [24] [32] [33] [37] [49] [63]
13Henning Fernau [112] [113]
14Fedor V. Fomin [57] [61] [65] [68] [74] [75] [76] [79] [80] [81] [89] [90] [92] [93] [94] [96] [101] [104] [105] [107] [109] [110] [111]
15Serge Gaspers [88] [106] [107] [113]
16John G. Gimbel [15]
17Petr A. Golovach [96] [111]
18Fabrizio Grandoni [79] [80] [89] [92] [104] [105] [109] [110]
19Pinar Heggernes [81] [90] [94] [108]
20Lane A. Hemaspaandra (Lane A. Hemachandra) [7] [13]
21Harald Hempel [50] [66]
22Andreas Huck [44] [52]
23Klaus Jansen [16] [37] [98] [100]
24Iyad A. Kanj [114]
25Gyula Y. Katona [54]
26Ton Kloks (Antonius J. J. Kloks) [10] [11] [12] [16] [17] [18] [19] [20] [21] [22] [23] [25] [26] [29] [30] [34] [35] [36] [37] [38] [39] [40] [41] [43] [44] [45] [46] [47] [49] [52] [53] [56] [58] [60] [67] [82] [87]
27Joachim Kneis [112]
28Otto R. Koppius [44] [52]
29Arie M. C. A. Koster [93]
30Jan Kratochvíl [60] [96] [97] [111]
31Gregory Kucherov [90]
32Alexander Langer [112]
33Chuan-Min Lee [87]
34Jenö Lehel (Jeno Lehel) [28]
35Mathieu Liedloff [88] [91] [95] [96] [97] [106] [107] [111] [112] [113]
36Jiping Liu [82] [87]
37Anna Lubiw [14]
38Ross M. McConnell [71] [84]
39Kurt Mehlhorn [71] [84]
40Daniel Meister [108]
41Haiko Müller [5] [12] [16] [17] [19] [20] [25] [26] [28] [34] [35] [36] [37] [39] [41] [43] [44] [45] [46] [47] [49] [52] [53] [56] [57] [58] [59] [60] [67] [68] [69] [73] [74] [99] [103]
42Jean-Christophe Novelli [61] [65]
43Stephan Olariu [60]
44Sheng-Lung Peng [82]
45Daniel Raible [112] [113]
46Jean-Xavier Rampon [27] [42]
47Michaël Rao [72] [77]
48Peter Rossmanith [112]
49Saket Saurabh [107]
50Jeremy Spinrad [30] [70] [71] [72] [77] [84] [85] [86] [98] [100] [102]
51R. Sritharan [102]
52George Steiner [32] [33]
53Lorna Stewart (Lorna K. Stewart) [9] [15] [31] [48] [51] [62]
54Dimitrios M. Thilikos [93]
55Ioan Todinca [59] [69] [73] [76] [101] [103]
56Hilde Tuinstra [44] [52]
57Zsolt Tuza [16] [37]
58Henk Jan Veldman [54]
59Yngve Villanger [101]
60Gerhard J. Woeginger [75]
61Chak-Kuen Wong (C. K. Wong) [29] [40]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)