Universal H-colorable graphs without a given configuration
Discrete Mathematics
On the order of countable graphs
European Journal of Combinatorics
On sparse graphs with given colorings and homomorphisms
Journal of Combinatorial Theory Series B
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
There are no pure relational width 2 constraint satisfaction problems
Information Processing Letters
Characterizing schema mappings via data examples
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Characterizing schema mappings via data examples
ACM Transactions on Database Systems (TODS)
Tension continuous maps-Their structure and applications
European Journal of Combinatorics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |