Structural parameterizations with modulator oblivion
From MaRDI portal
Publication:2161010
Recommendations
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A simple linear time algorithm for cograph recognition
- Algorithm Theory - SWAT 2004
- Algorithmic graph theory and perfect graphs
- Approximation and kernelization for chordal vertex deletion
- Backdoors to satisfaction
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- Chordal editing is fixed-parameter tractable
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Dominating Sets in Chordal Graphs
- Efficient graph representations
- Erdős-Pósa property of chordless cycles and its applications
- Faster parameterized algorithms using linear programming
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- Graph theory
- scientific article; zbMATH DE number 1839471 (Why is no real title available?)
- Large Induced Subgraphs via Triangulations and CMSO
- On diameters and radii of bridged graphs
- On problems as hard as CNF-SAT
- Parameterized algorithms
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Robust algorithms for restricted domains
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Structural parameterizations with modulator oblivion
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
- The complexity of generalized clique covering
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Unit disk graph recognition is NP-hard
- Unit disk graphs
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
Cited in
(6)- ArbiLoMod, a Simulation Technique Designed for Arbitrary Local Modifications
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Structural parameterizations with modulator oblivion
- Treewidth versus clique number. II: Tree-independence number
- Computing tree decompositions with small independence number
- Towards exact structural thresholds for parameterized complexity
This page was built for publication: Structural parameterizations with modulator oblivion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2161010)
