Nisha Rathode (Editor)

Hans L Bodlaender

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Name
  
Hans Bodlaender


Education
  
Utrecht University

Hans L. Bodlaender wwwstaffscienceuunlbodla101hansbjpeg

Hans Leo Bodlaender (born April 21, 1960) is a Dutch computer scientist, a professor of computer science at Utrecht University and professor Network Algorithms 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.

Contents

Hans L. Bodlaender prof dr Hans L Bodlaender Networks

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.

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. 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, MR 1417901, doi:10.1137/S0097539793251219 .
  • Bodlaender, Hans L. (1998), "A partial k-arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1-2): 1–45, MR 1647486, doi:10.1016/S0304-3975(97)00228-4 .

    • References

    Hans L. Bodlaender Wikipedia
    (Text) CC BY-SA