Randomized Parameterized Algorithms
Randomized Parameterized Algorithms is a class of parameterized algorithms that employ randomness as a computational resource to achieve expected or bounded runtime complexity with respect to a problem's parameter, distinguishing it from deterministic parameterized algorithms by its probabilistic decision-making process.
24
Publications
936
Citations
56
Authors
46
Institutions
Publications per year
2017–2026
4
Parents
24
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Stefan Kratsch, Frank Neumann · Algorithmica · 2012 · 81 citations · Full text
Resolution is not automatizable unless W[P] is tractable
M. Alekhnovich, A.A. Razboro · 2001 · 72 citations
1–5 of 24
56
5
h-index
4
h-index
4
h-index
2
h-index
2
h-index
1–5 of 56
46

Institute of Mathematical Sciences
Chennai, India
6 h-index
12 publications
523 citations
University of Bergen
Bergen, Norway
6 h-index
13 publications
374 citations

TU Wien
Vienna, Austria
2 h-index
2 publications
128 citations

University of Warsaw
Warsaw, Poland
2 h-index
4 publications
72 citations

Doshisha University
Kyoto, Japan
1 h-index
1 publications
30 citations

Central South University
Changsha, China
1 h-index
4 publications
96 citations
Université de Lorraine
Nancy, France
1 h-index
3 publications
39 citations

Université de Reims Champagne-Ardenne
Reims, France
1 h-index
1 publications
13 citations
1–8 of 46
5 publications · 225 citations
5
h-index
4 publications · 188 citations
4
h-index
2 publications · 83 citations
2
h-index
1 publications · 80 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5