Science Explorer Back to mapMap
Discussion
Researcher · Utrecht University · Netherlands

Hans L. Bodlaender

Hans L. Bodlaender publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Graph Labeling and Dimension Problems.

ORCID 0000-0002-9297-3330 OpenAlex
World rank
#187,076
of 7,710,434 ranked researchers
Rank in Netherlands
#4,715
of 107,149
Works
472
Citations
17k
Citations per work
36.0
h-index
66
i10-index 222Top 0.2% in Computational Theory and Mathematics
Hans L. Bodlaender

What does Hans L. Bodlaender research?

Hans L. Bodlaender's work is mostly in Computer Science (78%), Engineering (3%), Mathematics (3%).

Physical Sciences: 393 works · 83.3% of their workComputer Science: 367 works · 77.7% of their workComputational Theory and Mathematics: 258 works · 54.6% of their workComputer Networks and Communications: 64 works · 13.6% of their workArtificial Intelligence: 33 works · 7.0% of their workComputer Graphics and Computer-Aided Design: 12 works · 2.5% of their workEngineering: 13 works · 2.8% of their workElectrical and Electronic Engineering: 13 works · 2.8% of their workMathematics: 13 works · 2.8% of their workGeometry and Topology: 13 works · 2.8% of their workEverything else: 79 works · 16.7% of their workTHEIR WORKHans L.Bodlaender472works
Physical Sciences83%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science36777.7%
    2. Engineering132.8%
    3. Mathematics132.8%
  2. Everything else7916.7%
  1. 1Computational Theory and Mathematics55% of their works
  2. 2Computer Networks and Communications14% of their works
  3. 3Artificial Intelligence7% of their works
  4. 4Electrical and Electronic Engineering3% of their works
  5. 5Geometry and Topology3% of their works
  6. 6Computer Graphics and Computer-Aided Design2% of their works

Research topics

Which keywords describe Hans L. Bodlaender's research?

The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Labeling and Metric Dimension.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.

All 18 words, with their numbers
  1. Approximation Algorithms5803 topics
  2. Algorithmic Applications5482 topics
  3. Graph Theory3381 topic
  4. Parameterized Complexity3381 topic
  5. Combinatorial Optimization2101 topic
  6. Complexity Theory2101 topic
  7. Graph Labeling1091 topic
  8. Metric Dimension1091 topic
  9. Interconnection Networks871 topic
  10. Networks on Chip871 topic
  11. Mobile Robots441 topic
  12. Online Algorithms441 topic
  13. Compression341 topic
  14. Suffix Arrays341 topic
  15. Graph Spectra331 topic
  16. Topological Indices331 topic
  17. Delaunay Triangulations321 topic
  18. Mesh Generation321 topic

Where does Hans L. Bodlaender work?

Hans L. Bodlaender's main affiliation in the publication record is Utrecht University, Netherlands.

How many publications and citations does Hans L. Bodlaender have?

OpenAlex counts 472 works and 17,005 citations for Hans L. Bodlaender, an h-index of 66, ranking #187,076 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about Hans L. Bodlaender. Posts are plain text and can be reported.