Hans L. Bodlaender

16.9k total citations · 2 hit papers
225 papers, 5.5k citations indexed

About

Hans L. Bodlaender is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Hans L. Bodlaender has authored 225 papers receiving a total of 5.5k indexed citations (citations by other indexed papers that have themselves been cited), including 171 papers in Computational Theory and Mathematics, 75 papers in Computer Networks and Communications and 38 papers in Artificial Intelligence. Recurrent topics in Hans L. Bodlaender's work include Advanced Graph Theory Research (150 papers), Complexity and Algorithms in Graphs (90 papers) and Graph Labeling and Dimension Problems (50 papers). Hans L. Bodlaender is often cited by papers focused on Advanced Graph Theory Research (150 papers), Complexity and Algorithms in Graphs (90 papers) and Graph Labeling and Dimension Problems (50 papers). Hans L. Bodlaender collaborates with scholars based in Netherlands, Germany and Norway. Hans L. Bodlaender's co-authors include Ton Kloks, Arie M. C. A. Koster, Michael R. Fellows, Fedor V. Fomin, Dimitrios M. Thilikos, Rodney G. Downey, Dieter Kratsch, Danny Hermelin, Stefan Kratsch and Klaus Jansen and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and SIAM Journal on Optimization.

In The Last Decade

Hans L. Bodlaender

216 papers receiving 5.1k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

1996 668 citations Hans L. Bodlaender profile →
A partial k-arboretum of graphs with bounded treewidth

1998 515 citations Hans L. Bodlaender Theoretical Computer Science profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Hans L. Bodlaender Netherlands	38	4.5k	1.8k	964	648	426	225	5.5k
Fedor V. Fomin Norway	32	3.7k 0.8×	1.7k 0.9×	657 0.7×	555 0.9×	286 0.7×	262	4.6k
Derek G. Corneil Canada	30	2.7k 0.6×	1.1k 0.6×	749 0.8×	485 0.7×	210 0.5×	96	4.2k
Martin Grohe Germany	32	3.2k 0.7×	1.3k 0.7×	1.2k 1.3×	421 0.6×	207 0.5×	158	4.3k
Michael Saks United States	34	1.9k 0.4×	1.4k 0.8×	1.4k 1.4×	295 0.5×	144 0.3×	139	3.5k
Rodney G. Downey New Zealand	21	3.3k 0.7×	829 0.5×	974 1.0×	221 0.3×	143 0.3×	129	3.9k
Miklós Ajtai United States	30	2.5k 0.5×	1.0k 0.6×	2.5k 2.6×	563 0.9×	181 0.4×	85	4.3k
Márió Szegedy United States	28	3.2k 0.7×	1.5k 0.8×	3.2k 3.3×	266 0.4×	379 0.9×	83	5.2k
Johan Håstad Sweden	30	2.7k 0.6×	1.2k 0.7×	2.4k 2.5×	211 0.3×	319 0.7×	111	4.6k
Dániel Marx Hungary	26	2.2k 0.5×	1.1k 0.6×	503 0.5×	350 0.5×	176 0.4×	147	2.9k
Martin Charles Golumbic Israel	29	1.9k 0.4×	834 0.5×	375 0.4×	395 0.6×	169 0.4×	100	2.6k

Countries citing papers authored by Hans L. Bodlaender

Since Specialization

Citations

This map shows the geographic impact of Hans L. Bodlaender'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 Hans L. Bodlaender with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hans L. Bodlaender more than expected).

Fields of papers citing papers by Hans L. Bodlaender

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hans L. Bodlaender. 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 Hans L. Bodlaender. The network helps show where Hans L. Bodlaender may publish in the future.

Co-authorship network of co-authors of Hans L. Bodlaender

This figure shows the co-authorship network connecting the top 25 collaborators of Hans L. Bodlaender. A scholar is included among the top collaborators of Hans L. Bodlaender 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 Hans L. Bodlaender. Hans L. Bodlaender 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

Bodlaender, Hans L., et al.. (2024). XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. Algorithmica. 87(4). 465–506.

Bodlaender, Hans L., Édouard Bonnet, Dušan Knop, et al.. (2023). Treewidth Is NP-Complete on Cubic Graphs. IT University Of Copenhagen (IT University of Copenhagen).

Bodlaender, Hans L.. (2020). A Generic NP-hardness Proof for a Variant of Graph Coloring. JUCS - Journal of Universal Computer Science. 7. 1114–1124. 1 indexed citations

Bodlaender, Hans L., et al.. (2013). Pre-processing for Triangulation of Probabilistic Networks. arXiv (Cornell University). 32–39. 3 indexed citations

Bodlaender, Hans L., Alexander Grigoriev, Eelko Penninkx, et al.. (2006). On the minimum corridor connection and other generalized geometric problems. TU/e Research Portal. 135(8). 69–82. 2 indexed citations

Bodlaender, Hans L. & Thomas Wolle. (2004). Contraction Degeneracy on Cographs. Utrecht University Repository (Utrecht University). 5 indexed citations

Bodlaender, Hans L., et al.. (2003). On Algorithms for (P5,Gem)-Free Graphs. Utrecht University Repository (Utrecht University). 2 indexed citations

Bodlaender, Hans L.. (1998). A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science. 209(1-2). 1–45. 515 indexed citations breakdown →

Bodlaender, Hans L., Jens Gustedt, & Jan Arne Telle. (1998). Linear-time register allocation for a fixed number of registers. Symposium on Discrete Algorithms. 574–583. 22 indexed citations

10.

Bodlaender, Hans L.. (1997). Treewidth: Algorithmic results and techniques. Data Archiving and Networked Services (DANS). 1 indexed citations

11.

Bodlaender, Hans L.. (1997). Treewidth: Algorithmoc Techniques and Results. 19–36. 68 indexed citations

12.

Gaag, Linda C. van der & Hans L. Bodlaender. (1997). Comparing Loop Cutsets and Clique Trees in Probabilistic Inference. Utrecht University Repository (Utrecht University). 1 indexed citations

13.

Bodlaender, Hans L.. (1995). The Hardness of Problems on Thin Colored Graphs. Utrecht University Repository (Utrecht University). 2 indexed citations

14.

Bodlaender, Hans L., Teofilo F. Gonzalez, & Ton Kloks. (1995). Complexity aspects of two-dimensional data compression. Nordic journal of computing. 2(4). 462–495. 1 indexed citations

15.

Bodlaender, Hans L.. (1993). A tourist guide through treewidth. Acta Cybernetica. 11. 1–21. 179 indexed citations

16.

Bodlaender, Hans L., et al.. (1992). On the Treewidth and Pathwidth of Permutation Graphs. Utrecht University Repository (Utrecht University). 9213. 1 indexed citations

17.

Bodlaender, Hans L.. (1988). Planar graphs with bounded treewidth. Data Archiving and Networked Services (DANS). 23 indexed citations

18.

Bodlaender, Hans L.. (1988). Some Classes of Graphs with Bounded Treewidth.. Bulletin of the European Association for Theoretical Computer Science. 36. 116–125. 31 indexed citations

19.

Bodlaender, Hans L. & Jan Van Leeuwen. (1985). On the complexity of finding uniform emulations. Utrecht University Repository (Utrecht University). 4 indexed citations

20.

Bodlaender, Hans L.. (1985). On Approximation algorithms for determining minimum cost emulations. Utrecht University Repository (Utrecht University). 2 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