- Home
- Best Scientists - Computer Science
- Hans L. Bodlaender

Computer Science

Netherlands

2022

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
72
Citations
18,577
353
World Ranking
1032
National Ranking
11

2022 - Research.com Computer Science in Netherlands Leader Award

- Combinatorics
- Algorithm
- Discrete mathematics

Hans L. Bodlaender mainly investigates Combinatorics, Discrete mathematics, Treewidth, Pathwidth and Tree decomposition. Many of his research projects under Combinatorics are closely connected to Polynomial kernel with Polynomial kernel, tying the diverse disciplines of science together. Many of his studies on Discrete mathematics involve topics that are commonly interrelated, such as Upper and lower bounds.

His study in Treewidth is interdisciplinary in nature, drawing from both Partial k-tree, Algorithm, Approximation algorithm, Tree-depth and Graph theory. His work in Pathwidth covers topics such as Graph minor which are related to areas like Algorithmic graph theory, Bibliography and Null graph. His Tree decomposition research is multidisciplinary, incorporating perspectives in Tree, Graph and Heuristics.

- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth (1341 citations)
- A partial k -arboretum of graphs with bounded treewidth (921 citations)
- A Tourist Guide through Treewidth. (557 citations)

Hans L. Bodlaender spends much of his time researching Combinatorics, Discrete mathematics, Treewidth, Time complexity and Pathwidth. His Combinatorics research focuses on subjects like Bounded function, which are linked to Upper and lower bounds. Discrete mathematics is often connected to Algorithm in his work.

His studies in Treewidth integrate themes in fields like Clique-sum, Tree decomposition, Partial k-tree, Tree-depth and Vertex. His Partial k-tree research is multidisciplinary, incorporating elements of Courcelle's theorem and Clique-width. His Pathwidth study frequently involves adjacent topics like Graph minor.

- Combinatorics (74.78%)
- Discrete mathematics (56.80%)
- Treewidth (44.52%)

- Combinatorics (74.78%)
- Treewidth (44.52%)
- Discrete mathematics (56.80%)

His scientific interests lie mostly in Combinatorics, Treewidth, Discrete mathematics, Graph and Parameterized complexity. His work deals with themes such as Upper and lower bounds and Bounded function, which intersect with Combinatorics. The concepts of his Treewidth study are interwoven with issues in Time complexity, Parameterized algorithms, Partial k-tree and Tree decomposition.

In his research, Trémaux tree and Clique-sum is intimately related to Tree-depth, which falls under the overarching field of Partial k-tree. His studies deal with areas such as Algorithm and Graph as well as Discrete mathematics. As part of one scientific family, he deals mainly with the area of Parameterized complexity, narrowing it down to issues related to the Vertex cover, and often Feedback vertex set.

- Kernelization lower bounds by cross-composition (162 citations)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (79 citations)
- Meta) Kernelization (46 citations)

- Combinatorics
- Algorithm
- Graph theory

Hans L. Bodlaender mainly focuses on Combinatorics, Treewidth, Discrete mathematics, Graph and Tree decomposition. His Combinatorics study frequently draws connections between adjacent fields such as Bounded function. His Treewidth research integrates issues from Deterministic algorithm, Partial k-tree, Tree-depth, Chordal graph and Vertex.

His study on Factor-critical graph is often connected to Completeness as part of broader study in Discrete mathematics. The Parameterized algorithms research Hans L. Bodlaender does as part of his general Graph study is frequently linked to other disciplines of science, such as Information system, Exploration problem, Signal processing and Time step, therefore creating a link between diverse domains of science. His work focuses on many connections between Tree decomposition and other disciplines, such as Algorithm, that overlap with his field of interest in Graph isomorphism and Isomorphism class.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

Hans L. Bodlaender.

SIAM Journal on Computing **(1996)**

2108 Citations

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

Hans L. Bodlaender.

SIAM Journal on Computing **(1996)**

2108 Citations

A partial k -arboretum of graphs with bounded treewidth

Hans L. Bodlaender.

Theoretical Computer Science **(1998)**

1189 Citations

A partial k -arboretum of graphs with bounded treewidth

Hans L. Bodlaender.

Theoretical Computer Science **(1998)**

1189 Citations

A Tourist Guide through Treewidth.

H.L. Bodlaender.

Acta Cybernetica **(1993)**

868 Citations

On problems without polynomial kernels

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

Journal of Computer and System Sciences **(2009)**

605 Citations

On problems without polynomial kernels

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

Journal of Computer and System Sciences **(2009)**

605 Citations

DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH

Hans L. Bodlaender.

international colloquium on automata languages and programming **(1988)**

527 Citations

DYNAMIC PROGRAMMING ON GRAPHS WITH BOUNDED TREEWIDTH

Hans L. Bodlaender.

international colloquium on automata languages and programming **(1988)**

527 Citations

Treewidth: Algorithmic techniques and results

Hans L. Bodlaender.

mathematical foundations of computer science **(1997)**

433 Citations

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

Contact us

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:

University of Bergen

National and Kapodistrian University of Athens

University of Bergen

University of Lorraine

University of California, Santa Barbara

Kiel University

Victoria University of Wellington

RWTH Aachen University

Utrecht University

Eindhoven University of Technology

Texas A&M University

University of Waikato

University of Alberta

Rovira i Virgili University

Chalmers University of Technology

Foundation for Research and Technology Hellas

Federal Institute for Risk Assessment

University of Hyogo

Leipzig University

Oklahoma State University

Universität Hamburg

Wellcome Sanger Institute

Friedrich Schiller University Jena

Japan Agency for Marine-Earth Science and Technology

University of Siena

University of Colorado Denver

Something went wrong. Please try again later.