Parameterized Dynamic Variants of Red-Blue Dominating Set

DOI10.1007/978-3-030-38919-2_20zbMath1440.68134OpenAlexW3000163424MaRDI QIDQ3297772

Henning Fernau, Faisal N. Abu-Khzam, Cristina Bazgan

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.psl.eu/handle/123456789/22263

zbMATH Keywords

dynamic problemsset coverparameterized complexityreoptimizationhitting set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• On the parameterized complexity of dynamic problems
• Computing small partial coverings
• The Turing way to parameterized complexity
• Reoptimization of set covering problems
• Parameterizations of hitting set of bundles and inverse scope
• Capacitated domination: problem complexity and approximation algorithms
• Integer Programming with a Fixed Number of Variables
• Capacitated Domination and Covering: A Parameterized Perspective
• Reoptimization of Weighted Graph and Covering Problems
• Planar Capacitated Dominating Set Is W[1-Hard]
• The Parameterized Complexity of the k -Biclique Problem
• Improved Approximation Guarantees for Packing and Covering Integer Programs
• LIMITS and Applications of Group Algebras for Parameterized Problems
• On Problems as Hard as CNF-SAT
• Dynamic Parameterized Problems and Algorithms
• A survey on alliances and related parameters in graphs
• The Parameterized Complexity of k-B<scp>iclique</scp>
• Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
• On the Hardness of Reoptimization

This page was built for publication: Parameterized Dynamic Variants of Red-Blue Dominating Set