Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Complexity of homomorphisms to direct products of graphs
Information Processing Letters
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
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
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science
The list partition problem for graphs
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 restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Journal of Computer and System Sciences
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
Extension problems with degree bounds
Discrete Applied Mathematics
Parameterizing Cut Sets in a Graph by the Number of Their Components
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
SIAM Journal on Discrete Mathematics
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
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 dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics
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
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
Sum-Max graph partitioning problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The maximum solution problem on graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Approximation of minimum cost homomorphisms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Graph partitions with prescribed patterns
European Journal of Combinatorics
Semilattice polymorphisms and chordal graphs
European Journal of Combinatorics
| Hi-index | 0.00 |