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