Structural parameterizations with modulator oblivion
From MaRDI portal
Publication:2161010
DOI10.1007/s00453-022-00971-7OpenAlexW3007257280MaRDI QIDQ2161010
Fahad Panolan, Vibha Sahlot, Ashwin Jacob, Venkatesh Raman
Publication date: 3 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.09972
Related Items (2)
Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ Treewidth versus clique number. II: Tree-independence number
Cites Work
- Chordal editing is fixed-parameter tractable
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Fundamentals of parameterized complexity
- Parameterized complexity of vertex deletion into perfect graph classes
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- On diameters and radii of bridged graphs
- Unit disk graphs
- The complexity of generalized clique covering
- Unit disk graph recognition is NP-hard
- Efficient graph representations
- A simple linear time algorithm for cograph recognition
- Algorithmic graph theory and perfect graphs
- Graph minors. XIII: The disjoint paths problem
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Erdős-Pósa property of chordless cycles and its applications
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- On Multiway Cut Parameterized above Lower Bounds
- Backdoors to Satisfaction
- Large Induced Subgraphs via Triangulations and CMSO
- Dominating Sets in Chordal Graphs
- Robust algorithms for restricted domains
- Approximation and Kernelization for Chordal Vertex Deletion
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
- Faster Parameterized Algorithms Using Linear Programming
- On Problems as Hard as CNF-SAT
- Algorithm Theory - SWAT 2004
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Structural parameterizations with modulator oblivion
