Vertex Cover Problem Parameterized Above and Below Tight Bounds
- 2 April 2010
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 48 (2) , 402-410
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Boxicity of graphs with bounded degreeEuropean Journal of Combinatorics, 2009
- Parameterizing above or below guaranteed valuesJournal of Computer and System Sciences, 2009
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs2009
- Parameterized Complexity of Vertex Cover VariantsTheory of Computing Systems, 2007
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartizationJournal of Computer and System Sciences, 2006
- Synchronization of a bounded degree graph of cellular automata with nonuniform delays in timeTheoretical Computer Science, 2006
- Scalable Parallel Algorithms for FPT ProblemsAlgorithmica, 2006
- Parameterized enumeration, transversals, and imperfect phylogeny reconstructionTheoretical Computer Science, 2006
- Solving large FPT problems on coarse-grained parallel machinesJournal of Computer and System Sciences, 2003
- A general method to speed up fixed-parameter-tractable algorithmsInformation Processing Letters, 2000