Chordless Cycle Packing Is Fixed-Parameter Tractable
From MaRDI portal
Publication:5874543
DOI10.4230/LIPICS.ESA.2020.71OpenAlexW3082731272MaRDI QIDQ5874543FDOQ5874543
Authors: Dániel Marx 
Publication date: 7 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12937/pdf/LIPIcs-ESA-2020-71.pdf/
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Automated generation of search tree algorithms for hard graphs modification problems
- Title not available (Why is that?)
- Finding odd cycle transversals.
- The node-deletion problem for hereditary properties is NP-complete
- A \(4k^2\) kernel for feedback vertex set
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Parameterized algorithms
- Mangoes and blueberries
- Odd cycle packing
- Title not available (Why is that?)
- On Independent Circuits Contained in a Graph
- Node-Deletion Problems on Bipartite Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Chordal editing is fixed-parameter tractable
- Chordal deletion is fixed-parameter tractable
- Packing cycles through prescribed vertices
- Packing directed circuits
- Kernel bounds for path and cycle problems
- Edge-Deletion Problems
- Disjoint cycles intersecting a set of vertices
- Erdős-Pósa property of chordless cycles and its applications
- Approximation and kernelization for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3--5, 2015. Proceedings
- The Graph Minor Algorithm with Parity Conditions
- On the parameterized complexity of graph modification to first-order logic properties
This page was built for publication: Chordless Cycle Packing Is Fixed-Parameter Tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874543)
