On the Parameterized Complexity of Clique Elimination Distance
From MaRDI portal
Publication:6068235
DOI10.4230/lipics.ipec.2020.1OpenAlexW3114248331MaRDI QIDQ6068235
Akanksha Agrawal, M. S. Ramanujan
Publication date: 13 November 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2020.1
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Distance from triviality 2.0: hybrid parameterizations ⋮ FPT algorithms to compute the elimination distance to bipartite graphs and more ⋮ Block elimination distance ⋮ Block elimination distance
Cites Work
- Unnamed Item
- Graph isomorphism parameterized by elimination distance to bounded degree
- Kernelization using structural parameters on sparse graph classes
- Finding odd cycle transversals.
- On generating all maximal independent sets
- Treewidth. Computations and approximations
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Fixed-parameter tractable distances to sparse graph classes
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Uniform Kernelization Complexity of Hitting Forbidden Minors
- Approximation and Kernelization for Chordal Vertex Deletion
- Combining Treewidth and Backdoors for CSP.
- On Tractable Parameterizations of Graph Isomorphism
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- Elimination Distance to Bounded Degree on Planar Graphs
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
- A Faster Parameterized Algorithm for Treedepth
- Parameterized and Exact Computation
- Algorithm Theory - SWAT 2004
- Solving d-SAT via Backdoors to Small Treewidth
- Meta-kernelization using Well-structured Modulators
- Multiplying matrices faster than coppersmith-winograd
- Parameterized Algorithms
- Elimination distances, blocking sets, and kernels for Vertex Cover
This page was built for publication: On the Parameterized Complexity of Clique Elimination Distance
