Concepedia

Parameterized Complexity

Parameterized Complexity is a computational framework within complexity theory that classifies computational problems based on their inherent difficulty with respect to multiple input parameters, rather than solely input size, by isolating a parameter to measure fixed-parameter tractability.

346

Publications

18.9K

Citations

404

Authors

215

Institutions

Publications per year

2017–2026

70

Parents

Publications

346

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

, , +12

Fixed-Parameter Tractability and Completeness I: Basic Results

Rod Downey, Michael R. Fellows · SIAM Journal on Computing · 1995 · 472 citations

, , +13

Invitation to data reduction and problem kernelization

Jiong Guo, Rolf Niedermeier · ACM SIGACT News · 2007 · 381 citations

, , +15

On the parameterized complexity of multiple-interval graph problems

Michael R. Fellows, Danny Hermelin, Frances Rosamond et al. · Theoretical Computer Science · 2008 · 328 citations

, , +14

The complexity of combinatorial problems with succinct input representation

Klaus W. Wagner · Acta Informatica · 1986 · 293 citations

, , +14

1–5 of 346

Authors

404

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    26 publications · 5.3K citations

    21

    h-index

  2. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    23 publications · 1.4K citations

    19

    h-index

  3. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    26 publications · 1.5K citations

    18

    h-index

  4. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    27 publications · 1.4K citations

    18

    h-index

  5. FV
    Fedor V. Fomin

    University of Bergen, Norway

    22 publications · 894 citations

    17

    h-index

1–5 of 404

Institutions

215

  1. University of Bergen

    Bergen, Norway

    23 h-index

    88 publications

    3.1K citations

  2. Institute of Mathematical Sciences

    Chennai, India

    17 h-index

    35 publications

    2K citations

  3. TU Wien

    Vienna, Austria

    17 h-index

    63 publications

    1.7K citations

  4. Utrecht University

    Utrecht, The Netherlands

    17 h-index

    28 publications

    1.6K citations

  5. Technische Universität Berlin

    Berlin, Germany

    16 h-index

    71 publications

    1.9K citations

  6. Victoria University of Wellington

    Wellington, New Zealand

    14 h-index

    20 publications

    2.1K citations

  7. Friedrich Schiller University Jena

    Jena, Germany

    13 h-index

    21 publications

    2.2K citations

  8. Saarland University

    Saarbrücken, Germany

    12 h-index

    16 publications

    513 citations

1–8 of 215

Venues

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

    Repository · 25 publications · 746 citations

    17

    h-index

  2. Theoretical Computer Science

    23 publications · 1.2K citations

    15

    h-index

  3. Algorithmica

    16 publications · 494 citations

    14

    h-index

  4. SIAM Journal on Computing

    15 publications · 1.7K citations

    13

    h-index

  5. arXiv (Cornell University)

    Repository · 15 publications · 236 citations

    11

    h-index

1–5