A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Quantum Search Algorithms in Science and Engineering
Computing in Science and Engineering
Quantum Computing: The Final Frontier?
IEEE Intelligent Systems
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
New Algorithms for k -SAT Based on the Local Search Principle
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Exploiting Partial Knowledge of Satisfying Assignments
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
How efficiently can room at the bottom be traded away for speed at the top?
Natural Computing: an international journal
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Journal of Algorithms
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Theoretical Computer Science
Proceedings of the 2006 ACM symposium on Applied computing
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
An improved exact algorithm for the domatic number problem
Information Processing Letters
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
3-coloring in time O (1.3289n)
Journal of Algorithms
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Derandomization of PPSZ for unique-k-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An improved upper bound for SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On moderately exponential time for SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On the limits of sparsification
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.01 |