Two Edge Modification Problems without Polynomial Kernels (Q3656868): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1553479936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13--15, 2006. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and data structures. 10th international workshop, WADS 2007, Halifax, Canada, August 15--17, 2007. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FPT-Algorithms for Cleaning Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Complexity Results for Connectivity Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:37, 2 July 2024

scientific article
Language Label Description Also known as
English
Two Edge Modification Problems without Polynomial Kernels
scientific article

    Statements

    Two Edge Modification Problems without Polynomial Kernels (English)
    0 references
    0 references
    0 references
    14 January 2010
    0 references

    Identifiers