Hans Bodlaender HL

View Scopus Profile

Hans Bodlaender

prof. dr.

 https://orcid.org/0000-0002-9297-3330
Filter
Chapter

Search results

  • 2014

    Kernelization, Exponential Lower Bounds: Encyclopedia of Algorithms

    Bodlaender, H., 2014, Encyclopedia of Algorithms. Kao, M.-Y. (ed.). Springer, p. 1-6 6 p.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

  • Lower Bounds for Kernelization

    Bodlaender, H., 2014, Parameterized and Exact Computation: 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Cygan, M. & Heggernes, P. (eds.). Springer, p. 1-14 14 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

  • Treewidth of Graphs: Encyclopedia of Algorithms

    Bodlaender, H., 2014, Encyclopedia of Algorithms. Kao, M.-Y. (ed.). Springer, p. 1-5 5 p.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

  • 2008

    Treewidth of Graphs

    Bodlaender, H. L., 2008, Encyclopedia of Algorithms. Kao, M.-Y. (ed.). Springer, p. 968-970 3 p.

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

  • 1996

    Finite-state computability of annotations of strings and trees (extended abstract): Combinatorial Pattern Matching

    Bodlaender, H., Fellows, M. R. & Evans, P. A., 1996, Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings. Hirschberg, D. & Myers, G. (eds.). Springer, Vol. 1075. p. 384-391 8 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1995

    Domino treewidth

    Bodlaender, H. & Engelfriet, J., 1995, Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94 Herrsching, Germany, June 16–18, 1994 Proceedings. Mayr, E., Schmidt, G. & Tinhofer, G. (eds.). Springer, Vol. 903. p. 1-13 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On Interval Routing Schemes and treewidth

    Bodlaender, H., Tan, R. B., Thilokos, D. & van Leeuwen, J., 1995, Graph-Theoretic Concepts in Computer Science: 21st International Workshop, WG '95 Aachen, Germany, June 20–22, 1995 Proceedings. Nagl, M. (ed.). Springer, Vol. 1017. p. 181-196 16 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1994

    Dynamic algorithms for graphs with treewidth 2

    Bodlaender, H., 1994, Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16–18, 1993 Proceedings. van Leeuwen, J. (ed.). Springer, Vol. 790. p. 112-124 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On reduction algorithms for graphs with small treewidth

    Bodlaender, H., 1994, Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16–18, 1993 Proceedings. van Leeuwen, J. (ed.). Springer, Vol. 790. p. 45-56 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On the complexity of the maximum cut problem

    Bodlaender, H. & Jansen, K., 1994, STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24–26, 1994 Proceedings. Enjalbert, P., Mayr, E. W. & Wagner, K. W. (eds.). Springer, Vol. 775. p. 769-780 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • The parameterized complexity of sequence alignment and consensus

    Bodlaender, H., Downey, R. G., Fellows, M. R. & Wareham, H. T., 1994, Combinatorial Pattern Matching: 5th Annual Symposium, CPM 94 Asilomar, CA, USA, June 5–8, 1994 Proceedings. Crochemore, M. & Gusfield, D. (eds.). Springer, Vol. 807. p. 15-30 16 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1993

    Computing treewidth and minimum fill-in: All you need are the minimal separators

    Kloks, T., Bodlaender, H., Müller, H. & Kratsch, D., 1993, Algorithms—ESA '93: First Annual European Symposium Bad Honnef, Germany September 30–October 2, 1993 Proceedings. Lengauer, T. (ed.). Springer, Vol. 726. p. 260-271 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Kayles on special classes of graphs — An application of Sprague-Grundy theory

    Bodlaender, H., 1993, Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings. Mayr, E. W. (ed.). Springer, Vol. 657. p. 90-102 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On the complexity of scheduling incompatible jobs with unit-times: Mathematical Foundations of Computer Science 1993

    Bodlaender, H. & Jansen, K., 1993, Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings. Borzyszkowski, A. M. & Sokołowski, S. (eds.). Springer, Vol. 711. p. 291-300 10 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Scheduling with incompatible jobs: Graph-Theoretic Concepts in Computer Science

    Bodlaender, H., Jansen, K. & Woeginger, G. J., 1993, Graph-Theoretic Concepts in Computer Science. Mayr, E. W. (ed.). Springer, Vol. 657. p. 37-49 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Treewidth and pathwidth of permutation graphs

    Bodlaender, H., Kloks, T. & Kratsch, D., 1993, Automata, Languages and Programming: 20th International Colloquium, ICALP 93 Lund, Sweden, July 5–9, 1993 Proceedings. Lingas, A., Karlsson, R. & Carlsson, S. (eds.). Springer, Vol. 700. p. 114-125 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1992

    Approximating treewidth, pathwidth, and minimum elimination tree height

    Bodlaender, H., Gilbert, J. R., Hafsteinsson, H. & Kloks, T., 1992, Graph-Theoretic Concepts in Computer Science: 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings. Schmidt, G. & Berghammer, R. (eds.). Springer, Vol. 570. p. 1-12 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Approximating treewidth and pathwidth of some classes of perfect graphs

    Kloks, T. & Bodlaender, H., 1992, Algorithms and Computation: Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings. Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T. & Yamashita, M. (eds.). Springer, Vol. 650. p. 116-125 10 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • A simple linear time algorithm for triangulating three-colored graphs

    Bodlaender, H. & Kloks, T., 1992, STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings. Finkel, A. & Jantzen, M. (eds.). Springer, Vol. 577. p. 413-423 11 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On disjoint cycles

    Bodlaender, H., 1992, Graph-Theoretic Concepts in Computer Science. Schmidt, G. & Berghammer, R. (eds.). Springer, Vol. 570. p. 230-238 9 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Testing superperfection of k-trees

    Kloks, T. & Bodlaender, H., 1992, Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings. Nurmi, O. & Ukkonen, E. (eds.). Springer, Vol. 621. p. 292-303 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Triangulating planar graphs while minimizing the maximum degree

    Kant, G. & Bodlaender, H., 1992, Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings. Nurmi, O. & Ukkonen, E. (eds.). Springer, Vol. 621. p. 258-271 14 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Two strikes against perfect phylogeny

    Bodlaender, H., Fellows, M. R. & Warnow, T. J., 1992, Automata, Languages and Programming: 19th International Colloquium Wien, Austria, July 13–17, 1992 Proceedings. Kuich, W. (ed.). Springer, Vol. 623. p. 273-283 11 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1991

    Better algorithms for the pathwidth and treewidth of graphs

    Bodlaender, H. & Kloks, T., 1991, Automata, Languages and Programming: 18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings. Albert, J. L., Monien, B. & Artalejo, M. R. (eds.). Springer, Vol. 510. p. 544-555 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • On the complexity of some coloring games

    Bodlaender, H., 1991, Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings. Möhring, R. H. (ed.). Springer, Vol. 484. p. 30-40 11 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • Planar graph augmentation problems: 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings

    Kant, G. & Bodlaender, H., 1991, Algorithms and Data Structures. Dehne, F., Sack, J.-R. & Santoro, N. (eds.). Springer, Vol. 519. p. 286-298 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1990

    The pathwidth and treewidth of cographs

    Bodlaender, H. & Möhring, R. H., 1990, SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July 11–14, 1990 Proceedings. Gilbert, J. R. & Karlsson, R. (eds.). Springer, Vol. 447. p. 301-309 9 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

  • 1989

    Distributed computing on transitive networks: The torus

    Beame, P. W. & Bodlaender, H., 1989, STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings. Monien, B. & Cori, R. (eds.). Springer, Vol. 349. p. 294-303 10 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review