Circumventing connectivity for kernelization

DOI10.1007/978-3-030-75242-2_21MaRDI QIDQ2692730zbMATH OpenOpenAlexFDO

Authors Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma

Publication date 22 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-75242-2_21

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A 4k^2 kernel for feedback vertex set
• A completeness theory for polynomial (Turing) kernelization
• Algorithms and Data Structures
• An approximate kernel for connected feedback vertex set
• Approximating the tree and tour covers of a graph
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Deterministic parameterized connected vertex cover
• Exploring the kernelization borders for hitting cycles
• FPT algorithms for connected feedback vertex set
• Kernelization lower bounds through colors and IDs
• Kernelization. Theory of parameterized preprocessing
• Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
• On parameterized independent feedback vertex set
• Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
• Parameterized algorithms
• Planar graph vertex partition for linear problem kernels
• Revisiting connected vertex cover: FPT algorithms and lossy kernels
• Star routing: between vehicle routing and vertex cover

Cited in

(1)

• Sparsity in covering solutions

This page was built for publication: Circumventing connectivity for kernelization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692730)