Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Information Processing Letters
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Graph coloring and the immersion order
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Clustering with local restrictions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Clustering with local restrictions
Information and Computation
| Hi-index | 0.00 |