Hans L. Bodlaender: Difference between revisions

Content deleted Content added

Inline

Latest revision as of 23:12, 11 January 2024

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 parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.

Life and work[edit]

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, and at the same time added 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[edit]

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]

A festschrift, Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, was published in 2020.^[5]

Selected publications[edit]

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, hdl:1874/16670, 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
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, CiteSeerX 10.1.1.139.7675, doi:10.1016/j.jcss.2009.04.001, MR 2568366

References[edit]

^ ^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
^ Fomin, Fedor V.; Kratsch, Stefan; van Leeuwen, Erik Jan, eds. (2020), Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol. 12160, Springer International Publishing, doi:10.1007/978-3-030-42071-0, ISBN 978-3-030-42070-3, MR 4158959, S2CID 215819839

External links[edit]

Hans L. Bodlaender at Utrecht University
Hans L. Bodlaender publications indexed by Google Scholar

[cv-1] Curriculum vitae (PDF), January 2018, retrieved 2021-09-23

[2] Hans Leo Bodlaender at the Mathematics Genealogy Project.

[3] 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

[4] EATCS–IPEC Nerode Prize 2014 – Laudatio, European Association for Theoretical Computer Science, retrieved 2021-09-23

[5] Fomin, Fedor V.; Kratsch, Stefan; van Leeuwen, Erik Jan, eds. (2020), Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol. 12160, Springer International Publishing, doi:10.1007/978-3-030-42071-0, ISBN 978-3-030-42070-3, MR 4158959, S2CID 215819839

[1]

[2]

[3]

[4]

[5]

@@ Line 1: / Line 1: @@
+{{Short description|Dutch computer scientist}}
-'''Hans Leo Bodlaender''' (born April 21, 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.
+'''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 [[parameterized complexity]] 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 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.<ref name="cv"/> In 2014 he was awarded the [[Nerode Prize]] for an outstanding paper in the area of multivariate algorithmics.
+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, and at the same time added 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.
+Bodlaender has written extensively about [[chess variant]]s and founded the website ''[[The Chess Variant Pages]]'' in 1995.<ref>{{citation
+ |last=Pritchard
+ |first=D. B.
+ |authorlink=David Pritchard (chess player)
+ |editor-last=Beasley
+ |editor-first=John
+ |title=The Classified Encyclopedia of Chess Variants
+ |publisher=John Beasley
+ |year=2007
+ |contribution=Chess Variant Pages
+ |pages=362–363
+ |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 [[Rod Downey]], [[Michael Fellows]], and Danny 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>
+A [[festschrift]], ''Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday'', was published in 2020.<ref>{{citation
+ | editor1-last = Fomin | editor1-first = Fedor V. | editor1-link = Fedor Fomin
+ | editor2-last = Kratsch | editor2-first = Stefan
+ | editor3-last = van Leeuwen | editor3-first = Erik Jan
+ | doi = 10.1007/978-3-030-42071-0
+ | mr = 4158959
+ | publisher = Springer International Publishing
+ | series = Lecture Notes in Computer Science | volume = 12160
+ | title = Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
+ | year = 2020| isbn = 978-3-030-42070-3 | s2cid = 215819839 }}</ref>
 == 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}}.
+ | 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}}.
+ | 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| hdl = 1874/16670
+ | hdl-access = free
+ }}
+*{{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| doi-access = free
+ | citeseerx = 10.1.1.139.7675
+ }}
 ==References==
@@ Line 17: / Line 79: @@
 == External links ==
 * [http://www.staff.science.uu.nl/~bodla101/ Hans L. Bodlaender] at Utrecht University
+* {{Google Scholar id|CcqZZqMAAAAJ}}
 {{Nerode Prize laureates}}
 {{Authority control}}
-{{Persondata
-| NAME              = Bodlaender, Hans Leo
-| ALTERNATIVE NAMES =
-| SHORT DESCRIPTION = Computer Science
-| DATE OF BIRTH     = April 21, 1960
-| PLACE OF BIRTH    = [[Bennekom]], [[Netherlands]]
-| DATE OF DEATH     =
-| PLACE OF DEATH    =
-}}
 {{DEFAULTSORT:Bodlaender, Hans Leo}}
 [[Category:1960 births]]
@@ Line 36: / Line 90: @@
 [[Category:Graph theorists]]
 [[Category:Utrecht University alumni]]
-[[Category:Utrecht University faculty]]
+[[Category:Academic staff of Utrecht University]]
+[[Category:Academic staff of the Eindhoven University of Technology]]
+[[Category:People from Ede, Netherlands]]

Authority control databases
International	ISNI VIAF
National	Norway Germany Israel United States Czech Republic Netherlands
Academics	Association for Computing Machinery DBLP Google Scholar MathSciNet Mathematics Genealogy Project ORCID Scopus zbMATH
Other	IdRef