The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Exact Exponential Algorithms
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Moon, J. W., & Moser, L. (1965) · Israel Journal of Mathematics · doi:10.1007/bf02760024 · Cited by 837
Dynamic Programming Treatment of the Travelling Salesman Problem
Bellman, R. (1962) · Journal of the ACM · doi:10.1145/321105.321111 · Cited by 808
Exact Algorithms for NP-Hard Problems: A Survey
Woeginger, G. J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36478-1_17 · Cited by 652
Matching is as easy as matrix inversion
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.383347 · Cited by 609
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
Finding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
A new algorithm for optimal 2-constraint satisfaction and its implications
Williams, R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.023 · Cited by 386
Set Partitioning via Inclusion-Exclusion
Björklund, A., Husfeldt, T., & Koivisto, M. (2009) · SIAM Journal on Computing · doi:10.1137/070683933 · Cited by 370
The status of the P versus NP problem
Fortnow, L. (2009) · Communications of the ACM · doi:10.1145/1562164.1562186 · Cited by 321
A measure & conquer approach for the analysis of exact algorithms
Fomin, F. V., Grandoni, F., & Kratsch, D. (2009) · Journal of the ACM · doi:10.1145/1552285.1552286 · Cited by 237
Self-citationBoolean satisfiability from theoretical hardness to practical success
Malik, S., & Zhang, L. (2009) · Communications of the ACM · doi:10.1145/1536616.1536637 · Cited by 174
Measure and Conquer: Domination – A Case Study
Fomin, F. V., Grandoni, F., & Kratsch, D. (2005) · Lecture notes in computer science · doi:10.1007/11523468_16 · Cited by 149
Self-citationDeterminant Sums for Undirected Hamiltonicity
Björklund, A. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.24 · Cited by 135
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
Eppstein, D. (2006) · ACM Transactions on Algorithms · doi:10.1145/1198513.1198515 · Cited by 102
Space and Time Complexity of Exact Algorithms: Some Open Problems
Woeginger, G. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28639-4_25 · Cited by 83
Chapter 16. Worst-Case Upper Bounds
Dantsin, E. Y., & Hirsch, E. A. (2009) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-58603-929-5-403 · Cited by 52
Optimal 2-constraint satisfaction via sum–product algorithms
Koivisto, M. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2005.11.013 · Cited by 19
Invitation to Algorithmic Uses of Inclusion–Exclusion
Husfeldt, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22012-8_3 · Cited by 4
Metadata
- Authors
- Fomin, F. V., & Kratsch, D.
- Venue
- Texts in Theoretical Computer Science. An EATCS Series
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- ISSN
- 1862-4499 (ISSN-L)
- OpenAlex
- W2015963099
- Cited by
- 471
- References
- 26
- FWCI
- 10.50
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.