Hans L. Bodlaender: h-index, Total Citations, and Citation Map
Hans L. Bodlaender's h-index is 75 (205 i10-index, 24,221+ total citations across 430+ publications) according to Google Scholar as of June 2026. Hans L. Bodlaender is affiliated with Professor Computer Science, Utrecht University.
Hans L. Bodlaender is a researcher affiliated with Professor Computer Science, Utrecht University, specializing in algorithms, computational complexity, graph algorithms. Their work has been cited 24,221 times. This profile visualizes their global influence, spanning a global audience.
Hans L. Bodlaender's Citation Metrics
Bibliometric impact based on 430 indexed publications.
- H-Index
- 75
- i10-Index
- 205
- Total Citations
- 24,221
- Citing Countries
- 0
As of June 2026.
Hans L. Bodlaender has an h-index of 75 and 24,221 total citations across 430 publications, with research cited by institutions in 0 countries.
Download Exports (PNG, CSV, Poster)
Free Viewing Hans L. Bodlaender's citation map is always free. Pay once to download poster, PNG, and CSV files for offline use or your visa packet.
We've mapped 5,000 of 24,221 citations for Hans L. Bodlaender
We've shown the most-cited 5,000. Unlock the full crawl (24,171 more citations) to see every institution citing this scholar.
Global Impact Map
Visualizing the geographic distribution of institutions that have cited your work.
Starting…
Pins will appear here as institutions are resolved — no need to refresh.
A linear time algorithm for finding tree-decompositions of small treewidth
19962,521
Top Citing Countries
Top Citing Institutions
No institution data available.
Citation trend (last 10 years)Click to expand
Citation Trend (Last 10 Years)
Related Guides
Learn how to use citation maps for your research and visa applications.
About Hans L. Bodlaender's research
Hans L. Bodlaender is a researcher in algorithms, computational complexity and graph algorithms at Professor Computer Science, Utrecht University. Their work has been cited 24,221 times across 430 publications (h-index 75), according to Google Scholar.
Their most-cited work, “A linear time algorithm for finding tree-decompositions of small treewidth” (1996), has accumulated 2,521 citations. Other influential works include “A partial k-arboretum of graphs with bounded treewidth” (1998) with 1,547 citations and “A tourist guide through treewidth” (1994) with 1,086 citations.
