Hans L. Bodlaender: Difference between revisions
→Recognition: full names and links of coauthors |
add cited work to selected pubs |
||
| Line 24: | Line 24: | ||
== Selected publications == |
== Selected publications == |
||
*{{citation |
|||
* {{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| citeseerx = 10.1.1.113.4539 }}. |
|||
| last = Bodlaender | first = Hans L. |
|||
* {{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| hdl = 1874/18312 | hdl-access = free }}. |
|||
| 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 |
|||
| hdl = 1874/18312 | hdl-access = free |
|||
| issue = 1–2 |
|||
| journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]] |
|||
| mr = 1647486 |
|||
| pages = 1–45 |
|||
| title = A partial <math>k</math>-arboretum of graphs with bounded treewidth |
|||
| volume = 209 |
|||
| year = 1998}} |
|||
*{{citation |
|||
| last1 = Bodlaender | first1 = Hans L. |
|||
| last2 = Downey | first2 = Rodney G. | author2-link = Rod Downey |
|||
| last3 = Fellows | first3 = Michael R. | author3-link = Michael Fellows |
|||
| last4 = Hermelin | first4 = Danny |
|||
| doi = 10.1016/j.jcss.2009.04.001 |
|||
| issue = 8 |
|||
| journal = [[Journal of Computer and System Sciences]] |
|||
| mr = 2568366 |
|||
| pages = 423–434 |
|||
| title = On problems without polynomial kernels |
|||
| volume = 75 |
|||
| year = 2009}} |
|||
==References== |
==References== |
||
| Line 32: | Line 64: | ||
== External links == |
== External links == |
||
* [http://www.staff.science.uu.nl/~bodla101/ Hans L. Bodlaender] at Utrecht University |
* [http://www.staff.science.uu.nl/~bodla101/ Hans L. Bodlaender] at Utrecht University |
||
* {{Google Scholar id|CcqZZqMAAAAJ}} |
|||
{{Nerode Prize laureates}} |
{{Nerode Prize laureates}} |
||
Revision as of 00:11, 24 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 Rod Downey, Michael Fellows, and Danny 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, doi:10.1137/S0097539793251219, MR 1417901
- Bodlaender, Hans L. (1998), "A partial -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
- Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny (2009), "On problems without polynomial kernels", Journal of Computer and System Sciences, 75 (8): 423–434, doi:10.1016/j.jcss.2009.04.001, MR 2568366
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
- Hans L. Bodlaender publications indexed by Google Scholar
