Parameterized Algorithms

Parameterized Algorithms is a branch of algorithm design that addresses computational problems by associating their complexity not only with input size but also with an additional parameter, thereby enabling efficient solutions for instances where the parameter value is small.

670

Publications

38.6K

Citations

878

Authors

457

Institutions

Publications per year

2017–2026

123

Authors

878

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    51 publications · 2.5K citations

    27

    h-index

  2. MR
    Michael R. Fellows

    University of Victoria, Canada

    37 publications · 6.2K citations

    27

    h-index

  3. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    30 publications · 2.2K citations

    24

    h-index

  4. RN
    Rolf Niedermeier

    Technische Universität Berlin, Germany

    35 publications · 2.8K citations

    24

    h-index

  5. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    43 publications · 2.4K citations

    24

    h-index

1–5 of 878

Venues

  1. SIAM Journal on Computing

    28 publications · 3.2K citations

    23

    h-index

  2. Theoretical Computer Science

    45 publications · 2.8K citations

    23

    h-index

  3. Algorithmica

    33 publications · 1.7K citations

    21

    h-index

  4. Journal of Computer and System Sciences

    24 publications · 1.8K citations

    18

    h-index

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

    Repository · 29 publications · 765 citations

    16

    h-index

1–5