Exact Exponential Algorithms

Exact Exponential Algorithms is a class of exact algorithms that solve NP-hard problems by systematically exploring the solution space in exponential time, distinguished from other exact methods by their explicit design to achieve the best possible worst-case time complexity while guaranteeing optimal solutions.

38

Publications

1.9K

Citations

88

Authors

58

Institutions

Publications per year

2017–2026

10

Authors

88

  1. FV
    Fedor V. Fomin

    University of Bergen, Norway

    5 publications · 461 citations

    5

    h-index

  2. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    4 publications · 385 citations

    4

    h-index

  3. MC
    Marek Cygan

    University of Warsaw, Poland

    4 publications · 237 citations

    4

    h-index

  4. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    4 publications · 385 citations

    4

    h-index

  5. HF
    Henning Fernau

    Universität Trier, Germany

    3 publications · 58 citations

    3

    h-index

1–5 of 88

Venues

  1. Algorithmica

    3 publications · 67 citations

    3

    h-index

  2. Discrete Applied Mathematics

    3 publications · 85 citations

    3

    h-index

  3. Information Processing Letters

    3 publications · 113 citations

    3

    h-index

  4. ACM Transactions on Algorithms

    TALG · 2 publications · 161 citations

    2

    h-index

  5. BMC Bioinformatics

    2 publications · 72 citations

    2

    h-index

1–5