Complexity of graph covering problems
Nordic Journal of Computing
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Fixed-Parameter Complexity of lambda-Labelings
WG '99 Proceedings of the 25th 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
Generalized H-coloring and H-covering of trees
Nordic Journal of Computing
Cantor-Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
| Hi-index | 0.00 |