Parameterized Algorithms
Parameterized Algorithms is a branch of algorithm design that addresses computational problems by associating their complexity not only with input size but also with an additional parameter, thereby enabling efficient solutions for instances where the parameter value is small.
670
Publications
38.6K
Citations
878
Authors
457
Institutions
Publications per year
2017–2026
123
670
Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text
Empirical parameterization of setup, swash, and runup
Hilary F. Stockdon, R. A. Holman, Peter A. Howd et al. · Coastal Engineering · 2006 · 1.4K citations
1–5 of 670
878
27
h-index
27
h-index
24
h-index
24
h-index
24
h-index
1–5 of 878
457
University of Bergen
Bergen, Norway
33 h-index
157 publications
6.8K citations

Institute of Mathematical Sciences
Chennai, India
27 h-index
75 publications
4.4K citations
Utrecht University
Utrecht, The Netherlands
21 h-index
43 publications
3.6K citations

University of Warsaw
Warsaw, Poland
19 h-index
61 publications
2.6K citations
Friedrich Schiller University Jena
Jena, Germany
19 h-index
51 publications
4.5K citations

TU Wien
Vienna, Austria
17 h-index
48 publications
1.5K citations
Texas A&M University
College Station, United States
17 h-index
37 publications
3.4K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
38 publications
2.7K citations
1–8 of 457
28 publications · 3.2K citations
23
h-index
45 publications · 2.8K citations
23
h-index
33 publications · 1.7K citations
21
h-index
24 publications · 1.8K citations
18
h-index
Repository · 29 publications · 765 citations
16
h-index
1–5