The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. - Haiko Müller; Andreas Brandstädt (Theor. Comput. Sci., 1987)

Domination in Convex and Chordal Bipartite Graphs. - Peter Damaschke; Haiko Müller; Dieter Kratsch (Inf. Process. Lett., 1990)

Die Kompliziertheitsklassen raumbeschränkter Turingmaschinen: Relativierungen, Inklusionen, Separationen und Immunitäten. - Haiko Müller (1991)

Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. - Ton Kloks; Hans L. Bodlaender; Haiko Müller; Dieter Kratsch (ESA, 1993)

Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. - Haiko Müller; Falk Nicolai (Inf. Process. Lett., 1993)

A Note on Balanced Immunity. - Haiko Müller (Math. Syst. Theory, 1993)

The Minimum Broadcast Time Problem. - Klaus Jansen; Haiko Müller (Canada-France Conference on Parallel and Distributed Computing, 1994)

Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. - Ton Kloks; Hans L. Bodlaender; Haiko Müller; Dieter Kratsch (ESA, 1994)

On Vertex Ranking for Permutations and Other Graphs. - Jitender S. Deogun; Ton Kloks; Dieter Kratsch; Haiko Müller (STACS, 1994)

Ranking of Graphs. - Hans L. Bodlaender; Jitender S. Deogun; Klaus Jansen; Ton Kloks; Dieter Kratsch; Haiko Müller; Zsolt Tuza (WG, 1994)

Dominoes. - Ton Kloks; Dieter Kratsch; Haiko Müller (WG, 1994)

The Minimum Broadcast Time Problem for Several Processor Networks. - Klaus Jansen; Haiko Müller (Theor. Comput. Sci., 1995)

Toughness, hamiltonicity and split graphs. - Dieter Kratsch; Jenö Lehel; Haiko Müller (Discret. Math., 1996)

On edge perfectness and classes of bipartite graphs. - Haiko Müller (Discret. Math., 1996)

Hamiltonian circuits in chordal bipartite graphs. - Haiko Müller (Discret. Math., 1996)

Asteroidal Sets in Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (WG, 1997)

Measuring the Vulnerability for Classes of Intersection Graphs. - Dieter Kratsch; Ton Kloks; Haiko Müller (Discret. Appl. Math., 1997)

Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. - Haiko Müller (Discret. Appl. Math., 1997)

Partial orders and their convex subsets. - Haiko Müller; Jean-Xavier Rampon (Discret. Math., 1997)

Degree-Preserving Forests. - Hajo Broersma; Andreas Huck; Ton Kloks; Otto R. Koppius; Dieter Kratsch; Haiko Müller; Hilde Tuinstra (MFCS, 1998)

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. - Hajo Broersma; Ton Kloks; Dieter Kratsch; Haiko Müller (WG, 1998)

Bandwidth of Chain Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (Inf. Process. Lett., 1998)

Vertex Ranking of Asteroidal Triple-Free Graphs. - Ton Kloks; Haiko Müller; C. K. Wong (Inf. Process. Lett., 1998)

Treewidth and Minimum Fill-in on d-Trapezoid Graphs. - Hans L. Bodlaender; Ton Kloks; Dieter Kratsch; Haiko Müller (J. Graph Algorithms Appl., 1998)

Rankings of Graphs. - Hans L. Bodlaender; Jitender S. Deogun; Klaus Jansen; Ton Kloks; Dieter Kratsch; Haiko Müller; Zsolt Tuza (SIAM J. Discret. Math., 1998)

New Branchwidth Territories. - Ton Kloks; Jan Kratochvíl; Haiko Müller (STACS, 1999)

On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. - Jitender S. Deogun; Ton Kloks; Dieter Kratsch; Haiko Müller (Discret. Appl. Math., 1999)

On the structure of graphs with bounded asteroidal number. - Ton Kloks; Dieter Kratsch; Haiko Müller (Electron. Notes Discret. Math., 1999)

Approximating the Bandwidth for Asteroidal Triple-Free Graphs. - Ton Kloks; Dieter Kratsch; Haiko Müller (J. Algorithms, 1999)

Independent Sets in Asteroidal Triple-Free Graphs. - Hajo Broersma; Ton Kloks; Dieter Kratsch; Haiko Müller (SIAM J. Discret. Math., 1999)

Bandwidth of Split and Circular Permutation Graphs. - Ton Kloks; Dieter Kratsch; Yvan Le Borgne; Haiko Müller (WG, 2000)

Finding and counting small induced subgraphs efficiently. - Ton Kloks; Dieter Kratsch; Haiko Müller (Inf. Process. Lett., 2000)

Degree-preserving trees. - Hajo Broersma; Otto R. Koppius; Hilde Tuinstra; Andreas Huck; Ton Kloks; Dieter Kratsch; Haiko Müller (Networks, 2000)

Partial Orders on Weak Orders Convex Subsets. - Haiko Müller; Jean-Xavier Rampon (Order, 2000)

On the Tree-Degree of Graphs. - Maw-Shang Chang; Haiko Müller (WG, 2001)

Efficient algorithms for graphs with few P4's. - Luitpold Babel; Ton Kloks; Jan Kratochvíl; Dieter Kratsch; Haiko Müller; Stephan Olariu (Discret. Math., 2001)

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. - Hajo Broersma; Ton Kloks; Dieter Kratsch; Haiko Müller (Algorithmica, 2002)

On the Recognition of General Partition Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu; Haiko Müller (WG, 2003)

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. - Dieter Kratsch; Haiko Müller; Ioan Todinca (WG, 2003)

On the Domination Search Number. - Fedor V. Fomin; Dieter Kratsch; Haiko Müller (Discret. Appl. Math., 2003)

Splitting a graph into disjoint induced paths or cycles. - Hoàng-Oanh Le; Van Bang Le; Haiko Müller (Discret. Appl. Math., 2003)

On treewidth approximations. - Vincent Bouchitté; Dieter Kratsch; Haiko Müller; Ioan Todinca (Discret. Appl. Math., 2004)

Algorithms for graphs with small octopus. - Fedor V. Fomin; Dieter Kratsch; Haiko Müller (Discret. Appl. Math., 2004)

Computing the branchwidth of interval graphs. - Ton Kloks; Jan Kratochvíl; Haiko Müller (Discret. Appl. Math., 2005)

Feedback vertex set on AT-free graphs. - Dieter Kratsch; Haiko Müller; Ioan Todinca (Discret. Appl. Math., 2008)

On stable cutsets in claw-free graphs and planar graphs. - Van Bang Le; Raffaele Mosca; Haiko Müller (J. Discrete Algorithms, 2008)

Random walks on the vertices of transportation polytopes with constant number of sources. - Mary Cryan; Martin E. Dyer; Haiko Müller; Leen Stougie (Random Struct. Algorithms, 2008)

On a property of minimal triangulations. - Dieter Kratsch; Haiko Müller (Discret. Math., 2009)

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. - Ton Kloks; Haiko Müller; Kristina Vuskovic (J. Comb. Theory B, 2009)

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. - Konrad K. Dabrowski; Vadim V. Lozin; Haiko Müller; Dieter Rautenbach (IWOCA, 2010)

On a disparity between relative cliquewidth and relative NLC-width. - Haiko Müller; Ruth Urner (Discret. Appl. Math., 2010)

Colouring AT-Free Graphs. - Dieter Kratsch; Haiko Müller (ESA, 2012)

On the Stable Degree of Graphs. - Haiko Müller (WG, 2012)

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. - Konrad K. Dabrowski; Vadim V. Lozin; Haiko Müller; Dieter Rautenbach (J. Discrete Algorithms, 2012)

Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction. - Haiko Müller; Samuel Wilson (CTW, 2013)

An FPT Certifying Algorithm for the Vertex-Deletion Problem. - Haiko Müller; Samuel Wilson (IWOCA, 2013)

Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. - Carl Feghali; Faisal N. Abu-Khzam; Haiko Müller (CoRR, 2014)

Partitioning a graph into disjoint cliques and a triangle-free graph. - Faisal N. Abu-Khzam; Carl Feghali; Haiko Müller (Discret. Appl. Math., 2015)

On rank-width of even-hole-free graphs. - Isolde Adler; Ngoc-Khang Le; Haiko Müller; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (Discret. Math. Theor. Comput. Sci., 2017)

On the Switch Markov Chain for Perfect Matchings. - Martin E. Dyer; Mark Jerrum; Haiko Müller (J. ACM, 2017)

Quasimonotone graphs. - Martin E. Dyer; Haiko Müller (Discret. Appl. Math., 2019)

Counting independent sets in cocomparability graphs. - Martin E. Dyer; Haiko Müller (Inf. Process. Lett., 2019)

Counting Perfect Matchings and the Switch Chain. - Martin E. Dyer; Haiko Müller (SIAM J. Discret. Math., 2019)

Counting independent sets in strongly orderable graphs. - Marc Heinrich; Haiko Müller (CoRR, 2021)

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. - Martin E. Dyer; Marc Heinrich; Mark Jerrum; Haiko Müller (Comb. Probab. Comput., 2021)

Counting independent sets in graphs with bounded bipartite pathwidth. - Martin E. Dyer; Catherine S. Greenhill; Haiko Müller (Random Struct. Algorithms, 2021)

Counting Weighted Independent Sets beyond the Permanent. - Martin E. Dyer; Mark Jerrum; Haiko Müller; Kristina Vuskovic (SIAM J. Discret. Math., 2021)

Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). - Holger Dell; Mark Richard Jerrum; Haiko Müller; Konrad Anand; Marcus Pappik (Dagstuhl Reports, 2022)

Thick Forests. - Martin E. Dyer; Haiko Müller (CoRR, 2023)

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. - Robert Ganian; Haiko Müller; Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki (ICALP, 2024)

Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. - Dibyayan Chakraborty; Haiko Müller; Sebastian Ordyniak; Fahad Panolan; Mateusz Rychlicki (MFCS, 2024)

Interval H-graphs : Recognition and forbidden obstructions. - Haiko Müller; Arash Rafiey (CoRR, 2025)