The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Counting H-colorings of partial k-trees
Theoretical Computer Science
A 4-colour problem for dense triangle-free graphs
Discrete Mathematics
Universal H-colorable graphs without a given configuration
Discrete Mathematics
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
Triangle-free graphs and forbidden subgraphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Homomorphism Structure of Classes of Graphs
Combinatorics, Probability and Computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Data exchange: computing cores in polynomial time
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange and incomplete information
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal universal and dense minor closed classes
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
CWA-solutions for data exchange settings with target dependencies
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient core computation in data exchange
Journal of the ACM (JACM)
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Homomorphism preservation theorems
Journal of the ACM (JACM)
Towards Practical Feasibility of Core Computation in Data Exchange
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Maximal infinite-valued constraint languages
Theoretical Computer Science
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Graph Theory, Computational Intelligence and Thought
Certain answers for XML queries
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Logic and data exchange: which solutions are "good" solutions?
LOFT'08 Proceedings of the 8th international conference on Logic and the foundations of game and decision theory
Database constraints and homomorphism dualities
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
On the equivalence of distributed systems with queries and communication
Proceedings of the 14th International Conference on Database Theory
Foundations of Semantic Web databases
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
Characterizing schema mappings via data examples
ACM Transactions on Database Systems (TODS)
Journal of Computer and System Sciences
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Local transformations and conjunctive-query equivalence
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Core schema mappings: Scalable core computations in data exchange
Information Systems
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
On the equivalence of distributed systems with queries and communication
Journal of Computer and System Sciences
Solutions and query rewriting in data exchange
Information and Computation
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |