Problem Kernels

Problem Kernels is a formal reduction technique in parameterized complexity theory that maps an instance of a parameterized problem to an equivalent instance whose size is bounded by a function of the parameter, preserving the answer while enabling efficient preprocessing.

15

Publications

873

Citations

38

Authors

19

Institutions

Publications per year

2017–2026

2

Authors

38

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    2 publications · 38 citations

    2

    h-index

  2. JG
    Jiong Guo

    Friedrich Schiller University Jena, Germany

    2 publications · 436 citations

    2

    h-index

  3. SK
    Stefan Kratsch

    Utrecht University, Netherlands

    2 publications · 120 citations

    2

    h-index

  4. MZ
    Meirav Zehavi

    Ben-Gurion University of the Negev, Israel

    2 publications · 32 citations

    2

    h-index

  5. JD
    José Domínguez Abascal

    Universidad de Sevilla, Spain

    1 publications · 89 citations

    1

    h-index

1–5 of 38

Venues

  1. ACM Transactions on Algorithms

    TALG · 3 publications · 118 citations

    3

    h-index

  2. Journal of Computer and System Sciences

    2 publications · 119 citations

    2

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 36 citations

    2

    h-index

  4. Journal of Graph Algorithms and Applications

    JGAA · 1 publications · 28 citations

    1

    h-index

  5. 1

    h-index

1–5