Haiko Müller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Haiko Müller has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Martin Dyer
School of Computing University of Leeds Leeds UK
7 shared publications - Mark Jerrum
University of London
3 shared publications Martin Dyer
3 shared publications- Arash Rafiey
Indiana State University
2 shared publications - Sebastian Ordyniak
University of Leeds
2 shared publications - Ton Kloks
Department of Mathematics and Computer Science, Vrije Universiteit, 1081 HV Amsterdam, The Netherlands
2 shared publications
Latest Publications
- Open Access
- 2 April 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1075
Covering and partitioning of split, chain and cographs with isometric paths
- 2 April 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1075
Open AccessCovering and partitioning of split, chain and cographs with isometric paths
- Open Access
- 8 January 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 384, 177-200
Thick Forests
- 8 January 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 384, 177-200
Open AccessThick Forests
- 2 January 2026
- Published by Springer Nature
- p. 405-417
Interval k-graphs : Recognition and Forbidden Obstructions
- 2 January 2026
- Published by Springer Nature
- p. 405-417
Interval k-graphs : Recognition and Forbidden Obstructions
- Open Access
Interval H-graphs : Recognition and forbidden obstructions
We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition $V_1,\dots,V_k$ of its vertices is an interval $H$-graph if each vertex $v \in G$ can be represented by an interval $I_v$ from a real line so that $u \in V_i$ and $v \in V_j$ are adjacent if and only if $a_ia_j$ is an edge of $H$ and intervals $I_u$ and $I_v$ intersect. $G$ is called interval $k$-graph if $H$ is a complete graph on $k$ vertices. and interval bigraph when $k=2$. We study the ordering characterization and forbidden obstructions of interval $k$-graphs and present a polynomial-time recognition algorithm for them. Additionally, we discuss how this algorithm can be extended to recognize general interval $H$-graphs. Special cases of interval $k$-graphs, particularly comparability interval $k$-graphs, were previously studied in [2], where the complexity interval $k$-graph recognition was posed as an open problem.Open AccessInterval H-graphs : Recognition and forbidden obstructions
We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition $V_1,\dots,V_k$ of its vertices is an interval $H$-graph if each vertex $v \in G$ can be represented by an interval $I_v$ from a real line so that $u \in V_i$ and $v \in V_j$ are adjacent if and only if $a_ia_j$ is an edge of $H$ and intervals $I_u$ and $I_v$ intersect. $G$ is called interval $k$-graph if $H$ is a complete graph on $k$ vertices. and interval bigraph when $k=2$. We study the ordering characterization and forbidden obstructions of interval $k$-graphs and present a polynomial-time recognition algorithm for them. Additionally, we discuss how this algorithm can be extended to recognize general interval $H$-graphs. Special cases of interval $k$-graphs, particularly comparability interval $k$-graphs, were previously studied in [2], where the complexity interval $k$-graph recognition was posed as an open problem. - Open Access
A Tight Subexponential-time Algorithm for Two-Page Book Embedding
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2 pages, are of special importance as they are both NP-hard to compute and have specific applications. We obtain a 2^(O(\sqrt{n})) algorithm for computing a book embedding of an n-vertex graph on two pages -- a result which is asymptotically tight under the Exponential Time Hypothesis. As a key tool in our approach, we obtain a single-exponential fixed-parameter algorithm for the same problem when parameterized by the treewidth of the input graph. We conclude by establishing the fixed-parameter tractability of computing minimum-page book embeddings when parameterized by the feedback edge number, settling an open question arising from previous work on the problem.
Open AccessA Tight Subexponential-time Algorithm for Two-Page Book Embedding
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line. Two-page book embeddings, i.e., book embeddings into 2 pages, are of special importance as they are both NP-hard to compute and have specific applications. We obtain a 2^(O(\sqrt{n})) algorithm for computing a book embedding of an n-vertex graph on two pages -- a result which is asymptotically tight under the Exponential Time Hypothesis. As a key tool in our approach, we obtain a single-exponential fixed-parameter algorithm for the same problem when parameterized by the treewidth of the input graph. We conclude by establishing the fixed-parameter tractability of computing minimum-page book embeddings when parameterized by the feedback edge number, settling an open question arising from previous work on the problem.
- Open Access
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by McQuillan [CoRR abs/1301.2880 (2013)] and developed by Huang, Lu and Zhang [Proc. 27th Symp. on Disc. Algorithms (SODA16), 514-527]. We show that exact computation of the partition function is #P-hard, even for line graphs, indicating that an approximation algorithm is the best that can be expected. We also show that Glauber dynamics for the Ising model is rapidly mixing on line graphs, an example being the kagome lattice.
Open AccessPolynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of the antiferromagnetic Ising model on any line graph. The analysis of the algorithm exploits the "winding" technology devised by McQuillan [CoRR abs/1301.2880 (2013)] and developed by Huang, Lu and Zhang [Proc. 27th Symp. on Disc. Algorithms (SODA16), 514-527]. We show that exact computation of the partition function is #P-hard, even for line graphs, indicating that an approximation algorithm is the best that can be expected. We also show that Glauber dynamics for the Ising model is rapidly mixing on line graphs, an example being the kagome lattice.
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 35 (2) , 1503-1524
Counting Weighted Independent Sets beyond the Permanent
Jerrum, Sinclair, and Vigoda [J. ACM, 51 (2004), pp. 671--697] showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating th...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 35 (2) , 1503-1524
Counting Weighted Independent Sets beyond the Permanent
Jerrum, Sinclair, and Vigoda [J. ACM, 51 (2004), pp. 671--697] showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating th...
- Open Access
Counting independent sets in graphs with bounded bipartite pathwidth
We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter called bipartite pathwidth. This result, which we prove for the more general hardcore distribution with fugacity $\lambda$, can be viewed as a strong generalisation of Jerrum and Sinclair's work on approximately counting matchings, that is, independent sets in line graphs. The class of graphs with bounded bipartite pathwidth includes claw-free graphs, which generalise line graphs. We consider two further generalisations of claw-free graphs and prove that these classes have bounded bipartite pathwidth. We also show how to extend all our results to polynomially-bounded vertex weights.Open AccessCounting independent sets in graphs with bounded bipartite pathwidth
We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter called bipartite pathwidth. This result, which we prove for the more general hardcore distribution with fugacity $\lambda$, can be viewed as a strong generalisation of Jerrum and Sinclair's work on approximately counting matchings, that is, independent sets in line graphs. The class of graphs with bounded bipartite pathwidth includes claw-free graphs, which generalise line graphs. We consider two further generalisations of claw-free graphs and prove that these classes have bounded bipartite pathwidth. We also show how to extend all our results to polynomially-bounded vertex weights. - Open Access
Counting weighted independent sets beyond the permanent
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph. Equivalently, this may be viewed as approximating the partition function of vertex-weighted independent sets in the line graph of a bipartite graph. Line graphs of bipartite graphs are perfect graphs, and are known to be precisely the class of (claw, diamond, odd hole)-free graphs. So how far does the result of Jerrum, Sinclair and Vigoda extend? We first show that it extends to (claw, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, odd hole)-free graphs. Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chvatal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milanic (2008).
Open AccessCounting weighted independent sets beyond the permanent
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph. Equivalently, this may be viewed as approximating the partition function of vertex-weighted independent sets in the line graph of a bipartite graph. Line graphs of bipartite graphs are perfect graphs, and are known to be precisely the class of (claw, diamond, odd hole)-free graphs. So how far does the result of Jerrum, Sinclair and Vigoda extend? We first show that it extends to (claw, odd hole)-free graphs, and then show that it extends to the even larger class of (fork, odd hole)-free graphs. Our techniques are based on graph decompositions, which have been the focus of much recent work in structural graph theory, and on structural results of Chvatal and Sbihi (1988), Maffray and Reed (1999) and Lozin and Milanic (2008).
- Open Access
- 1 December 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 271, 25-48
Quasimonotone graphs
- 1 December 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 271, 25-48
Open AccessQuasimonotone graphs