Parameterized Algorithms For Hitting Set
Parameterized Algorithms for Hitting Set is a parameterized algorithmic framework that solves the Hitting Set problem by confining its computational complexity to a fixed parameter, typically the solution size, thereby enabling efficient exact solutions for instances where the parameter is small.
14
Publications
697
Citations
23
Authors
21
Institutions
Publications per year
2017–2026
2
Parents
14
1–5 of 14
23
4
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 23
21

Trier University of Applied Sciences
Trier, Germany
3 h-index
3 publications
73 citations
UniLaSalle Amiens (ESIEE-Amiens)
Amiens, France
1 h-index
2 publications
38 citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
1 h-index
2 publications
38 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
207 citations
Université Gustave Eiffel
Champs-sur-Marne, France
1 h-index
2 publications
38 citations

Universität Trier
Trier, Germany
1 h-index
1 publications
14 citations
Lahore University of Management Sciences
Lahore, Pakistan
1 h-index
1 publications
207 citations
RWTH Aachen University
Aachen, Germany
1 h-index
1 publications
157 citations
1–8 of 21
2 publications · 172 citations
2
h-index
2 publications · 69 citations
2
h-index
1 publications · 35 citations
1
h-index
1 publications · 207 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5