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
Variants
Fpt
210
Invitation to fixed-parameter algorithms
Dimitrios M. Thilikos · Computer Science Review · 2007 · 324 citations
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
Jochen Alber, Hans L. Bodlaender, Henning Fernau et al. · Algorithmica · 2002 · 303 citations
1–5 of 210
352
16
h-index
13
h-index
11
h-index
11
h-index
8
h-index
1–5 of 352
227
Technische Universität Berlin
Berlin, Germany
13 h-index
35 publications
1.1K citations
Friedrich Schiller University Jena
Jena, Germany
12 h-index
31 publications
2.1K citations

TU Wien
Vienna, Austria
11 h-index
24 publications
447 citations

University of Warsaw
Warsaw, Poland
11 h-index
15 publications
431 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
14 publications
427 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
9 h-index
12 publications
450 citations
University of Bergen
Bergen, Norway
9 h-index
22 publications
518 citations

Hungarian Academy of Sciences
Budapest, Hungary
8 h-index
9 publications
390 citations
1–8 of 227
11 publications · 829 citations
11
h-index
11 publications · 817 citations
10
h-index
Repository · 9 publications · 157 citations
9
h-index
8 publications · 249 citations
8
h-index
Repository · 8 publications · 103 citations
8
h-index
1–5