Hans L. Bodlaender
- Computational Theory and Mathematics top 0.02%
- Computer Networks and Communications top 0.5%
- Artificial Intelligence top 1%
- Discrete Mathematics and Combinatorics top 0.5%
- Computer Graphics and Computer-Aided Design top 0.5%
- Co-authors
- Ton KloksArie M. C. A. KosterMichael R. FellowsFedor V. FominDimitrios M. ThilikosRodney G. DowneyDieter KratschDanny Hermelin
- Topics
- Advanced Graph Theory Research (150 papers)Complexity and Algorithms in Graphs (90 papers)Graph Labeling and Dimension Problems (50 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Partner nations
- NetherlandsGermanyNorway
In The Last Decade
Hans L. Bodlaender
216 papers receiving 5.1k citations
Hit Papers
Peers
Comparison fields: 5 of 94
- Computational Theory and Mathematics 4.5k
- Computer Networks and Communications 1.8k
- Artificial Intelligence 964
- Discrete Mathematics and Combinatorics 648
- Computer Graphics and Computer-Aided Design 426
Countries citing papers authored by Hans L. Bodlaender
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 11 | |
| 3 | 37 | |
| 4 | Uniform emulations of two different types of shuffle-exchange networks | 1 |
| 5 | Convex Recoloring of Leaf-Colored Trees | 7 |
| 6 | Interval Routing and Minor-Monotone Graph Parameters | 1 |
| 7 | Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions | 1 |
| 8 | Contraction Degeneracy on Cographs | 5 |
| 9 | On Algorithms for (P5,Gem)-Free Graphs | 2 |
| 10 | Sizes of Decision Tables and Decision Trees | 3 |
| 11 | Treewidth: Algorithmic results and techniques | 1 |
| 12 | Comparing Loop Cutsets and Clique Trees in Probabilistic Inference | 1 |
| 13 | Finite-State Computability of Annotations of Strings and Trees | 2 |
| 14 | Treewidth and Small Separators for Graphs with Small Chordality | 5 |
| 15 | Ranking of Graphs | 7 |
| 16 | The MAXIMUM CUT and MINIMUM CUT INTO BOUNDED SETS problems on Cographs | 4 |
| 17 | Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees | 13 |
| 18 | Deadlock-free packet switching networks with variable packet size | 2 |
| 19 | Uniform emulations of the shuffle-exchange network | 1 |
| 20 | The minimum bisection width of (three-dimensional) blocks | 1 |
About Hans L. Bodlaender
Hans L. Bodlaender is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics, having authored 225 papers that have together received 5.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (150 papers), Complexity and Algorithms in Graphs (90 papers) and Graph Labeling and Dimension Problems (50 papers). The work is most often cited by research in Computational Theory and Mathematics (4.5k citations), Discrete Mathematics and Combinatorics (648 citations) and Computer Graphics and Computer-Aided Design (426 citations). Hans L. Bodlaender has collaborated with scholars based in Netherlands, Germany and Norway. Frequent 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, Klaus Jansen and Stefan Kratsch. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and SIAM Journal on Optimization.
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.