Parameterized Complexity Classes

Parameterized Complexity Classes is a formal framework in computational complexity theory that classifies computational problems based on their inherent difficulty with respect to both input size and a fixed parameter, enabling a refined analysis of tractability beyond classical worst-case complexity.

402

Publications

23.1K

Citations

560

Authors

295

Institutions

Publications per year

2017–2026

69

Authors

560

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    29 publications · 5.8K citations

    23

    h-index

  2. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    22 publications · 1.2K citations

    18

    h-index

  3. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    17 publications · 770 citations

    14

    h-index

  4. FV
    Fedor V. Fomin

    University of Bergen, Norway

    15 publications · 599 citations

    13

    h-index

  5. MG
    Martin Grohe

    Humboldt-Universität zu Berlin, Germany

    13 publications · 1.3K citations

    13

    h-index

1–5 of 560

Venues

  1. Theoretical Computer Science

    28 publications · 1.8K citations

    17

    h-index

  2. SIAM Journal on Computing

    18 publications · 1.6K citations

    15

    h-index

  3. Algorithmica

    15 publications · 448 citations

    14

    h-index

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

    Repository · 17 publications · 506 citations

    13

    h-index

  5. arXiv (Cornell University)

    Repository · 17 publications · 268 citations

    12

    h-index

1–5