Parameterized Inapproximability

Parameterized Inapproximability is a theoretical framework in computational complexity that characterizes the hardness of approximating solutions to parameterized optimization problems, by establishing lower bounds on approximation factors that hold even when the parameter is fixed or bounded.

56

Publications

3.8K

Citations

97

Authors

77

Institutions

Publications per year

2017–2026

8

Authors

97

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    8 publications · 337 citations

    8

    h-index

  2. GG
    Gregory Gutin

    Royal Holloway University of London, United Kingdom

    6 publications · 164 citations

    6

    h-index

  3. AY
    Anders Yeo

    Royal Holloway University of London, United Kingdom

    5 publications · 153 citations

    5

    h-index

  4. GP
    Geevarghese Philip

    Institute of Mathematical Sciences, India

    5 publications · 96 citations

    5

    h-index

  5. EJ
    Eun Jung Kim

    Texas A&M University, United States

    4 publications · 135 citations

    4

    h-index

1–5 of 97

Venues

  1. Journal of Computer and System Sciences

    6 publications · 209 citations

    6

    h-index

  2. Theoretical Computer Science

    5 publications · 128 citations

    5

    h-index

  3. Theory of Computing Systems

    2 publications · 38 citations

    2

    h-index

  4. Algorithmica

    2 publications · 67 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 57 citations

    2

    h-index

1–5