Kernelization

Kernelization is a preprocessing technique in parameterized algorithms that, given an instance of a problem and a parameter, reduces it in polynomial time to an equivalent instance—called a kernel—whose size is bounded by a function of the parameter alone.

100

Publications

6.3K

Citations

177

Authors

92

Institutions

Publications per year

2017–2026

23

Authors

177

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    19 publications · 1.4K citations

    16

    h-index

  2. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    16 publications · 1.2K citations

    14

    h-index

  3. SK
    Stefan Kratsch

    Utrecht University, Netherlands

    15 publications · 864 citations

    13

    h-index

  4. FV
    Fedor V. Fomin

    University of Bergen, Norway

    14 publications · 1.1K citations

    12

    h-index

  5. HL
    Hans L. Bodlaender

    Utrecht University, Netherlands

    10 publications · 890 citations

    10

    h-index

1–5 of 177

Venues

  1. ACM Transactions on Algorithms

    TALG · 8 publications · 456 citations

    8

    h-index

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

    Repository · 7 publications · 191 citations

    7

    h-index

  3. SIAM Journal on Discrete Mathematics

    5 publications · 422 citations

    5

    h-index

  4. arXiv (Cornell University)

    Repository · 5 publications · 195 citations

    5

    h-index

  5. Journal of Computer and System Sciences

    5 publications · 408 citations

    5

    h-index

1–5