Parameterized Measure & Conquer for Problems with No Small Kernels
- 14 September 2011
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 64 (1) , 189-212
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A new upper bound for Max-2-SAT: A graph-theoretic approachJournal of Discrete Algorithms, 2010
- FPT algorithms and kernels for the Directed k-Leaf problemJournal of Computer and System Sciences, 2010
- The Curse of Connectivity: t-Total Vertex (Edge) CoverLecture Notes in Computer Science, 2010
- Exact and Parameterized Algorithms for Max Internal Spanning Tree2010
- Enumerate and Measure: Improving Parameter Budget Management2010
- Vertex and edge covers with clustering properties: Complexity and algorithmsJournal of Discrete Algorithms, 2009
- Incompressibility through Colors and IDs2009
- edge dominating set: Efficient Enumeration-Based Exact Algorithms2006
- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard ProblemsAlgorithmica, 2005
- Parameterized Complexity1999