Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Homomorphisms to powers of digraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Complexity of homomorphisms to direct products of graphs
Information Processing Letters
Theoretical Computer Science
Complexity of graph covering problems
Nordic Journal of Computing
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
H-Colorings of Large Degree Graphs
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Connected and Loosely Connected List Homomorphisms
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The Complexity of Restrictive H-Coloring
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Generalized H-Coloring and H-Covering of Trees
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
The complexity of the T-coloring problem for graphs with small degree
Discrete Applied Mathematics
The complexity of minimal satisfiability problems
Information and Computation
Generalized H-coloring and H-covering of trees
Nordic Journal of Computing
The Homomorphism Structure of Classes of Graphs
Combinatorics, Probability and Computing
Complexity classification of network information flow problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
Computational complexity of compaction to irreflexive cycles
Journal of Computer and System Sciences
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
The complexity of Boolean matrix root computation
Theoretical Computer Science - Special papers from: COCOON 2003
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Journal of Computer and System Sciences
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
Resource-sharing system scheduling and circular chromatic number
Theoretical Computer Science
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
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
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
European Journal of Combinatorics
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Graphs, polymorphisms and the complexity of homomorphism 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
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information
Communication: Minimum cost homomorphisms to semicomplete multipartite digraphs
Discrete Applied Mathematics
Communication: On the restricted homomorphism problem
Discrete Applied Mathematics
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
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Dichotomy for bounded degree H-colouring
Discrete Applied Mathematics
Hom complexes and homotopy theory in the category of graphs
European Journal of Combinatorics
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Introduction to the Maximum Solution Problem
Complexity of Constraints
Extension problems with degree bounds
Discrete Applied Mathematics
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing
A new line of attack on the dichotomy conjecture
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
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
New Plain-Exponential Time Classes for Graph Homomorphism
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Communication: Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Discrete Applied Mathematics
The complexity of Boolean matrix root computation
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the forty-second ACM symposium on Theory of computing
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the approximation complexity hierarchy
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
A New Proof of the $H$-Coloring Dichotomy
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
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)
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Dichotomy for tree-structured trigraph list homomorphism problems
Discrete Applied Mathematics
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
Algorithms for partition of some class of graphs under compaction
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
QCSP on partially reflexive forests
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The computational complexity of disconnected cut and 2K2-partition
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)
Finite dualities and map-critical graphs on a fixed surface
Journal of Combinatorial Theory Series B
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Gadgets and anti-gadgets leading to a complexity dichotomy
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Generalised dualities and finite maximal antichains
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Journal of Computer and System Sciences
Universal structures and the logic of forbidden patterns
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On counting homomorphisms to directed acyclic graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Matrix and graph orders derived from locally constrained graph homomorphisms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A dichotomy for k-regular graphs with {0, 1}-vertex assignments and real edge functions
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Exact algorithms for graph homomorphisms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Obtaining online ecological colourings by generalizing first-fit
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
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 complexity of planar covering of small graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Tension continuous maps-Their structure and applications
European Journal of Combinatorics
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
SIAM Journal on Discrete Mathematics
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
H-colorings of dense hypergraphs
Information Processing Letters
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 maximum solution problem on graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Exact algorithms for L(2, 1)-labeling of graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Containment, equivalence and coreness from CSP to QCSP and beyond
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions
Theoretical Computer Science
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Graph partitions with prescribed patterns
European Journal of Combinatorics
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Obtaining Online Ecological Colourings by Generalizing First-Fit
Theory of Computing Systems
Exact algorithm for graph homomorphism and locally injective graph homomorphism
Information Processing Letters
Hi-index | 0.01 |