Subexponential Parameterized Algorithms
Subexponential Parameterized Algorithms is a class of fixed-parameter tractable algorithms whose running time grows subexponentially in the parameter, typically expressed as \(2^{o(k)} \cdot \text{poly}(n)\), distinguishing it from standard parameterized algorithms that may exhibit exponential dependence on the parameter.
44
Publications
2.8K
Citations
48
Authors
45
Institutions
Publications per year
2017–2026
5
Parents
44
Parameterized Complexity and Approximation Algorithms
Dániel Marx · The Computer Journal · 2007 · 287 citations
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh et al. · Symposium on Discrete Algorithms · 2010 · 163 citations
1–5 of 44
48
16
h-index
12
h-index
10
h-index
National and Kapodistrian University of Athens, Greece
8 publications · 918 citations
8
h-index
7
h-index
1–5 of 48
45
University of Bergen
Bergen, Norway
15 h-index
41 publications
1.8K citations

Institute of Mathematical Sciences
Chennai, India
11 h-index
16 publications
712 citations

University of Warsaw
Warsaw, Poland
6 h-index
14 publications
356 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
4 h-index
5 publications
164 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
4 publications
229 citations

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
3 publications
114 citations

National and Kapodistrian University of Athens
Athens, Greece
3 h-index
3 publications
512 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
5 publications
122 citations
1–8 of 45
5 publications · 250 citations
5
h-index
4 publications · 188 citations
4
h-index
Conference · 3 publications · 237 citations
3
h-index
Repository · 2 publications · 118 citations
2
h-index
2 publications · 196 citations
2
h-index
1–5