| 2025 | WG | Interval k-graphs : Recognition and Forbidden Obstructions. | Haiko Mller, Arash Rafiey |
| 2024 | ICALP | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. | Robert Ganian, Haiko Mller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | MFCS | Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. | Dibyayan Chakraborty, Haiko Mller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki |
| 2019 | WG | Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. | Martin E. Dyer, Catherine S. Greenhill, Haiko Mller |
| 2018 | WG | Quasimonotone Graphs. | Martin E. Dyer, Haiko Mller |
| 2016 | SODA | On the switch Markov chain for perfect matchings. | Martin E. Dyer, Mark Jerrum, Haiko Mller |
| 2013 | IWOCA | An FPT Certifying Algorithm for the Vertex-Deletion Problem. | Haiko Mller, Samuel Wilson |
| 2012 | ESA | Colouring AT-Free Graphs. | Dieter Kratsch, Haiko Mller |
| 2012 | WG | On the Stable Degree of Graphs. | Haiko Mller |
| 2010 | IWOCA | Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Haiko Mller, Dieter Rautenbach |
| 2005 | WG | On Stable Cutsets in Claw-Free Graphs and Planar Graphs. | Van Bang Le, Raffaele Mosca, Haiko Mller |
| 2003 | SODA | Random walks on the vertices of transportation polytopes with constant number of sources. | Mary Cryan, Martin E. Dyer, Haiko Mller, Leen Stougie |
| 2003 | WG | On the Recognition of General Partition Graphs. | Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Mller |
| 2003 | WG | Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. | Dieter Kratsch, Haiko Mller, Ioan Todinca |
| 2001 | WG | On the Tree-Degree of Graphs. | Maw-Shang Chang, Haiko Mller |
| 2000 | WG | On the Domination Search Number. | Fedor V. Fomin, Dieter Kratsch, Haiko Mller |
| 2000 | WG | Bandwidth of Split and Circular Permutation Graphs. | Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Mller |
| 1999 | STACS | New Branchwidth Territories. | Ton Kloks, Jan Kratochvl, Haiko Mller |
| 1998 | MFCS | Degree-Preserving Forests. | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Mller, Hilde Tuinstra |
| 1998 | WG | 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 Mller |
| 1997 | ICALP | Independent Sets in Asteroidal Triple-Free Graphs. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | WG | Asteroidal Sets in Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1996 | ISAAC | Vertex Ranking of Asteroidal Triple-Free Graphs. | Ton Kloks, Haiko Mller, C. K. Wong |
| 1995 | ESA | Approximating the Bandwidth for Asteroidal Triple-Free Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1995 | WG | Finding and Counting Small Induced Subgraphs Efficiently. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | ESA | Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1994 | STACS | On Vertex Ranking for Permutations and Other Graphs. | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1994 | WG | Ranking of Graphs. | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Mller, Zsolt Tuza |
| 1994 | WG | Dominoes. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1993 | ESA | Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |