Scholar
Hans L. Bodlaender
Google Scholar ID: CcqZZqMAAAAJ
Professor Computer Science, Utrecht University
algorithms
computational complexity
graph algorithms
graph theory
fixed parameter algorithms and complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
23,330
H-index
73
i10-index
200
Publications
20
Co-authors
93
list available
Publications
6 items
The Parameterized Complexity of Problems on Outer k-Planar Graphs
2026
Cited
0
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
2026
Cited
0
On Stable Cutsets in General and Minimum Degree Constrained Graphs
2025
Cited
0
On Equivalent Characterizations of NP in Abstract Models of Computation
2025
Cited
0
Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
2025
Cited
0
XALP-completeness of Parameterized Problems on Planar Graphs
2024
Cited
0
Co-authors
12 total
Dimitrios M. Thilikos
National and Kapodistrian University of Athens
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Klaus Jansen
Professor, Computer Science, University of Kiel
Stefan Kratsch
Professor at Humboldt University Berlin
Tom C. van der Zanden
Maastricht University
Alexander Grigoriev
Maastricht University
Rolf Niedermeier
TU Berlin
Jesper Nederlof
Utrecht University
