Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On the Complements of Partial k-Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Operations Which Preserve Path-Width at Most Two
Combinatorics, Probability and Computing
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Graph searching in a crime wave
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Outerplanar obstructions for a feedback vertex set
European Journal of Combinatorics
Forbidden graphs for tree-depth
European Journal of Combinatorics
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Information and Computation
Characterizing graphs of small carving-width
Discrete Applied Mathematics
| Hi-index | 0.00 |