Concepedia

Treewidth Parameterization

Treewidth Parameterization is a parameterized algorithmic framework that measures the structural complexity of a graph by its treewidth, enabling fixed-parameter tractability for otherwise intractable problems through decomposition into tree-like substructures.

82

Publications

7.4K

Citations

147

Authors

112

Institutions

Publications per year

2017–2026

18

Parents

Publications

82

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

, , +14

A partial k-arboretum of graphs with bounded treewidth

Hans L. Bodlaender · Theoretical Computer Science · 1998 · 1.1K citations · Full text

, , +6

The complexity of homomorphism and constraint satisfaction problems seen from the other side

Martin Grohe · Journal of the ACM · 2007 · 441 citations

, , +17

Graph Searching and a Min-Max Theorem for Tree-Width

Paul Seymour, Rajan M. Thomas · Journal of Combinatorial Theory Series B · 1993 · 393 citations

, , +13

Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree

Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson et al. · Journal of Algorithms · 1995 · 292 citations

, , +7

1–5 of 82

Authors

147

  1. HL
    Hans L. Bodlaender

    Utrecht University, Netherlands

    8 publications · 2K citations

    8

    h-index

  2. RG
    Robert Ganian

    TU Wien, Austria

    6 publications · 144 citations

    6

    h-index

  3. TK
    Ton Kloks

    Friedrich Schiller University Jena, Germany

    5 publications · 498 citations

    5

    h-index

  4. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    5 publications · 278 citations

    5

    h-index

  5. MP
    Michał Pilipczuk

    University of Warsaw, Poland

    5 publications · 124 citations

    5

    h-index

1–5 of 147

Institutions

112

  1. TU Wien

    Vienna, Austria

    10 h-index

    18 publications

    604 citations

  2. University of Bergen

    Bergen, Norway

    8 h-index

    14 publications

    476 citations

  3. Utrecht University

    Utrecht, The Netherlands

    8 h-index

    13 publications

    3.2K citations

  4. Technische Universität Berlin

    Berlin, Germany

    4 h-index

    7 publications

    270 citations

  5. Humboldt-Universität zu Berlin

    Berlin, Germany

    4 h-index

    4 publications

    765 citations

  6. Centre National de la Recherche Scientifique

    Paris, France

    4 h-index

    4 publications

    161 citations

  7. University of Warsaw

    Warsaw, Poland

    3 h-index

    3 publications

    231 citations

  8. Eindhoven University of Technology

    Eindhoven, The Netherlands

    3 h-index

    7 publications

    1.3K citations

1–8 of 112

Venues

  1. Journal of Algorithms

    6 publications · 2K citations

    6

    h-index

  2. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 6 publications · 152 citations

    6

    h-index

  3. Algorithmica

    5 publications · 365 citations

    5

    h-index

  4. Discrete Applied Mathematics

    5 publications · 190 citations

    5

    h-index

  5. Information and Computation

    5 publications · 481 citations

    5

    h-index

1–5