# Hans L. Bodlaender

**Hans Leo Bodlaender** (born April 21, 1960)[1] is a Dutch computer scientist, a professor of computer science at Utrecht University and professor Network Algorithms[2] at the Eindhoven University of Technology. Bodlaender is known for his work on graph algorithms and in particular for algorithms relating to tree decomposition of graphs.

## Life and work

Born in Bennekom, Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of Jan van Leeuwen with the thesis *Distributed Computing – Structure and Complexity.*[1][3]

After postdoctoral research at the Massachusetts Institute of Technology in 1987, he returned to Utrecht as a faculty member. In 1987 he was appointed Assistant Professor and in 2003 Associate Professor.[1] In 2014 he was awarded the Nerode Prize for an outstanding paper in the area of multivariate algorithmics.

Bodlaender has written extensively about chess variants and founded the website *The Chess Variant Pages* in 1995.

## Selected publications

- Bodlaender, Hans L. (1996), "A linear-time algorithm for finding tree-decompositions of small treewidth",
*SIAM Journal on Computing*,**25**(6): 1305–1317, CiteSeerX 10.1.1.113.4539, doi:10.1137/S0097539793251219, MR 1417901. - Bodlaender, Hans L. (1998), "A partial
*k*-arboretum of graphs with bounded treewidth",*Theoretical Computer Science*,**209**(1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4, MR 1647486.

## References

- Curriculum vitae, retrieved 2012-02-18.
- Hans Leo Bodlaender at the Mathematics Genealogy Project.

## External links

- Hans L. Bodlaender at Utrecht University