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

Authors

23

  1. HF
    Henning Fernau

    Universität Trier, Germany

    4 publications · 87 citations

    4

    h-index

  2. SR
    Saurabh Ray

    Max Planck Institute for Informatics, Germany

    2 publications · 226 citations

    2

    h-index

  3. NH
    Nabil H. Mustafa

    Duke University, United States

    2 publications · 226 citations

    2

    h-index

  4. LM
    Leonid Molokov

    Chalmers University of Technology, Sweden

    1 publications · 15 citations

    1

    h-index

  5. NB
    Norbert Bus

    New York University Abu Dhabi, United Arab Emirates

    1 publications · 19 citations

    1

    h-index

1–5 of 23

Venues

  1. Journal of Discrete Algorithms

    2 publications · 172 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 69 citations

    2

    h-index

  3. Algorithmica

    1 publications · 35 citations

    1

    h-index

  4. Discrete & Computational Geometry

    1 publications · 207 citations

    1

    h-index

  5. International Journal of Computer Mathematics

    1 publications · 14 citations

    1

    h-index

1–5