Knowledge (XXG)

Hans L. Bodlaender

Source 📝

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

Index

Hans Bodlaender
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

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