Jump to content

Hans L. Bodlaender

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 134.134.139.72 (talk) at 17:13, 16 May 2015 (DOB). 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)[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.

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, entitled Distributed Computing — Structure and Complexity.[1][2]

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, 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

  1. ^ a b c Curriculum vitae, retrieved 2012-02-18.
  2. ^ Hans Leo Bodlaender at the Mathematics Genealogy Project.

Template:Persondata

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