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
Parents
56
Invitation to fixed-parameter algorithms
Dimitrios M. Thilikos · Computer Science Review · 2007 · 324 citations
Fixed-parameter intractability
Rodney G. Downey, Michael R. Fellows · 2003 · 110 citations · Full text
1–5 of 56
97
8
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 97
77
Charles University
Prague, Czechia
5 h-index
7 publications
111 citations
University of Bergen
Bergen, Norway
5 h-index
14 publications
364 citations

Royal Holloway University of London
Egham, United Kingdom
5 h-index
13 publications
397 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
8 publications
196 citations

Institute of Mathematical Sciences
Chennai, India
4 h-index
4 publications
118 citations
Chennai Mathematical Institute
Chennai, India
4 h-index
4 publications
79 citations

University of Warsaw
Warsaw, Poland
3 h-index
3 publications
549 citations

University of Warwick
Coventry, United Kingdom
3 h-index
3 publications
41 citations
1–8 of 77
6 publications · 209 citations
6
h-index
5 publications · 128 citations
5
h-index
2 publications · 38 citations
2
h-index
2 publications · 67 citations
2
h-index
2 publications · 57 citations
2
h-index
1–5