The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Exact algorithms for intervalizing colored graphs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
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 |