On the Parameterized Complexity of [1,j]-Domination Problems
From MaRDI portal
Publication:5090974
DOI10.4230/LIPICS.FSTTCS.2018.34OpenAlexW2935770235MaRDI QIDQ5090974FDOQ5090974
Authors: Meybodi Mohsen Alambardar, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan 
Publication date: 21 July 2022
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/9933/pdf/LIPIcs-FSTTCS-2018-34.pdf
sparse graphsparameterized complexity\([1,j\)-dominating set]
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized algorithms
- Deciding first-order properties of nowhere dense graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Sparsity. Graphs, structures, and algorithms
- On the parameterized complexity of multiple-interval graph problems
- \([1,2]\)-sets in graphs
- \((1, j)\)-set problem in graphs
- \([1,2]\)-domination in graphs
- Domination problems in nowhere-dense classes of graphs
- On nowhere dense graphs
- First order properties on nowhere dense structures
- Title not available (Why is that?)
- Mixed searching and proper-path-width
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Lossy kernels for connected dominating set on sparse graphs
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- FPT algorithms for domination in biclique-free graphs
Cited In (2)
This page was built for publication: On the Parameterized Complexity of [1,j]-Domination Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090974)
