Subexponential Parameterized Algorithms

Subexponential Parameterized Algorithms is a class of fixed-parameter tractable algorithms whose running time grows subexponentially in the parameter, typically expressed as \(2^{o(k)} \cdot \text{poly}(n)\), distinguishing it from standard parameterized algorithms that may exhibit exponential dependence on the parameter.

44

Publications

2.8K

Citations

48

Authors

45

Institutions

Publications per year

2017–2026

5

Authors

48

  1. FV
    Fedor V. Fomin

    University of Bergen, Norway

    23 publications · 1.3K citations

    16

    h-index

  2. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    13 publications · 598 citations

    12

    h-index

  3. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    11 publications · 490 citations

    10

    h-index

  4. DM
    Dimitrios M. Thilikos

    National and Kapodistrian University of Athens, Greece

    8 publications · 918 citations

    8

    h-index

  5. DM
    Dániel Marx

    Hungarian Academy of Sciences, Hungary

    7 publications · 476 citations

    7

    h-index

1–5 of 48

Venues

  1. SIAM Journal on Computing

    5 publications · 250 citations

    5

    h-index

  2. Theoretical Computer Science

    4 publications · 188 citations

    4

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 3 publications · 237 citations

    3

    h-index

  4. SZTAKI Publication Repository (Hungarian Academy of Sciences)

    Repository · 2 publications · 118 citations

    2

    h-index

  5. Journal of Computer and System Sciences

    2 publications · 196 citations

    2

    h-index

1–5