STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
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
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
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 |