A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
On the approximability of some maximum spanning tree problems
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
On the complexity of protein folding (abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Linear Time Minor Tests and Depth First Search
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
VC-Dimensions for Graphs (Extended Abstract)
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
Parametric duality and kernelization: lower bounds and upper bounds on kernel size
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter tractability results for full-degree spanning tree and its dual
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Towards a taxonomy of techniques for designing parameterized algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a significantly improved FPT algorithm for the MAXIMUM LEAF SPANNING TREE problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of DOMINATING SET (also known as NONBLOCKER), MATRIX DOMINATION, EDGE DOMINATING SET, and FEEDBACK VERTEX SET FOR UNDIRECTED GRAPHS. The main payoffs of these new methods are in improved functions f(k) in the FPT running times, and in general systematic approaches that seem to apply to a wide variety of problems.