Hans L. Bodlaender

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Thore Husfeldt (talk | contribs) at 12:31, 9 June 2014 (+ Nerode template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 founded the website The Chess Variant Pages in 1995.

References

  1. ^ a b c 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.


Template:Persondata

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hans_L._Bodlaender&oldid=612206071"