Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |