On the parameterized complexity of cosecure domination

DOI10.1007/978-3-032-04700-7_21MaRDI QIDQ6852215zbMATH OpenFDO

Authors D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_21

zbMATH Keywords

cosecure dominationdominationfixed parameter tractabilitykernelizationmodular widthtree width

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A c^k n 5-approximation algorithm for treewidth
• Approximation algorithms for connected dominating sets
• Co-secure and secure domination in graphs
• Complexity results on cosecure domination in graphs
• Cosecure domination: hardness results and algorithms
• Domination in Graphs: Core Concepts
• Extremal problems for roman domination
• Fast algorithms for min independent dominating set
• Faster algorithms on branch and clique decompositions
• On approximating the minimum independent dominating set
• On the complexity of co-secure dominating set problem
• Parameterized algorithms
• Parameterized Algorithms for Modular-Width
• Parameterized complexity of dominating set variants in almost cluster and split graphs
• R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
• Some new algorithmic results on co-secure domination in graphs
• Structures of domination in graphs
• The algorithm and complexity of co-secure domination in geometric intersection graphs
• The co-secure domination in proper interval graphs
• Topics in Domination in Graphs
• Total domination in graphs

This page was built for publication: On the parameterized complexity of cosecure domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852215)