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
Parents
38
Marshall Fixman, Juan J. Freire · Biopolymers · 1977 · 224 citations
On Problems as Hard as CNF-SAT
Marek Cygan, Holger Dell, Daniel Lokshtanov et al. · ACM Transactions on Algorithms · 2016 · 117 citations
1–5 of 38
88
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 88
58
University of Bergen
Bergen, Norway
7 h-index
11 publications
1K citations

Institute of Mathematical Sciences
Chennai, India
4 h-index
5 publications
554 citations
Utrecht University
Utrecht, The Netherlands
4 h-index
5 publications
219 citations

University of Warsaw
Warsaw, Poland
3 h-index
5 publications
180 citations
University of California San Diego
San Diego, United States
3 h-index
3 publications
145 citations

Universität Trier
Trier, Germany
3 h-index
5 publications
85 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
4 publications
159 citations
Dalle Molle Institute for Artificial Intelligence Research
Lugano, Switzerland
2 h-index
2 publications
106 citations
1–8 of 58
3 publications · 67 citations
3
h-index
3 publications · 85 citations
3
h-index
3 publications · 113 citations
3
h-index
TALG · 2 publications · 161 citations
2
h-index
2 publications · 72 citations
2
h-index
1–5