Haiko Müller

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 24

Top Venues

CoRR

Discret. Appl. Math.

SIAM J. Discret. Math.

University of Jena, Germany (PHD)

Education History

University of Jena, Germany

PHD

Publications

Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR (2024)
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS (2024)
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP (2024)
Martin E. Dyer, Haiko Müller
Thick Forests. CoRR (2023)
Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). Dagstuhl Reports 12 (11) (2022)
Marc Heinrich, Haiko Müller
Counting independent sets in strongly orderable graphs. CoRR (2021)
Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. 30 (6) (2021)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59 (2) (2021)
Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35 (2) (2021)
Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR (2020)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG (2019)
Martin E. Dyer, Haiko Müller
Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. 33 (3) (2019)
Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
Counting weighted independent sets beyond the permanent. CoRR (2019)
Martin E. Dyer, Haiko Müller
Quasimonotone graphs. Discret. Appl. Math. 271 (2019)
Martin E. Dyer, Haiko Müller
Counting independent sets in cocomparability graphs. Inf. Process. Lett. 144 (2019)
Martin E. Dyer, Haiko Müller
Quasimonotone Graphs. WG (2018)
Martin E. Dyer, Haiko Müller
Quasimonotone graphs. CoRR (2018)
Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR (2018)
Martin E. Dyer, Haiko Müller
Counting Independent Sets in Cocomparability Graphs. CoRR (2018)
Martin E. Dyer, Haiko Müller
Counting perfect matchings and the switch chain. CoRR (2017)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the Switch Markov Chain for Perfect Matchings. J. ACM 64 (2) (2017)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the switch Markov chain for perfect matchings. SODA (2016)
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
On rank-width of even-hole-free graphs. CoRR (2016)
Martin E. Dyer, Mark Jerrum, Haiko Müller
On the switch Markov chain for perfect matchings. CoRR (2015)
Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller
Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. (2015)
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
-free)-colourable cographs. CoRR (2014)
Haiko Müller, Samuel Wilson
An FPT Certifying Algorithm for the Vertex-Deletion Problem. IWOCA (2013)
Haiko Müller, Samuel Wilson
Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction. CTW (2013)
Dieter Kratsch, Haiko Müller
Colouring AT-Free Graphs. ESA (2012)
Konrad K. 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 (2012)
Haiko Müller
On the Stable Degree of Graphs. WG (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA (2010)
Haiko Müller, Ruth Urner
On a disparity between relative cliquewidth and relative NLC-width. Discret. Appl. Math. 158 (7) (2010)
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) (2009)
Dieter Kratsch, Haiko Müller
On a property of minimal triangulations. Discret. Math. 309 (6) (2009)
Van Bang Le, Raffaele Mosca, Haiko Müller
On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6 (2) (2008)
Dieter Kratsch, Haiko Müller, Ioan Todinca
Feedback vertex set on AT-free graphs. Discret. Appl. Math. 156 (10) (2008)
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) (2008)
Van Bang Le, Raffaele Mosca, Haiko Müller
On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG (2005)
Ton Kloks, Jan Kratochvíl, Haiko Müller
Computing the branchwidth of interval graphs. Discret. Appl. Math. 145 (2) (2005)
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
On treewidth approximations. Discret. Appl. Math. 136 (2-3) (2004)
Fedor V. Fomin, Dieter Kratsch, Haiko Müller
Algorithms for graphs with small octopus. Discret. Appl. Math. 134 (1-3) (2004)
Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
On the Recognition of General Partition Graphs. WG (2003)
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)
Fedor V. Fomin, Dieter Kratsch, Haiko Müller
On the Domination Search Number. Discret. Appl. Math. 127 (3) (2003)
Hoàng-Oanh Le, Van Bang Le, Haiko Müller
Splitting a graph into disjoint induced paths or cycles. Discret. Appl. Math. 131 (1) (2003)
Dieter Kratsch, Haiko Müller, Ioan Todinca
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG (2003)
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) (2002)
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
On treewidth approximations. Electron. Notes Discret. Math. 8 (2001)
Maw-Shang Chang, Haiko Müller
On the Tree-Degree of Graphs. WG (2001)
Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
's. Discret. Math. 235 (1-3) (2001)
Ton Kloks, Dieter Kratsch, Haiko Müller
On the Structure of Graphs with Bounded Asteroidal Number. Graphs Comb. 17 (2) (2001)
Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
Degree-preserving trees. Networks 35 (1) (2000)
Ton Kloks, Dieter Kratsch, Haiko Müller
Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74 (3-4) (2000)
Fedor V. Fomin, Dieter Kratsch, Haiko Müller
On the Domination Search Number. WG (2000)
Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
Bandwidth of Split and Circular Permutation Graphs. WG (2000)
Haiko Müller, Jean-Xavier Rampon
Partial Orders on Weak Orders Convex Subsets. Order 17 (2) (2000)
Ton Kloks, Jan Kratochvíl, Haiko Müller
New Branchwidth Territories. STACS (1999)
Ton Kloks, Dieter Kratsch, Haiko Müller
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32 (1) (1999)
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 12 (2) (1999)
Ton Kloks, Dieter Kratsch, Haiko Müller
On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. 3 (1999)
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discret. Appl. Math. 98 (1-2) (1999)
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
Rankings of Graphs. SIAM J. Discret. Math. 11 (1) (1998)
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2 (5) (1998)
Ton Kloks, Haiko Müller, C. K. Wong
Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68 (4) (1998)
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)
Ton Kloks, Dieter Kratsch, Haiko Müller
Bandwidth of Chain Graphs. Inf. Process. Lett. 68 (6) (1998)
Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
Degree-Preserving Forests. MFCS (1998)
Dieter Kratsch, Ton Kloks, Haiko Müller
Measuring the Vulnerability for Classes of Intersection Graphs. Discret. Appl. Math. 77 (3) (1997)
Ton Kloks, Dieter Kratsch, Haiko Müller
Asteroidal Sets in Graphs. WG (1997)
Haiko Müller, Jean-Xavier Rampon
Partial orders and their convex subsets. Discret. Math. (1997)
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
Independent Sets in Asteroidal Triple-Free Graphs. ICALP (1997)
Haiko Müller
Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. Discret. Appl. Math. 78 (1-3) (1997)
Haiko Müller
On edge perfectness and classes of bipartite graphs. Discret. Math. 149 (1-3) (1996)
Dieter Kratsch, Jenö Lehel, Haiko Müller
Toughness, hamiltonicity and split graphs. Discret. Math. 150 (1-3) (1996)
Haiko Müller
Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 156 (1-3) (1996)
Ton Kloks, Haiko Müller, C. K. Wong
Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC (1996)
Klaus Jansen, Haiko Müller
The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. 147 (1&2) (1995)
Ton Kloks, Dieter Kratsch, Haiko Müller
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA (1995)
Ton Kloks, Dieter Kratsch, Haiko Müller
Finding and Counting Small Induced Subgraphs Efficiently. WG (1995)
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
Ranking of Graphs. WG (1994)
Klaus Jansen, Haiko Müller
The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing (1994)
Ton Kloks, Dieter Kratsch, Haiko Müller
Dominoes. WG (1994)
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
On Vertex Ranking for Permutations and Other Graphs. STACS (1994)
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)
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)
Haiko Müller
A Note on Balanced Immunity. Math. Syst. Theory 26 (2) (1993)
Haiko Müller, Falk Nicolai
Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. Inf. Process. Lett. 46 (5) (1993)
Peter Damaschke, Haiko Müller, Dieter Kratsch
Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. 36 (5) (1990)
Haiko Müller, Andreas Brandstädt
The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theor. Comput. Sci. 53 (1987)

Haiko Müller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Haiko Müller