Hans L. Bodlaender: Difference between revisions

Edit links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Undid revision 622040132 by 146.200.29.119 (talk) WP:DATERET
Some rearrangement(s)
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 1960)<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.
| last = Bodlaender | first = Hans L.
| doi = 10.1137/S0097539793251219
| issue = 6
| journal = [[SIAM Journal on Computing]]
| mr = 1417901
| pages = 1305–1317
| title = A linear-time algorithm for finding tree-decompositions of small treewidth
| volume = 25
| year = 1996}}.</ref><ref>{{citation
| last = Bodlaender | first = Hans L.
| doi = 10.1016/S0304-3975(97)00228-4
| issue = 1-2
| journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
| mr = 1647486
| pages = 1–45
| title = A partial ''k''-arboretum of graphs with bounded treewidth
| volume = 209
| year = 1998}}.</ref>


== Life and work ==
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"/>
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 Complex.''<ref name="cv"/><ref>{{mathgenealogy|id=83356|name=Hans Leo Bodlaender}}.</ref>


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.<ref name="cv"/> In 2014 he was awarded the [[Nerode Prize]] for an outstanding paper in the area of multivariate algorithmics.
⚫
Bodlaender has also written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995.

⚫
Bodlaender has written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995.

== Selected publications ==
* {{citation | last = Bodlaender | first = Hans L. | doi = 10.1137/S0097539793251219 | issue = 6 | journal = [[SIAM Journal on Computing]] | mr = 1417901 | pages = 1305–1317 | title = A linear-time algorithm for finding tree-decompositions of small treewidth | volume = 25 | year = 1996}}.
* {{citation | last = Bodlaender | first = Hans L. | doi = 10.1016/S0304-3975(97)00228-4 | issue = 1-2 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]] | mr = 1647486 | pages = 1–45 | title = A partial ''k''-arboretum of graphs with bounded treewidth | volume = 209 | year = 1998}}.


==References==
==References==
{{reflist}}
{{reflist}}


== External links ==
⚫
{{Nerode Prize laureates}}
* [http://www.staff.science.uu.nl/~bodla101/ Hans L. Bodlaender] at Utrecht University




⚫
{{Nerode Prize laureates}}
{{Authority control|VIAF=54818348}}
{{Persondata
{{Persondata
| NAME = Bodlaender, Hans Leo
| NAME = Bodlaender, Hans Leo

Revision as of 19:30, 7 October 2014

Hans Leo Bodlaender (born 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 Complex.[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.

External links

Template:Persondata

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