default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaiko Müller
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c30]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP 2024: 68:1-68:18- [c29]Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS 2024: 39:1-39:14 - [i14]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR abs/2404.14087 (2024) - 2023
- [i13]Martin E. Dyer, Haiko Müller:
Thick Forests. CoRR abs/2309.01482 (2023) - 2022
- [i12]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): 124-145 (2022) - 2021
- [j47]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): 905-921 (2021) - [j46]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59(2): 204-237 (2021) - [j45]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35(2): 1503-1524 (2021) - [i11]Marc Heinrich, Haiko Müller:
Counting independent sets in strongly orderable graphs. CoRR abs/2101.01997 (2021) - 2020
- [e2]Isolde Adler, Haiko Müller:
Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12301, Springer 2020, ISBN 978-3-030-60439-4 [contents] - [i10]Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller:
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. CoRR abs/2005.07944 (2020)
2010 – 2019
- 2019
- [j44]Martin E. Dyer, Haiko Müller:
Quasimonotone graphs. Discret. Appl. Math. 271: 25-48 (2019) - [j43]Martin E. Dyer, Haiko Müller:
Counting independent sets in cocomparability graphs. Inf. Process. Lett. 144: 31-36 (2019) - [j42]Martin E. Dyer, Haiko Müller:
Counting Perfect Matchings and the Switch Chain. SIAM J. Discret. Math. 33(3): 1146-1174 (2019) - [c28]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. WG 2019: 298-310 - [i9]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting weighted independent sets beyond the permanent. CoRR abs/1909.03414 (2019) - 2018
- [c27]Martin E. Dyer, Haiko Müller:
Quasimonotone Graphs. WG 2018: 190-202 - [i8]Martin E. Dyer, Haiko Müller:
Quasimonotone graphs. CoRR abs/1801.06494 (2018) - [i7]Martin E. Dyer, Haiko Müller:
Counting Independent Sets in Cocomparability Graphs. CoRR abs/1808.09853 (2018) - [i6]Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. CoRR abs/1812.03195 (2018) - 2017
- [j41]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) - [j40]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the Switch Markov Chain for Perfect Matchings. J. ACM 64(2): 12:1-12:33 (2017) - [i5]Martin E. Dyer, Haiko Müller:
Counting perfect matchings and the switch chain. CoRR abs/1705.05790 (2017) - 2016
- [c26]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. SODA 2016: 1972-1983 - [i4]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. CoRR abs/1611.09907 (2016) - 2015
- [j39]Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller:
Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 190-191: 1-12 (2015) - [i3]Martin E. Dyer, Mark Jerrum, Haiko Müller:
On the switch Markov chain for perfect matchings. CoRR abs/1501.07725 (2015) - 2014
- [i2]Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller:
Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. CoRR abs/1403.5961 (2014) - 2013
- [c25]Haiko Müller, Samuel Wilson:
An FPT Certifying Algorithm for the Vertex-Deletion Problem. IWOCA 2013: 468-472 - [i1]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 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: 207-213 (2012) - [c24]Dieter Kratsch, Haiko Müller:
Colouring AT-Free Graphs. ESA 2012: 707-718 - [c23]Haiko Müller:
On the Stable Degree of Graphs. WG 2012: 148-159 - 2010
- [j37]Haiko Müller, Ruth Urner:
On a disparity between relative cliquewidth and relative NLC-width. Discret. Appl. Math. 158(7): 828-840 (2010) - [c22]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: 1-9
2000 – 2009
- 2009
- [j36]Dieter Kratsch, Haiko Müller:
On a property of minimal triangulations. Discret. Math. 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 B 99(5): 733-800 (2009) - 2008
- [j34]Dieter Kratsch, Haiko Müller, Ioan Todinca:
Feedback vertex set on AT-free graphs. Discret. Appl. Math. 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:
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 [contents] - 2005
- [j31]Ton Kloks, Jan Kratochvíl, Haiko Müller:
Computing the branchwidth of interval graphs. Discret. Appl. Math. 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. Discret. Appl. Math. 134(1-3): 105-128 (2004) - [j29]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Discret. Appl. Math. 136(2-3): 183-196 (2004) - 2003
- [j28]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. Discret. Appl. Math. 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. Discret. Appl. Math. 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. Discret. Math. 235(1-3): 29-51 (2001) - [j24]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Electron. Notes Discret. Math. 8: 98-101 (2001) - [j23]Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Structure of Graphs with Bounded Asteroidal Number. Graphs Comb. 17(2): 295-306 (2001) - [c17]Maw-Shang Chang, Haiko Müller:
On the Tree-Degree of Graphs. WG 2001: 44-54 - 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]Fedor V. Fomin, Dieter Kratsch, Haiko Müller:
On the Domination Search Number. WG 2000: 161-171 - [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. Discret. Appl. Math. 98(1-2): 39-63 (1999) - [j18]Ton Kloks, Dieter Kratsch, Haiko Müller:
On the structure of graphs with bounded asteroidal number. Electron. Notes Discret. Math. 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. Discret. Math. 12(2): 276-287 (1999) - [c14]Ton Kloks, Jan Kratochvíl, Haiko Müller:
New Branchwidth Territories. STACS 1999: 173-183 - 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(5): 1-23 (1998) - [j12]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): 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. Discret. Appl. Math. 77(3): 259-270 (1997) - [j10]Haiko Müller:
Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. Discret. Appl. Math. 78(1-3): 189-205 (1997) - [j9]Haiko Müller, Jean-Xavier Rampon:
Partial orders and their convex subsets. Discret. Math. 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]Ton Kloks, Dieter Kratsch, Haiko Müller:
Asteroidal Sets in Graphs. WG 1997: 229-241 - 1996
- [j8]Haiko Müller:
On edge perfectness and classes of bipartite graphs. Discret. Math. 149(1-3): 159-187 (1996) - [j7]Dieter Kratsch, Jenö Lehel, Haiko Müller:
Toughness, hamiltonicity and split graphs. Discret. Math. 150(1-3): 231-245 (1996) - [j6]Haiko Müller:
Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 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]Ton Kloks, Dieter Kratsch, Haiko Müller:
Dominoes. WG 1994: 106-120 - [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]Haiko Müller:
A Note on Balanced Immunity. Math. Syst. Theory 26(2): 157-167 (1993) - [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 - 1991
- [b1]Haiko Müller:
Die Kompliziertheitsklassen raumbeschränkter Turingmaschinen: Relativierungen, Inklusionen, Separationen und Immunitäten. University of Jena, Germany, 1991 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
