Hans L. Bodlaender: Difference between revisions
Content deleted Content added
m link postdoctoral research using Find link |
add The Chess Variant Pages; rmv credit for Chess960 single die method which credit seems to belong to Ingo Althöfer instead (Chess960 starting position#Single die method) |
||
| Line 21: | Line 21: | ||
Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of [[Jan van Leeuwen]].<ref name="cv"/><ref>{{mathgenealogy|id=83356|name=Hans Leo Bodlaender}}.</ref> After [[postdoctoral research]] at the [[Massachusetts Institute of Technology]], he returned to Utrecht as a faculty member, where he has remained.<ref name="cv"/> |
Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of [[Jan van Leeuwen]].<ref name="cv"/><ref>{{mathgenealogy|id=83356|name=Hans Leo Bodlaender}}.</ref> After [[postdoctoral research]] at the [[Massachusetts Institute of Technology]], he returned to Utrecht as a faculty member, where he has remained.<ref name="cv"/> |
||
Bodlaender has also written extensively about [[chess variant]]s and |
Bodlaender has also written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995. |
||
==References== |
==References== |
||
Revision as of 04:34, 10 April 2014
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
- ^ a b c Curriculum vitae, retrieved 2012-02-18.
- ^ 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.
- ^ Hans Leo Bodlaender at the Mathematics Genealogy Project.