Hans L. Bodlaender

From Wikipedia, the free encyclopedia

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

Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of Jan van Leeuwen.[1][4] After postdoctoral research at the Massachusetts Institute of Technology, he returned to Utrecht as a faculty member, where he has remained.[1]

Bodlaender has also written extensively about chess variants and invented Bodlaender's dice-rolling method for randomly choosing the initial piece setup in Chess960.

References

  1. ↑ 1.0 1.1 1.2 Curriculum vitae, retrieved 2012-02-18.
  2. ↑ Bodlaender, Hans L. (1996), "A linear-time algorithm for finding tree-decompositions of small treewidth", SIAM Journal on Computing 25 (6): 1305–1317, doi:10.1137/S0097539793251219, MR 1417901 .
  3. ↑ 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 .
  4. ↑ Hans Leo Bodlaender at the Mathematics Genealogy Project.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.