On the Parameterized Complexity of [1,j]-Domination Problems
From MaRDI portal
Publication:5090974
DOI10.4230/LIPIcs.FSTTCS.2018.34OpenAlexW2935770235MaRDI QIDQ5090974
Fahad Panolan, Amer E. Mouawad, Fedor V. Fomin, Meybodi Mohsen Alambardar
Publication date: 21 July 2022
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/9933/pdf/LIPIcs-FSTTCS-2018-34.pdf
parameterized complexitysparse graphs\([1,j\)-dominating set]
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \((1, j)\)-set problem in graphs
- \([1,2\)-domination in graphs]
- Sparsity. Graphs, structures, and algorithms
- Mixed searching and proper-path-width
- \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms]
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- On the parameterized complexity of multiple-interval graph problems
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- On nowhere dense graphs
- \([1,2\)-sets in graphs]
- FPT Algorithms for Domination in Biclique-Free Graphs
- Domination Problems in Nowhere-Dense Classes
- Lossy Kernels for Connected Dominating Set on Sparse Graphs
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Deciding First-Order Properties of Nowhere Dense Graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- First order properties on nowhere dense structures
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
This page was built for publication: On the Parameterized Complexity of [1,j]-Domination Problems
