Exploring the Kernelization Borders for Hitting Cycles
From MaRDI portal
Publication:5009476
DOI10.4230/LIPIcs.IPEC.2018.14OpenAlexW2920720604MaRDI QIDQ5009476
Saket Saurabh, Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2018.14
feedback vertex setparameterized complexitykernelizationodd cycle transversaleven cycle transversalconflict-free problems
Related Items (4)
Parameterized complexity of conflict-free matchings and paths ⋮ On the computational complexity of the bipartizing matching problem ⋮ Circumventing connectivity for kernelization ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum flow problem with disjunctive constraints
- Online variable-sized bin packing with conflicts
- Paths, trees and matchings under disjunctive constraints
- On parameterized independent feedback vertex set
- Finding odd cycle transversals.
- Scheduling with conflicts: Online and offline algorithms
- Approximation of knapsack problems with conflict and forcing graphs
- The Maximum Flow Problem with Conflict and Forcing Conditions
- Choice Is Hard
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- A Cubic Kernel for Feedback Vertex Set
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Smallest-last ordering and clustering and graph coloring algorithms
- Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
- Polynomially bounded minimization problems which are hard to approximate
- Fréchet Distance Between a Line and Avatar Point Set
- Compression via Matroids
- Kernelization Lower Bounds by Cross-Composition
- Parameterized Algorithms for Even Cycle Transversal
- Parameterized Algorithms
- Conflict free version of covering problems on graphs: classical and parameterized
This page was built for publication: Exploring the Kernelization Borders for Hitting Cycles
