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
402
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
1–5 of 402
560
23
h-index
18
h-index
14
h-index
13
h-index
13
h-index
1–5 of 560
295
University of Bergen
Bergen, Norway
20 h-index
74 publications
2.3K citations
Technische Universität Berlin
Berlin, Germany
17 h-index
58 publications
1.8K citations

Institute of Mathematical Sciences
Chennai, India
16 h-index
30 publications
1.5K citations
Charles University
Prague, Czechia
13 h-index
25 publications
837 citations
Humboldt-Universität zu Berlin
Berlin, Germany
13 h-index
18 publications
1.4K citations

University of Warsaw
Warsaw, Poland
13 h-index
27 publications
696 citations

TU Wien
Vienna, Austria
13 h-index
39 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
16 publications
724 citations
1–8 of 295
28 publications · 1.8K citations
17
h-index
18 publications · 1.6K citations
15
h-index
15 publications · 448 citations
14
h-index
Repository · 17 publications · 506 citations
13
h-index
Repository · 17 publications · 268 citations
12
h-index
1–5