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

Haiko Müller 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

*2008
56EEDieter Kratsch, Haiko Müller, Ioan Todinca: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics 156(10): 1936-1947 (2008)
55EEVan Bang Le, Raffaele Mosca, Haiko Müller: On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6(2): 256-276 (2008)
54EEMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie: Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms 33(3): 333-355 (2008)
2007
53 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
2005
52EEVan Bang Le, Raffaele Mosca, Haiko Müller: On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174
51EETon Kloks, Jan Kratochvíl, Haiko Müller: Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145(2): 266-275 (2005)
2004
50EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
49EEVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Discrete Applied Mathematics 136(2-3): 183-196 (2004)
2003
48EEMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie: Random walks on the vertices of transportation polytopes with constant number of sources. SODA 2003: 330-339
47EETon Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller: On the Recognition of General Partition Graphs. WG 2003: 273-283
46EEDieter Kratsch, Haiko Müller, Ioan Todinca: Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321
45EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
44EEHoàng-Oanh Le, Van Bang Le, Haiko Müller: Splitting a graph into disjoint induced paths or cycles. Discrete Applied Mathematics 131(1): 199-212 (2003)
2002
43EEHajo 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)
2001
42EEMaw-Shang Chang, Haiko Müller: On the Tree-Degree of Graphs. WG 2001: 44-54
41EELuitpold 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)
40EEVincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Electronic Notes in Discrete Mathematics 8: 98-101 (2001)
39EETon Kloks, Dieter Kratsch, Haiko Müller: On the Structure of Graphs with Bounded Asteroidal Number. Graphs and Combinatorics 17(2): 295-306 (2001)
2000
38EEFedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. WG 2000: 161-171
37EETon Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller: Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
36EETon Kloks, Dieter Kratsch, Haiko Müller: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000)
35EEHajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000)
34EEHaiko Müller, Jean-Xavier Rampon: Partial Orders on Weak Orders Convex Subsets. Order 17(2): 103-123 (2000)
1999
33EETon Kloks, Jan Kratochvíl, Haiko Müller: New Branchwidth Territories. STACS 1999: 173-183
32EEJitender 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)
31EETon Kloks, Dieter Kratsch, Haiko Müller: On the structure of graphs with bounded asteroidal number. Electronic Notes in Discrete Mathematics 3: 94 (1999)
30 Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999)
29EEHajo 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
28EEHajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
27EEHajo 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
26EETon Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998)
25EETon Kloks, Dieter Kratsch, Haiko Müller: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998)
24EEHans 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)
23EEHans 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
22EEHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
21EETon Kloks, Dieter Kratsch, Haiko Müller: Asteroidal Sets in Graphs. WG 1997: 229-241
20EEDieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. Discrete Applied Mathematics 77(3): 259-270 (1997)
19EEHaiko Müller: Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. Discrete Applied Mathematics 78(1-3): 189-205 (1997)
18EEHaiko Müller, Jean-Xavier Rampon: Partial orders and their convex subsets. Discrete Mathematics 165-166: 507-517 (1997)
1996
17EETon Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182
16EEHaiko Müller: On edge perfectness and classes of bipartite graphs. Discrete Mathematics 149(1-3): 159-187 (1996)
15EEDieter Kratsch, Jenö Lehel, Haiko Müller: Toughness, hamiltonicity and split graphs. Discrete Mathematics 150(1-3): 231-245 (1996)
14EEHaiko Müller: Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics 156(1-3): 291-298 (1996)
1995
13EETon Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447
12EETon Kloks, Dieter Kratsch, Haiko Müller: Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23
11EEKlaus Jansen, Haiko Müller: The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. 147(1&2): 69-85 (1995)
1994
10 Klaus Jansen, Haiko Müller: The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing 1994: 219-234
9 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
8EEJitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
7EETon Kloks, Dieter Kratsch, Haiko Müller: Dominoes. WG 1994: 106-120
6EEHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
1993
5EETon 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
4 Haiko Müller, Falk Nicolai: Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. Inf. Process. Lett. 46(5): 225-230 (1993)
3 Haiko Müller: A Note on Balanced Immunity. Mathematical Systems Theory 26(2): 157-167 (1993)
1990
2 Peter Damaschke, Haiko Müller, Dieter Kratsch: Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36(5): 231-236 (1990)
1987
1 Haiko Müller, Andreas Brandstädt: The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theor. Comput. Sci. 53: 257-265 (1987)

Coauthor Index

1Luitpold Babel [41]
2Hans L. Bodlaender [5] [6] [9] [23] [24]
3Yvan Le Borgne [37]
4Vincent Bouchitté [40] [49]
5Andreas Brandstädt [1] [53]
6Hajo Broersma (H. J. Broersma) [22] [27] [28] [29] [35] [43]
7Maw-Shang Chang [42]
8Mary Cryan [48] [54]
9Peter Damaschke [2]
10Jitender S. Deogun [6] [8] [23] [32]
11Martin E. Dyer [48] [54]
12Fedor V. Fomin [38] [45] [50]
13Andreas Huck [28] [35]
14Klaus Jansen [6] [10] [11] [23]
15Ton Kloks (Antonius J. J. Kloks) [5] [6] [7] [8] [9] [12] [13] [17] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [35] [36] [37] [39] [41] [43] [47] [51]
16Otto R. Koppius [28] [35]
17Jan Kratochvíl [33] [41] [51]
18Dieter Kratsch [2] [5] [6] [7] [8] [9] [12] [13] [15] [20] [21] [22] [23] [24] [25] [27] [28] [29] [30] [31] [32] [35] [36] [37] [38] [39] [40] [41] [43] [45] [46] [49] [50] [53] [56]
19Hoàng-Oanh Le [44]
20Van Bang Le [44] [52] [55]
21Chuan-Min Lee [47]
22Jenö Lehel (Jeno Lehel) [15]
23Jiping Liu [47]
24Raffaele Mosca [52] [55]
25Falk Nicolai [4]
26Stephan Olariu [41]
27Jean-Xavier Rampon [18] [34]
28Leen Stougie [48] [54]
29Ioan Todinca [40] [46] [49] [56]
30Hilde Tuinstra [28] [35]
31Zsolt Tuza [6] [23]
32Chak-Kuen Wong (C. K. Wong) [17] [26]

Colors in the list of coauthors

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