Circumventing connectivity for kernelization
From MaRDI portal
Publication:2692730
DOI10.1007/978-3-030-75242-2_21OpenAlexW3159594226MaRDI QIDQ2692730
Pallavi Jain, Roohani Sharma, Shivesh Kumar Roy, Saket Saurabh, Lawqueen Kanesh
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_21
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graph vertex partition for linear problem kernels
- Approximating the tree and tour covers of a graph
- On parameterized independent feedback vertex set
- FPT algorithms for connected feedback vertex set
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Revisiting connected vertex cover: FPT algorithms and lossy kernels
- Star routing: between vehicle routing and vertex cover
- A completeness theory for polynomial (Turing) kernelization
- Deterministic Parameterized Connected Vertex Cover
- Kernelization
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Kernelization Lower Bounds Through Colors and IDs
- Exploring the Kernelization Borders for Hitting Cycles
- Algorithms and Data Structures
- Parameterized Algorithms
This page was built for publication: Circumventing connectivity for kernelization
