Sparsity in covering solutions
From MaRDI portal
Publication:6547950
DOI10.1007/978-3-031-55601-2_9MaRDI QIDQ6547950FDOQ6547950
Authors: Pallavi Jain, Manveer Singh Rathore 
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)
Cites Work
- A 4 k 2 kernel for feedback vertex set
- Title not available (Why is that?)
- Parameterized Algorithms
- On parameterized independent feedback vertex set
- Independent domination in graphs: A survey and recent results
- Faster deterministic \textsc{Feedback Vertex Set}
- Partition the vertices of a graph into one independent set and one acyclic set
- A Note on the Vertex Arboricity of a Graph
- Title not available (Why is that?)
- Independent feedback vertex sets for graphs of bounded diameter
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- An improved FPT algorithm for independent feedback vertex set
- Conflict free version of covering problems on graphs: classical and parameterized
- On the vertex arboricity of planar graphs of diameter two
- Title not available (Why is that?)
- Independent feedback vertex set for \(P_5\)-free graphs
- Parameterized complexity of conflict-free matchings and paths
- Independent domination in outerplanar graphs
- Vertex Partitions into an Independent Set and a Forest with Each Component Small
- Title not available (Why is that?)
- Parameterized complexity of conflict-free set cover
- Circumventing connectivity for kernelization
- Parameterized complexity of geometric covering problems having conflicts
This page was built for publication: Sparsity in covering solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547950)
