Fixed-parameter Tractability

Fixed-Parameter Tractability is a computational complexity property that characterizes decision problems solvable in time polynomial in the input size when augmented by a bounded function of a specified parameter, thereby enabling efficient solutions for instances where the parameter is small.

210

Publications

10.7K

Citations

352

Authors

227

Institutions

Publications per year

2017–2026

42

Authors

352

  1. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    24 publications · 1.4K citations

    16

    h-index

  2. MR
    Michael R. Fellows

    University of Victoria, Canada

    13 publications · 1.4K citations

    13

    h-index

  3. JG
    Jiong Guo

    Friedrich Schiller University Jena, Germany

    11 publications · 564 citations

    11

    h-index

  4. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    12 publications · 570 citations

    11

    h-index

  5. MP
    Marcin Pilipczuk

    University of Warsaw, Poland

    8 publications · 200 citations

    8

    h-index

1–5 of 352

Venues

  1. Algorithmica

    11 publications · 829 citations

    11

    h-index

  2. SIAM Journal on Computing

    11 publications · 817 citations

    10

    h-index

  3. arXiv (Cornell University)

    Repository · 9 publications · 157 citations

    9

    h-index

  4. SIAM Journal on Discrete Mathematics

    8 publications · 249 citations

    8

    h-index

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

    Repository · 8 publications · 103 citations

    8

    h-index

1–5