Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Haiko Müller
2010 – today
- 2013
[c25]Haiko Müller, Samuel Wilson: Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction. CTW 2013: 183-186- 2012
- [j38]Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14: 207-213 (2012)
- [c24]
- [c23]
- 2010
- [j37]Haiko Müller, Ruth Urner: On a disparity between relative cliquewidth and relative NLC-width. Discrete Applied Mathematics 158(7): 828-840 (2010)
- [c22]Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA 2010: 1-9
2000 – 2009
- 2009
- [j36]Dieter Kratsch, Haiko Müller: On a property of minimal triangulations. Discrete Mathematics 309(6): 1724-1729 (2009)
- [j35]Ton Kloks, Haiko Müller, Kristina Vuskovic: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. J. Comb. Theory, Ser. B 99(5): 733-800 (2009)
- 2008
- [j34]Dieter Kratsch, Haiko Müller, Ioan Todinca: Feedback vertex set on AT-free graphs. Discrete Applied Mathematics 156(10): 1936-1947 (2008)
- [j33]Van 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)
- [j32]Mary 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
- [e1]Andreas Brandstädt, Dieter Kratsch, Haiko Müller (Eds.): Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Lecture Notes in Computer Science 4769, Springer 2007, ISBN 978-3-540-74838-0
- 2005
- [j31]Ton Kloks, Jan Kratochvíl, Haiko Müller: Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145(2): 266-275 (2005)
- [c21]Van Bang Le, Raffaele Mosca, Haiko Müller: On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG 2005: 163-174
- 2004
- [j30]Fedor V. Fomin, Dieter Kratsch, Haiko Müller: Algorithms for graphs with small octopus. Discrete Applied Mathematics 134(1-3): 105-128 (2004)
- [j29]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Discrete Applied Mathematics 136(2-3): 183-196 (2004)
- 2003
- [j28]Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. Discrete Applied Mathematics 127(3): 565-580 (2003)
- [j27]Hoà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)
- [c20]Mary 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
- [c19]Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller: On the Recognition of General Partition Graphs. WG 2003: 273-283
- [c18]Dieter Kratsch, Haiko Müller, Ioan Todinca: Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG 2003: 309-321
- 2002
- [j26]Hajo 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
- [j25]Luitpold 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)
- [j24]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca: On treewidth approximations. Electronic Notes in Discrete Mathematics 8: 98-101 (2001)
- [j23]Ton Kloks, Dieter Kratsch, Haiko Müller: On the Structure of Graphs with Bounded Asteroidal Number. Graphs and Combinatorics 17(2): 295-306 (2001)
- [c17]
- 2000
- [j22]Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3-4): 115-121 (2000)
- [j21]Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000)
- [j20]Haiko Müller, Jean-Xavier Rampon: Partial Orders on Weak Orders Convex Subsets. Order 17(2): 103-123 (2000)
- [c16]
- [c15]Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller: Bandwidth of Split and Circular Permutation Graphs. WG 2000: 243-254
1990 – 1999
- 1999
- [j19]Jitender 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)
- [j18]Ton Kloks, Dieter Kratsch, Haiko Müller: On the structure of graphs with bounded asteroidal number. Electronic Notes in Discrete Mathematics 3: 94 (1999)
- [j17]Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32(1): 41-57 (1999)
- [j16]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 12(2): 276-287 (1999)
- [c14]
- 1998
- [j15]Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998)
- [j14]Ton Kloks, Dieter Kratsch, Haiko Müller: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998)
- [j13]Hans 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)
- [j12]Hans 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)
- [c13]Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721
- [c12]Hajo 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
- 1997
- [j11]Dieter Kratsch, Ton Kloks, Haiko Müller: Measuring the Vulnerability for Classes of Intersection Graphs. Discrete Applied Mathematics 77(3): 259-270 (1997)
- [j10]Haiko Müller: Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. Discrete Applied Mathematics 78(1-3): 189-205 (1997)
- [j9]Haiko Müller, Jean-Xavier Rampon: Partial orders and their convex subsets. Discrete Mathematics 165-166: 507-517 (1997)
- [c11]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770
- [c10]
- 1996
- [j8]Haiko Müller: On edge perfectness and classes of bipartite graphs. Discrete Mathematics 149(1-3): 159-187 (1996)
- [j7]Dieter Kratsch, Jenö Lehel, Haiko Müller: Toughness, hamiltonicity and split graphs. Discrete Mathematics 150(1-3): 231-245 (1996)
- [j6]Haiko Müller: Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics 156(1-3): 291-298 (1996)
- [c9]Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182
- 1995
- [j5]Klaus Jansen, Haiko Müller: The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. 147(1&2): 69-85 (1995)
- [c8]Ton Kloks, Dieter Kratsch, Haiko Müller: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA 1995: 434-447
- [c7]Ton Kloks, Dieter Kratsch, Haiko Müller: Finding and Counting Small Induced Subgraphs Efficiently. WG 1995: 14-23
- 1994
- [c6]Klaus Jansen, Haiko Müller: The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing 1994: 219-234
- [c5]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
- [c4]Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller: On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
- [c3]
- [c2]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
- 1993
- [j4]Haiko Müller, Falk Nicolai: Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. Inf. Process. Lett. 46(5): 225-230 (1993)
- [j3]
- [c1]Ton 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
- 1990
- [j2]Peter Damaschke, Haiko Müller, Dieter Kratsch: Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36(5): 231-236 (1990)
1980 – 1989
- 1987
- [j1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:52 CEST by the dblp team