Jump to content

Hans L. Bodlaender: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
+ Nerode template
No edit summary
Line 1: Line 1:
'''Hans Leo Bodlaender''' (born April 21, 1960 in [[Bennekom]], the [[Netherlands]])<ref name="cv">[http://www.staff.science.uu.nl/~bodla101/curvit.pdf Curriculum vitae], retrieved 2012-02-18.</ref> is a Dutch [[computer scientist]], a professor of computer science at [[Utrecht University]]. Bodlaender is known for his work on [[graph algorithm]]s and in particular for algorithms relating to [[tree decomposition]] of graphs.<ref>{{citation
'''Hans Leo Bodlaender''' (born 21 April 1960 in [[Bennekom]], the [[Netherlands]])<ref name="cv">[http://www.staff.science.uu.nl/~bodla101/curvit.pdf Curriculum vitae], retrieved 2012-02-18.</ref> is a Dutch [[computer scientist]], a professor of computer science at [[Utrecht University]]. Bodlaender is known for his work on [[graph algorithm]]s and in particular for algorithms relating to [[tree decomposition]] of graphs.<ref>{{citation
| last = Bodlaender | first = Hans L.
| last = Bodlaender | first = Hans L.
| doi = 10.1137/S0097539793251219
| doi = 10.1137/S0097539793251219
Line 34: Line 34:
| ALTERNATIVE NAMES =
| ALTERNATIVE NAMES =
| SHORT DESCRIPTION = Computer Science
| SHORT DESCRIPTION = Computer Science
| DATE OF BIRTH = April 21, 1960
| DATE OF BIRTH = 21 April 1960
| PLACE OF BIRTH = [[Bennekom]], [[Netherlands]]
| PLACE OF BIRTH = [[Bennekom]], [[Netherlands]]
| DATE OF DEATH =
| DATE OF DEATH =

Revision as of 10:31, 20 August 2014

Hans Leo Bodlaender (born 21 April 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