Knowledge (XXG)

Hans L. Bodlaender

Source 📝

72:
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
668: 483: 663: 191: 648: 370: 243: 195: 673: 412: 355: 69: 658: 643: 74: 469: 343: 476: 330: 653: 397:
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
123:
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
35: 86: 638: 252: 135:
Bodlaender, Hans L. (1996), "A linear-time algorithm for finding tree-decompositions of small treewidth",
65: 54:, Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of 633: 257: 543: 505: 426: 39: 27: 23: 408: 351: 400: 262: 212: 204: 152: 144: 422: 276: 226: 166: 597: 522: 418: 272: 238: 222: 162: 107: 55: 31: 452: 399:, Lecture Notes in Computer Science, vol. 12160, Springer International Publishing, 456: 176: 302: 208: 627: 526: 430: 111: 102:
for an outstanding paper in the area of multivariate algorithmics, for his work with
81: 535: 492: 99: 558: 539: 392: 118: 267: 518: 404: 234: 148: 103: 577: 573: 446: 326: 461: 51: 217: 157: 605:
Cygan, Nederlof, Pilipczuk, Pilipczuk, van Rooij, Onufry Wojtaszczyk
241:; Hermelin, Danny (2009), "On problems without polynomial kernels", 465: 611:
Bodlaender, Fomin, Lokshtanov, Penninkx, Saurabh, Thilikos
669:
Academic staff of the Eindhoven University of Technology
395:; Kratsch, Stefan; van Leeuwen, Erik Jan, eds. (2020), 375:, European Association for Theoretical Computer Science 346:(2007), "Chess Variant Pages", in Beasley, John (ed.), 179: 185: 60:Distributed Computing – Structure and Complexity. 193:-arboretum of graphs with bounded treewidth", 477: 348:The Classified Encyclopedia of Chess Variants 38:and in particular for algorithms relating to 8: 484: 470: 462: 266: 256: 216: 178: 156: 80:Bodlaender has written extensively about 585:Marx, Chen, Liu, Lu, O’Sullivan, Razgon 591:Calude, Jain, Khoussainov, Li, Stephan 372:EATCS–IPEC Nerode Prize 2014 – Laudatio 289: 244:Journal of Computer and System Sciences 173:Bodlaender, Hans L. (1998), "A partial 30:. Bodlaender is known for his work on 70:Massachusetts Institute of Technology 26:, a professor of computer science at 7: 664:Academic staff of Utrecht University 297: 295: 293: 350:, John Beasley, pp. 362–363, 75:Eindhoven University of Technology 14: 22:(born April 21, 1960) is a Dutch 649:Theoretical computer scientists 1: 331:Mathematics Genealogy Project 209:10.1016/S0304-3975(97)00228-4 674:People from Ede, Netherlands 196:Theoretical Computer Science 98:In 2014 he was awarded the 690: 268:10.1016/j.jcss.2009.04.001 659:Utrecht University alumni 644:Dutch computer scientists 508:, Kabanets, Paturi, Zane 500: 405:10.1007/978-3-030-42071-0 149:10.1137/S0097539793251219 137:SIAM Journal on Computing 125:, was published in 2020. 455:publications indexed by 110:, and Danny Hermelin on 84:and founded the website 36:parameterized complexity 16:Dutch computer scientist 87:The Chess Variant Pages 187: 449:at Utrecht University 233:Bodlaender, Hans L.; 188: 129:Selected publications 66:postdoctoral research 561:, Grandoni, Kratsch 177: 567:Kratsch, Wahlström 327:Hans Leo Bodlaender 239:Fellows, Michael R. 20:Hans Leo Bodlaender 453:Hans L. Bodlaender 447:Hans L. Bodlaender 183: 40:tree decomposition 28:Utrecht University 24:computer scientist 621: 620: 614: 608: 602: 594: 588: 582: 570: 564: 555: 549: 532: 511: 414:978-3-030-42070-3 357:978-0-9555168-0-1 235:Downey, Rodney G. 186:{\displaystyle k} 681: 612: 606: 600: 592: 586: 580: 568: 562: 553: 547: 530: 509: 486: 479: 472: 463: 434: 433: 389: 383: 382: 381: 380: 367: 361: 360: 344:Pritchard, D. B. 340: 334: 324: 318: 317: 316: 315: 309: 304:Curriculum vitae 299: 279: 270: 260: 229: 220: 192: 190: 189: 184: 169: 160: 143:(6): 1305–1317, 58:with the thesis 32:graph algorithms 689: 688: 684: 683: 682: 680: 679: 678: 654:Graph theorists 624: 623: 622: 617: 496: 490: 443: 438: 437: 415: 393:Fomin, Fedor V. 391: 390: 386: 378: 376: 369: 368: 364: 358: 342: 341: 337: 325: 321: 313: 311: 307: 301: 300: 291: 286: 258:10.1.1.139.7675 232: 175: 174: 172: 134: 131: 108:Michael Fellows 96: 56:Jan van Leeuwen 48: 17: 12: 11: 5: 687: 685: 677: 676: 671: 666: 661: 656: 651: 646: 641: 636: 626: 625: 619: 618: 616: 615: 609: 603: 595: 589: 583: 571: 565: 556: 550: 533: 512: 501: 498: 497: 491: 489: 488: 481: 474: 466: 460: 459: 457:Google Scholar 450: 442: 441:External links 439: 436: 435: 413: 384: 362: 356: 335: 319: 310:, January 2018 288: 287: 285: 282: 281: 280: 251:(8): 423–434, 230: 182: 170: 130: 127: 95: 92: 82:chess variants 47: 44: 15: 13: 10: 9: 6: 4: 3: 2: 686: 675: 672: 670: 667: 665: 662: 660: 657: 655: 652: 650: 647: 645: 642: 640: 639:Living people 637: 635: 632: 631: 629: 610: 604: 599: 596: 590: 584: 579: 575: 572: 566: 560: 557: 551: 545: 541: 537: 534: 528: 524: 520: 516: 513: 507: 503: 502: 499: 494: 487: 482: 480: 475: 473: 468: 467: 464: 458: 454: 451: 448: 445: 444: 440: 432: 428: 424: 420: 416: 410: 406: 402: 398: 394: 388: 385: 374: 373: 366: 363: 359: 353: 349: 345: 339: 336: 332: 328: 323: 320: 306: 305: 298: 296: 294: 290: 283: 278: 274: 269: 264: 259: 254: 250: 246: 245: 240: 236: 231: 228: 224: 219: 214: 210: 206: 203:(1–2): 1–45, 202: 198: 197: 180: 171: 168: 164: 159: 154: 150: 146: 142: 138: 133: 132: 128: 126: 124: 120: 115: 113: 112:kernelization 109: 105: 101: 93: 91: 89: 88: 83: 78: 76: 71: 67: 62: 61: 57: 53: 46:Life and work 45: 43: 41: 37: 33: 29: 25: 21: 529:, Santhanam 525:, Hermelin, 514: 493:Nerode Prize 396: 387: 377:, retrieved 371: 365: 347: 338: 322: 312:, retrieved 303: 248: 242: 200: 194: 140: 136: 122: 116: 100:Nerode Prize 97: 85: 79: 63: 59: 49: 19: 18: 634:1960 births 576:, Yuster, 546:, Thilikos 506:Impagliazzo 119:festschrift 94:Recognition 42:of graphs. 628:Categories 552:Björklund 544:Hajiaghayi 515:Bodlaender 379:2021-09-23 314:2021-09-23 284:References 218:1874/18312 158:1874/16670 104:Rod Downey 598:Courcelle 504:Calabro, 495:laureates 431:215819839 253:CiteSeerX 90:in 1995. 52:Bennekom 50:Born in 536:Demaine 527:Fortnow 523:Fellows 423:4158959 329:at the 277:2568366 227:1647486 167:1417901 68:at the 613:(2024) 607:(2023) 601:(2022) 593:(2021) 587:(2020) 581:(2019) 569:(2018) 563:(2017) 554:(2016) 548:(2015) 531:(2014) 519:Downey 510:(2013) 429:  421:  411:  354:  275:  255:  225:  165:  64:After 578:Zwick 559:Fomin 540:Fomin 427:S2CID 308:(PDF) 574:Alon 409:ISBN 352:ISBN 34:and 401:doi 263:doi 213:hdl 205:doi 201:209 153:hdl 145:doi 630:: 542:, 538:, 521:, 517:, 425:, 419:MR 417:, 407:, 292:^ 273:MR 271:, 261:, 249:75 247:, 237:; 223:MR 221:, 211:, 199:, 163:MR 161:, 151:, 141:25 139:, 121:, 117:A 114:. 106:, 77:. 485:e 478:t 471:v 403:: 333:. 265:: 215:: 207:: 181:k 155:: 147::

Index

computer scientist
Utrecht University
graph algorithms
parameterized complexity
tree decomposition
Bennekom
Jan van Leeuwen
postdoctoral research
Massachusetts Institute of Technology
Eindhoven University of Technology
chess variants
The Chess Variant Pages
Nerode Prize
Rod Downey
Michael Fellows
kernelization
festschrift
doi
10.1137/S0097539793251219
hdl
1874/16670
MR
1417901
Theoretical Computer Science
doi
10.1016/S0304-3975(97)00228-4
hdl
1874/18312
MR
1647486

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.