The parameterized complexity of cycle packing: indifference is not an issue
type: Item
instance of: scholarly article
title: The parameterized complexity of cycle packing: indifference is not an issue
zbMATH Open document ID: 1429.68195
author: R. Krithika
author: Abhishek Sahu
author: Saket Saurabh
author: Meirav Zehavi
published in: Algorithmica
publication date: 2019-08-20T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7096148
zbMATH Keywords: cycle packing
zbMATH Keywords: proper interval deletion set
zbMATH Keywords: fixed-parameter tractable
MaRDI profile type: Publication
full work available at URL: s00453-019-00599-0
OpenAlex ID: W3022547913
cites work: Color-coding
cites work: ON DISJOINT CYCLES
cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
cites work: Kernel bounds for path and cycle problems
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Parameterized complexity of vertex colouring
cites work: Unit interval editing is fixed-parameter tractable
cites work: Interval Deletion Is Fixed-Parameter Tractable
cites work: Parameterized Algorithms
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Q3374865
cites work: Fundamentals of parameterized complexity
cites work: On Independent Circuits Contained in a Graph
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: The complexity ecology of parameters: An illustration using bounded max leaf number
cites work: Parametrized complexity theory.
cites work: A Polynomial Kernel for Proper Interval Vertex Deletion
cites work: Algorithmic graph theory and perfect graphs
cites work: The \(K_r\)-packing problem
cites work: Vertex cover problem parameterized above and below tight bounds
cites work: Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
cites work: Unit interval vertex deletion: fewer vertices are relevant
cites work: Packing Cycles Faster Than Erdos-Posa
cites work: Faster Parameterized Algorithms Using Linear Programming
cites work: Lossy kernelization
cites work: Optimal greedy algorithms for indifference graphs
cites work: Packing triangles in low degree graphs and indifference graphs
cites work: Topics in Intersection Graph Theory
cites work: Q4231923
cites work: Measuring Indifference: Unit Interval Vertex Deletion
cites work: Proper interval vertex deletion
cites work: Q5588432
cites work: Q3942992
cites work: Graph minors. XIII: The disjoint paths problem
DOI: 10.1007/S00453-019-00599-0
description: scientific article; zbMATH DE number 7096148