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
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
SAT Local Search Algorithms: Worst-Case Study
Journal of Automated Reasoning
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Computing Stable Models: Worst-Case Performance Estimates
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
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
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
Recovering and Exploiting Structural Knowledge from CNF Formulas
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
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
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing stable models: worst-case performance estimates
Theory and Practice of Logic Programming
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
Journal of Algorithms
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
The Complexity of Pure Literal Elimination
Journal of Automated Reasoning
Computing minimal models, stable models and answer sets
Theory and Practice of Logic Programming
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
New upper bound for the #3-SAT problem
Information Processing Letters
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Present and Future of Practical SAT Solving
Complexity of Constraints
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
3-coloring in time O (1.3289n)
Journal of Algorithms
Finding models for blocked 3-SAT problems in linear time by systematical refinement of a sub-model
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Solving NP-complete problems with quantum search
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improving efficiency of 3-SAT-solving tile systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Polynomial time SAT decision, hypergraph transversals and the hermitian rank
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Algorithms for max hamming exact satisfiability
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Partitioning based algorithms for some colouring problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Algorithms for the maximum hamming distance problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Counting independent sets in claw-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Counting maximal independent sets in subcubic graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
Counting perfect matchings in graphs of degree 3
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 5.23 |