The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Approximation algorithms
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Optimal 2-constraint satisfaction via sum--product algorithms
Information Processing Letters
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Determinant Sums for Undirected Hamiltonicity
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Exact Exponential Algorithms
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Parameterized Complexity
| Hi-index | 48.22 |
Discovering surprises in the face of intractability.