Haiko Müller - RankMe

98 papers A* 4A 6B 20C 3Journal 63Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Covering and partitioning of split, chain and cographs with isometric paths. Theor. Comput. Sci. Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2026	J	`jnl`	Thick Forests. Discret. Appl. Math. Martin E. Dyer, Haiko Müller
2025	J	`jnl`	Interval H-graphs : Recognition and forbidden obstructions. CoRR Haiko Müller, Arash Rafiey
2025	B	`conf`	Interval k-graphs : Recognition and Forbidden Obstructions. WG Haiko Müller, Arash Rafiey
2024	A*	`conf`	A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024	J	`jnl`	A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024	B	`conf`	Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2023	J	`jnl`	Thick Forests. CoRR Martin E. Dyer, Haiko Müller
2022	J	`jnl`	Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). Dagstuhl Reports Holger Dell, Mark Richard Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik
2021	J	`jnl`	Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2021	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2021	J	`jnl`	Counting independent sets in strongly orderable graphs. CoRR Marc Heinrich, Haiko Müller
2021	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Comb. Probab. Comput. Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2020	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers WG Isolde Adler, Haiko Müller
2020	J	`jnl`	Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller
2019	B	`conf`	Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2019	J	`jnl`	Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. Martin E. Dyer, Haiko Müller
2019	J	`jnl`	Counting independent sets in cocomparability graphs. Inf. Process. Lett. Martin E. Dyer, Haiko Müller
2019	J	`jnl`	Counting weighted independent sets beyond the permanent. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic
2019	J	`jnl`	Quasimonotone graphs. Discret. Appl. Math. Martin E. Dyer, Haiko Müller
2018	J	`jnl`	Counting Independent Sets in Cocomparability Graphs. CoRR Martin E. Dyer, Haiko Müller
2018	J	`jnl`	Counting independent sets in graphs with bounded bipartite pathwidth. CoRR Martin E. Dyer, Catherine S. Greenhill, Haiko Müller
2018	B	`conf`	Quasimonotone Graphs. WG Martin E. Dyer, Haiko Müller
2018	J	`jnl`	Quasimonotone graphs. CoRR Martin E. Dyer, Haiko Müller
2017	J	`jnl`	Counting perfect matchings and the switch chain. CoRR Martin E. Dyer, Haiko Müller
2017	J	`jnl`	On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2017	J	`jnl`	On the Switch Markov Chain for Perfect Matchings. J. ACM Martin E. Dyer, Mark Jerrum, Haiko Müller
2016	J	`jnl`	On rank-width of even-hole-free graphs. CoRR Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2016	A*	`conf`	On the switch Markov chain for perfect matchings. SODA Martin E. Dyer, Mark Jerrum, Haiko Müller
2015	J	`jnl`	On the switch Markov chain for perfect matchings. CoRR Martin E. Dyer, Mark Jerrum, Haiko Müller
2015	J	`jnl`	Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller
2014	J	`jnl`	Forbidden subgraph characterization of (P CoRR Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
2013	C	`conf`	An FPT Certifying Algorithm for the Vertex-Deletion Problem. IWOCA Haiko Müller, Samuel Wilson
2013	C	`conf`	Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction. CTW Haiko Müller, Samuel Wilson
2012	A	`conf`	Colouring AT-Free Graphs. ESA Dieter Kratsch, Haiko Müller
2012	B	`conf`	On the Stable Degree of Graphs. WG Haiko Müller
2012	J	`jnl`	Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2010	J	`jnl`	On a disparity between relative cliquewidth and relative NLC-width. Discret. Appl. Math. Haiko Müller, Ruth Urner
2010	C	`conf`	Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
2009	J	`jnl`	Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. J. Comb. Theory B Ton Kloks, Haiko Müller, Kristina Vuskovic
2009	J	`jnl`	On a property of minimal triangulations. Discret. Math. Dieter Kratsch, Haiko Müller
2008	J	`jnl`	Feedback vertex set on AT-free graphs. Discret. Appl. Math. Dieter Kratsch, Haiko Müller, Ioan Todinca
2008	J	`jnl`	On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms Van Bang Le, Raffaele Mosca, Haiko Müller
2008	J	`jnl`	Random walks on the vertices of transportation polytopes with constant number of sources. Random Struct. Algorithms Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
2007	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers WG Andreas Brandstädt, Dieter Kratsch, Haiko Müller
2005	J	`jnl`	Computing the branchwidth of interval graphs. Discret. Appl. Math. Ton Kloks, Jan Kratochvíl, Haiko Müller
2005	B	`conf`	On Stable Cutsets in Claw-Free Graphs and Planar Graphs. WG Van Bang Le, Raffaele Mosca, Haiko Müller
2004	J	`jnl`	Algorithms for graphs with small octopus. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2004	J	`jnl`	On treewidth approximations. Discret. Appl. Math. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
2003	B	`conf`	Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. WG Dieter Kratsch, Haiko Müller, Ioan Todinca
2003	J	`jnl`	On the Domination Search Number. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2003	B	`conf`	On the Recognition of General Partition Graphs. WG Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
2003	A*	`conf`	Random walks on the vertices of transportation polytopes with constant number of sources. SODA Mary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie
2003	J	`jnl`	Splitting a graph into disjoint induced paths or cycles. Discret. Appl. Math. Hoàng-Oanh Le, Van Bang Le, Haiko Müller
2002	J	`jnl`	A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
2001	J	`jnl`	Efficient algorithms for graphs with few Discret. Math. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
2001	J	`jnl`	On the Structure of Graphs with Bounded Asteroidal Number. Graphs Comb. Ton Kloks, Dieter Kratsch, Haiko Müller
2001	B	`conf`	On the Tree-Degree of Graphs. WG Maw-Shang Chang, Haiko Müller
2001	J	`jnl`	On treewidth approximations. Electron. Notes Discret. Math. Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
2000	B	`conf`	Bandwidth of Split and Circular Permutation Graphs. WG Ton Kloks, Dieter Kratsch, Yvan Le Borgne, Haiko Müller
2000	J	`jnl`	Degree-preserving trees. Networks Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
2000	J	`jnl`	Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. Ton Kloks, Dieter Kratsch, Haiko Müller
2000	B	`conf`	On the Domination Search Number. WG Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2000	J	`jnl`	Partial Orders on Weak Orders Convex Subsets. Order Haiko Müller, Jean-Xavier Rampon
1999	J	`jnl`	Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms Ton Kloks, Dieter Kratsch, Haiko Müller
1999	J	`jnl`	Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1999	A	`conf`	New Branchwidth Territories. STACS Ton Kloks, Jan Kratochvíl, Haiko Müller
1999	J	`jnl`	On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discret. Appl. Math. Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1999	J	`jnl`	On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. Ton Kloks, Dieter Kratsch, Haiko Müller
1998	B	`conf`	A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1998	J	`jnl`	Bandwidth of Chain Graphs. Inf. Process. Lett. Ton Kloks, Dieter Kratsch, Haiko Müller
1998	B	`conf`	Degree-Preserving Forests. MFCS Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
1998	J	`jnl`	Rankings of Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998	J	`jnl`	Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
1998	J	`jnl`	Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. Ton Kloks, Haiko Müller, C. K. Wong
1997	B	`conf`	Asteroidal Sets in Graphs. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1997	A*	`conf`	Independent Sets in Asteroidal Triple-Free Graphs. ICALP Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1997	J	`jnl`	Measuring the Vulnerability for Classes of Intersection Graphs. Discret. Appl. Math. Dieter Kratsch, Ton Kloks, Haiko Müller
1997	J	`jnl`	Partial orders and their convex subsets. Discret. Math. Haiko Müller, Jean-Xavier Rampon
1997	J	`jnl`	Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. Discret. Appl. Math. Haiko Müller
1996	J	`jnl`	Hamiltonian circuits in chordal bipartite graphs. Discret. Math. Haiko Müller
1996	J	`jnl`	On edge perfectness and classes of bipartite graphs. Discret. Math. Haiko Müller
1996	J	`jnl`	Toughness, hamiltonicity and split graphs. Discret. Math. Dieter Kratsch, Jenö Lehel, Haiko Müller
1996	B	`conf`	Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC Ton Kloks, Haiko Müller, C. K. Wong
1995	A	`conf`	Approximating the Bandwidth for Asteroidal Triple-Free Graphs. ESA Ton Kloks, Dieter Kratsch, Haiko Müller
1995	B	`conf`	Finding and Counting Small Induced Subgraphs Efficiently. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1995	J	`jnl`	The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. Klaus Jansen, Haiko Müller
1994	B	`conf`	Dominoes. WG Ton Kloks, Dieter Kratsch, Haiko Müller
1994	A	`conf`	Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1994	A	`conf`	On Vertex Ranking for Permutations and Other Graphs. STACS Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller
1994	B	`conf`	Ranking of Graphs. WG Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1994	—	`conf`	The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing Klaus Jansen, Haiko Müller
1993	J	`jnl`	A Note on Balanced Immunity. Math. Syst. Theory Haiko Müller
1993	A	`conf`	Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1993	J	`jnl`	Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. Inf. Process. Lett. Haiko Müller, Falk Nicolai
1991	—	`—`	Die Kompliziertheitsklassen raumbeschränkter Turingmaschinen: Relativierungen, Inklusionen, Separationen und Immunitäten. Haiko Müller
1990	J	`jnl`	Domination in Convex and Chordal Bipartite Graphs. Inf. Process. Lett. Peter Damaschke, Haiko Müller, Dieter Kratsch
1987	J	`jnl`	The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. Theor. Comput. Sci. Haiko Müller, Andreas Brandstädt