Kernels: annotated, proper and induced

Authors:
Faisal N. Abu-Khzam;Henning Fernau
Affiliations:
Division of Comp.Sci. & Math., Lebanese American University, Beirut, Lebanon;FB 4—Abteilung Informatik, Universität Trier, Trier, Germany
Venue:
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Year:
2006

Citing 9
Cited 12

On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
An efficient fixed-parameter algorithm for 3-hitting set

Journal of Discrete Algorithms
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Algorithmica
A general data reduction scheme for domination in graphs

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Nonblocker: parameterized algorithmics for minimum dominating set

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The linear arrangement problem parameterized above guaranteed value

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
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
Parameterized Complexity

Parameterized Complexity

Fixed parameter algorithms for one-sided crossing minimization revisited

Journal of Discrete Algorithms
The parameterized complexity of regular subgraph problems and generalizations

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Vertex and edge covers with clustering properties: Complexity and algorithms

Journal of Discrete Algorithms
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A kernelization algorithm for d-Hitting Set

Journal of Computer and System Sciences
Breaking the 2n-barrier for Irredundance: Two lines of attack

Journal of Discrete Algorithms
A new bound for 3-satisfiable maxsat and its algorithmic application

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Editing graphs to satisfy degree constraints: A parameterized approach

Journal of Computer and System Sciences
Kernelization algorithms for d-hitting set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A new bound for 3-satisfiable MaxSat and its algorithmic application

Information and Computation
Note: Parameterized complexity of k-Chinese Postman Problem

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of a “problem kernel” plays a central role in the design of fixed-parameter algorithms. The $\mathcal{FPT}$ literature is rich in kernelization algorithms that exhibit fundamentally different approaches. We highlight these differences and discuss several generalizations and restrictions of the standard notion.