World's Best Scientists 2026 revealed!
Hans L. Bodlaender

Hans L. Bodlaender

Award Badge
Computer Science
Netherlands
2026

D-Index & Metrics

Computer Science

D-Index
77
Citations
22712
World Ranking
1282
National Ranking
9

Research.com Recognitions

  • 2026 - Research.com Computer Science in Netherlands Leader Award
  • 2025 - Research.com Computer Science in Netherlands Leader Award
  • 2022 - Research.com Computer Science in Netherlands Leader Award

Overview

Hans L. Bodlaender is affiliated with Utrecht University in the Netherlands. Their research primarily focuses on the field of computer science, with a substantial body of work within computational theory and mathematics. The scientist's extensive contributions include research across several subfields, such as computational theory and mathematics, computer networks and communications, industrial and manufacturing engineering, discrete mathematics and combinatorics, and geometry and topology.

The core topics of Bodlaender's work center on advanced graph theory research, complexity and algorithms in graphs, semigroups and automata theory, graph labeling and dimension problems, limits and structures in graph theory, interconnection networks and systems, and aspects of computability, logic, and AI algorithms.

The scientist has published regularly in various academic venues. Their frequent publication platforms include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Lecture Notes in Computer Science
  • Theoretical Computer Science
  • SIAM Journal on Computing

Selected recent publications of Hans L. Bodlaender include:

  • "A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs", 2020, SIAM Journal on Computing
  • "Subgraph Isomorphism on Graph Classes that Exclude a Substructure", 2020, Algorithmica
  • "Steiner trees for hereditary graph classes: A treewidth perspective", 2021, IRIS Research product catalog (Sapienza University of Rome)
  • "On the Complexity of Problems on Tree-Structured Graphs", 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Parameterized Complexities of Dominating and Independent Set Reconfiguration", 2021, arXiv (Cornell University)

Frequent coauthors collaborating with Bodlaender include:

  • Carla Groenland
  • Erik Jan van Leeuwen
  • Tom C. van der Zanden
  • Hugo Jacob
  • Lars Jaffke

Best Publications

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

    Hans L. Bodlaender

  • A partial k -arboretum of graphs with bounded treewidth

    Hans L. Bodlaender

  • A tourist guide through Treewidth

    H.L. Bodlaender

  • On problems without polynomial kernels

    Hans L. Bodlaender;Rodney G. Downey;Michael R. Fellows;Danny Hermelin

  • DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH

    Hans L. Bodlaender

  • Treewidth: Algorithmic techniques and results

    Hans L. Bodlaender

  • Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

    Hans L. Bodlaender;Ton Kloks

  • Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

    Hans L. Bodlaender;John R. Gilbert;Hjálmtýr Hafsteinsson;Ton Kloks

  • Combinatorial Optimization on Graphs of Bounded Treewidth

    Hans L. Bodlaender;Arie M. C. A. Koster

  • Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

    Jochen Alber;Hans L. Bodlaender;Henning Fernau;Ton Kloks

  • Two Strikes Against Perfect Phylogeny

    Hans L. Bodlaender;Michael R. Fellows;Tandy Warnow

  • Kernel bounds for disjoint cycles and disjoint paths

    Hans L. Bodlaender;Stéphan Thomassé;Anders Yeo

  • The pathwidth and treewidth of cographs

    Hans L. Bodlaender;Rolf H. Möhring

  • Treewidth computations I. Upper bounds

    Hans L. Bodlaender;Arie M. C. A. Koster

  • Approximations for λ-Colorings of Graphs

    Hans L. Bodlaender;Ton Kloks;Richard B. Tan;Jan van Leeuwen

  • ON THE COMPLEXITY OF SOME COLORING GAMES

    Hans L. Bodlaender

  • Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    Hans L. Bodlaender;Marek Cygan;Stefan Kratsch;Jesper Nederlof

  • Kernelization: New Upper and Lower Bound Techniques

    Hans L. Bodlaender

  • Kernelization lower bounds by cross-composition

    HL Hans Bodlaender;Bmp Bart Jansen;Stefan Kratsch

  • Classes of graphs with bounded tree-width

    H.L. Bodlaender

Frequent Co-Authors

Fedor V. Fomin
Fedor V. Fomin University of Bergen
Dimitrios M. Thilikos
Dimitrios M. Thilikos National and Kapodistrian University of Athens
Arie M. C. A. Koster
Arie M. C. A. Koster RWTH Aachen University
Michael R. Fellows
Michael R. Fellows Lebanese American University
Dieter Kratsch
Dieter Kratsch University of Lorraine
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Klaus Jansen
Klaus Jansen Kiel University
Rodney G. Downey
Rodney G. Downey Victoria University of Wellington
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Jan van Leeuwen
Jan van Leeuwen Utrecht University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As you explore studying Computer Science in the USA, it's important to consider closely related online degrees. Many students look at fields like cybersecurity, management, business, and criminal justice to expand their career options. An online cybersecurity degree is especially relevant if you're interested in digital security, ethical hacking, or protecting information systems.

If you envision yourself in engineering or project leadership roles, you might be drawn to construction or project management. Exploring the cheapest construction management degree programs online can help you gain skills for overseeing complex infrastructure and tech projects.

For those interested in law enforcement, policy, or digital forensics, pursuing the cheapest online phd in criminal justice can be a strategic move. Meanwhile, combining computer science with finance by checking out the value of an accounting degree cost can expand your opportunities across technology and business sectors.

Each pathway offers distinct skill sets, affordable degree options, and diverse career prospects—allowing you to tailor your education to your goals.

Best Scientists Citing Hans L. Bodlaender

Trending Scientists

Recently Published Articles