New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Solving 3-Satisfiability in Less Then 1, 579n Steps
CSL '92 Selected Papers from the Workshop on Computer Science Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On quantum versions of record-breaking algorithms for SAT
ACM SIGACT News
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 2006 ACM symposium on Applied computing
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
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
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
ACM Transactions on Algorithms (TALG)
ACM SIGACT News
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Parametric quantified SAT solving
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A faster algorithm for the steiner tree problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Bounding the number of minimal dominating sets: a measure and conquer approach
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Derandomization of PPSZ for unique-k-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
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
An exact algorithm for the boolean connectivity problem for k-CNF
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
On the quality and quantity of random decisions in stochastic local search for SAT
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Provably secure steganography and the complexity of sampling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
An improved exact algorithm for cubic graph TSP
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
String similarity measures and joins with synonyms
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |