Hans L. Bodlaender: Difference between revisions
Content deleted Content added
→Life and work: copy source from linked article for readers too lazy to find it there |
update cv |
||
| Line 1: | Line 1: | ||
{{Short description|Dutch computer scientist}} |
{{Short description|Dutch computer scientist}} |
||
'''Hans Leo Bodlaender''' (born April 21, 1960) |
'''Hans Leo Bodlaender''' (born April 21, 1960) is a Dutch [[computer scientist]], a professor of computer science at [[Utrecht University]].<ref name="cv">{{citation|url=https://webspace.science.uu.nl/~bodla101/curvit.pdf|title=Curriculum vitae|date=January 2018|access-date=2021-09-23}}</ref> Bodlaender is known for his work on [[graph algorithm]]s and in particular for algorithms relating to [[tree decomposition]] of graphs. |
||
== Life and work == |
== 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.''<ref name="cv"/><ref>{{mathgenealogy|id=83356|name=Hans Leo Bodlaender}}.</ref> |
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.''<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. |
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 became full professor of algorithms and complexity at Utrecht, while from 2014 to 2018 also holding a part-time professorship in network algorithms at [[Eindhoven University of Technology]].<ref name="cv"/> |
||
Bodlaender has written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995.<ref>{{citation |
Bodlaender has written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995.<ref>{{citation |
||
| Line 19: | Line 19: | ||
|pages=362–363 |
|pages=362–363 |
||
|isbn=978-0-9555168-0-1}}</ref> |
|isbn=978-0-9555168-0-1}}</ref> |
||
==Recognition== |
|||
In 2014 he was awarded the [[Nerode Prize]] for an outstanding paper in the area of multivariate algorithmics, for his work with Downey, Fellows, and Hermelin on [[kernelization]].<ref>{{citation|url=https://eatcs.org/index.php/component/content/article/20-eatcs-awards/1874-eatcs-ipec-nerode-prize-2014-laudatio|title=EATCS–IPEC Nerode Prize 2014 – Laudatio|publisher=European Association for Theoretical Computer Science|access-date=2021-09-23}}</ref> |
|||
== Selected publications == |
== Selected publications == |
||
| Line 40: | Line 43: | ||
[[Category:Utrecht University alumni]] |
[[Category:Utrecht University alumni]] |
||
[[Category:Utrecht University faculty]] |
[[Category:Utrecht University faculty]] |
||
[[Category:Eindhoven University of Technology faculty]] |
|||
[[Category:People from Ede, Netherlands]] |
[[Category:People from Ede, Netherlands]] |
||
Revision as of 23:57, 23 September 2021
Hans Leo Bodlaender (born April 21, 1960) is a Dutch computer scientist, a professor of computer science at Utrecht University.[1] 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 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. In 2014 he became full professor of algorithms and complexity at Utrecht, while from 2014 to 2018 also holding a part-time professorship in network algorithms at Eindhoven University of Technology.[1]
Bodlaender has written extensively about chess variants and founded the website The Chess Variant Pages in 1995.[3]
Recognition
In 2014 he was awarded the Nerode Prize for an outstanding paper in the area of multivariate algorithmics, for his work with Downey, Fellows, and Hermelin on kernelization.[4]
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, CiteSeerX 10.1.1.113.4539, 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, hdl:1874/18312, MR 1647486.
References
- ^ a b c Curriculum vitae (PDF), January 2018, retrieved 2021-09-23
- ^ Hans Leo Bodlaender at the Mathematics Genealogy Project.
- ^ Pritchard, D. B. (2007), "Chess Variant Pages", in Beasley, John (ed.), The Classified Encyclopedia of Chess Variants, John Beasley, pp. 362–363, ISBN 978-0-9555168-0-1
- ^ EATCS–IPEC Nerode Prize 2014 – Laudatio, European Association for Theoretical Computer Science, retrieved 2021-09-23
External links
- Hans L. Bodlaender at Utrecht University
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
