Polynomial Kernelization for Removing Induced Claws and Diamonds
Open Access
- 23 June 2016
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 60 (4) , 615-636
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Narodowe Centrum Nauki (DEC-2013/11/D/ST6/03073, DEC-2012/05/D/ST6/03214)
This publication has 26 references indexed in Scilit:
- Subexponential parameterized algorithm for Interval Completion2015
- A Polynomial Kernel for Trivially Perfect Editing2015
- Parameterized Algorithms2015
- Subexponential Parameterized Algorithm for Minimum Fill-InSIAM Journal on Computing, 2013
- On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification ProblemsAlgorithmica, 2012
- Parameterized Complexity Theory2006
- Finding k Disjoint Triangles in an Arbitrary GraphLecture Notes in Computer Science, 2004
- Parameterized Complexity1999
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Characterizations of derived graphsJournal of Combinatorial Theory, 1970