The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SIGACT news complexity theory column 34
ACM SIGACT News
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Constraints on Intervals and Lengths
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Generic ILP versus specialized 0-1 ILP: an update
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Information and Computation
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Information Processing Letters
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
The complexity of soft constraint satisfaction
Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Symmetry breaking for pseudo-Boolean formulas
Journal of Experimental Algorithmics (JEA)
Using SAT-based techniques in power estimation
Microelectronics Journal
Solution and Optimization of Systems of Pseudo-Boolean Constraints
IEEE Transactions on Computers
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Classes of Submodular Constraints Expressible by Graph Cuts
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
Relatively quantified constraint satisfaction
Constraints
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Introduction to the Maximum Solution Problem
Complexity of Constraints
Existentially restricted quantified constraint satisfaction
Information and Computation
Bit-precise reasoning with affine functions
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
A note on some collapse results of valued constraints
Information Processing Letters
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing
A Computational Proof of Complexity of Some Restricted Counting Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
Classification of a Class of Counting Problems Using Holographic Reductions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
Phase transition for random quantified XOR-formulas
Journal of Artificial Intelligence Research
A maximal tractable class of soft constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
PN code acquisition using Boolean satisfiability techniques
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Information Processing Letters
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The expressive power of valued constraints: hierarchies and collapses
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
The complexity of valued constraint models
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
Spin systems on graphs with complex edge functions and specified degree regularities
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the approximability of minimum topic connected overlay and its special instances
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Pervasive and Mobile Computing
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Quantified Equality Constraints
SIAM Journal on Computing
Computational Complexity of Holant Problems
SIAM Journal on Computing
Gadgets and anti-gadgets leading to a complexity dichotomy
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling
SIAM Journal on Discrete Mathematics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Spin systems on k-regular graphs with complex edge functions
Theoretical Computer Science
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
Temporal network optimization subject to connectivity constraints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
| Hi-index | 0.01 |