Haiko Müller

2.6k total citations
48 papers, 1.2k citations indexed

About

Haiko Müller is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Haiko Müller has authored 48 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 10 papers in Computer Networks and Communications and 7 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Haiko Müller's work include Advanced Graph Theory Research (37 papers), Complexity and Algorithms in Graphs (23 papers) and Graph Labeling and Dimension Problems (19 papers). Haiko Müller is often cited by papers focused on Advanced Graph Theory Research (37 papers), Complexity and Algorithms in Graphs (23 papers) and Graph Labeling and Dimension Problems (19 papers). Haiko Müller collaborates with scholars based in Germany, United Kingdom and Netherlands. Haiko Müller's co-authors include Dieter Kratsch, Jürgen Vollmer, Robert Mencl, Ton Kloks, Andreas Brandstädt, Klaus Jansen, Hans L. Bodlaender, Jitender S. Deogun, Peter Damaschke and Jenő Lehel and has published in prestigious journals such as Journal of the ACM, Journal of Lightwave Technology and Theoretical Computer Science.

In The Last Decade

Haiko Müller

44 papers receiving 1.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Haiko Müller Germany	18	714	259	228	206	155	48	1.2k
Kyung‐Yong Chwa South Korea	15	155 0.2×	526 2.0×	216 0.9×	166 0.8×	8 0.1×	56	1.1k
Matthew J. Katz Israel	16	229 0.3×	201 0.8×	592 2.6×	78 0.4×	10 0.1×	101	979
Sylvain Pion France	15	192 0.3×	30 0.1×	411 1.8×	242 1.2×	4 0.0×	34	768
Andreas Fabri France	11	106 0.1×	130 0.5×	345 1.5×	211 1.0×	2 0.0×	18	773
Miao Jin United States	17	49 0.1×	237 0.9×	461 2.0×	524 2.5×		52	968
Chaoli Wang China	26	175 0.2×	726 2.8×	73 0.3×	34 0.2×		139	1.7k
Silvia Biasotti Italy	21	321 0.4×	8 0.0×	432 1.9×	981 4.8×	3 0.0×	93	1.8k
Weiwei Xu China	16	215 0.3×	29 0.1×	246 1.1×	266 1.3×		57	852
Lutz Kettner Germany	12	80 0.1×	33 0.1×	318 1.4×	208 1.0×	3 0.0×	35	501
Monique Teillaud France	15	100 0.1×	28 0.1×	434 1.9×	178 0.9×	2 0.0×	38	692

Countries citing papers authored by Haiko Müller

Since Specialization

Citations

This map shows the geographic impact of Haiko Müller's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Haiko Müller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Haiko Müller more than expected).

Fields of papers citing papers by Haiko Müller

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Haiko Müller. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Haiko Müller. The network helps show where Haiko Müller may publish in the future.

Co-authorship network of co-authors of Haiko Müller

This figure shows the co-authorship network connecting the top 25 collaborators of Haiko Müller. A scholar is included among the top collaborators of Haiko Müller based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Haiko Müller. Haiko Müller is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Müller, Haiko, et al.. (2021). Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. Queen Mary Research Online (Queen Mary University of London). 3 indexed citations

Dyer, Martin, Catherine Greenhill, & Haiko Müller. (2021). Counting independent sets in graphs with bounded bipartite pathwidth. Random Structures and Algorithms. 59(2). 204–237.

Müller, Haiko, et al.. (2021). Counting weighted independent sets beyond the permanent. Queen Mary Research Online (Queen Mary University of London). 4 indexed citations

Adler, Isolde, et al.. (2017). On rank-width of even-hole-free graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 1(Graph Theory).

Kloks, Ton, Haiko Müller, & Kristina Vušković. (2009). Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Journal of Combinatorial Theory Series B. 99(5). 733–800. 22 indexed citations

Brandstädt, Andreas, Dieter Kratsch, & Haiko Müller. (2007). Graph-theoretic concepts in computer science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers. DIAL (Catholic University of Leuven).

Lê, Van Bang, Raffaele Mosca, & Haiko Müller. (2007). On stable cutsets in claw-free graphs and planar graphs. Journal of Discrete Algorithms. 6(2). 256–276. 10 indexed citations

Kratsch, Dieter, Haiko Müller, & Ioan Todinca. (2007). Feedback vertex set on AT-free graphs. Discrete Applied Mathematics. 156(10). 1936–1947. 13 indexed citations

Kloks, Ton, Jan Kratochvı́l, & Haiko Müller. (2004). Computing the branchwidth of interval graphs. Discrete Applied Mathematics. 145(2). 266–275. 6 indexed citations

10.

Cryan, Mary, Martin Dyer, Haiko Müller, & Leen Stougie. (2003). Random walks on the vertices of transportation polytopes with constant number of sources. Symposium on Discrete Algorithms. 330–339. 4 indexed citations

11.

Fomin, Fedor V., Dieter Kratsch, & Haiko Müller. (2003). On the domination search number. Discrete Applied Mathematics. 127(3). 565–580. 6 indexed citations

12.

Bouchitté, Vincent, Dieter Kratsch, Haiko Müller, & Ioan Todinca. (2003). On treewidth approximations. Discrete Applied Mathematics. 136(2-3). 183–196. 25 indexed citations

13.

Babel, Luitpold, Ton Kloks, Jan Kratochvı́l, et al.. (2001). Efficient algorithms for graphs with few P4's. Discrete Mathematics. 235(1-3). 29–51. 16 indexed citations

14.

Müller, Haiko. (1997). Recognizing interval digraphs and interval bigraphs in polynomial time. Discrete Applied Mathematics. 78(1-3). 189–205. 46 indexed citations

15.

Kratsch, Dieter, Jenő Lehel, & Haiko Müller. (1996). Toughness, hamiltonicity and split graphs. Discrete Mathematics. 150(1-3). 231–245. 36 indexed citations

16.

Müller, Haiko. (1996). On edge perfectness and classes of bipartite graphs. Discrete Mathematics. 149(1-3). 159–187. 23 indexed citations

17.

Müller, Haiko. (1996). Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics. 156(1-3). 291–298. 59 indexed citations

18.

Jansen, Klaus & Haiko Müller. (1995). The minimum broadcast time problem for several processor networks. Theoretical Computer Science. 147(1-2). 69–85. 14 indexed citations

19.

Bodlaender, Hans L., Klaus Jansen, Ton Kloks, et al.. (1994). Ranking of Graphs. 292–304. 7 indexed citations

20.

Müller, Haiko & Andreas Brandstädt. (1987). The NP-completeness of steiner tree and dominating set for chordal bipartite graphs. Theoretical Computer Science. 53(2-3). 257–265. 61 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact