Some complexity results about threshold graphs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Introduction to Algorithms
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Invitation to data reduction and problem kernelization
ACM SIGACT News
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Parameterized Complexity
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Kernel and fast algorithm for dense triplet inconsistency
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
| Hi-index | 0.00 |
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-complete edge deletion problems where the goal graph has to be a chain, a split, a threshold, or a co-trivially perfect graph, respectively. All these four graph classes are characterized by a common forbidden induced subgraph 2K2, that is, an independent pair of edges. We present the seemingly first non-trivial algorithmic results for these four problems, namely, four polynomial-time data reduction algorithms that achieve problem kernels containing O(k2), O(k4), O(k3), and O(k3) vertices, respectively.