Hans L. Bodlaender
Scholar

Hans L. Bodlaender

Google Scholar ID: CcqZZqMAAAAJ
Professor Computer Science, Utrecht University
algorithmscomputational complexitygraph algorithmsgraph theoryfixed parameter algorithms and complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
23,330
 
H-index
73
 
i10-index
200
 
Publications
20
 
Co-authors
93
list available
Contact
No contact links provided.
Publications
5 items
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
Resume (English only)
Co-authors
93 total
Dimitrios M. Thilikos
Dimitrios M. Thilikos
National and Kapodistrian University of Athens
Co-author 2
Co-author 2
Fedor V. Fomin
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Co-author 4
Co-author 4
Co-author 5
Co-author 5
Co-author 6
Co-author 6
Klaus Jansen
Klaus Jansen
Professor, Computer Science, University of Kiel
Stefan Kratsch
Stefan Kratsch
Professor at Humboldt University Berlin