Parameterized complexity of minimum membership dominating set

DOI10.1007/978-3-030-96731-4_24OpenAlexW3207099282MaRDI QIDQ2154108

Vijayaragunathan Ramamoorthi, Pratibha Choudhary, N. S. Narayanaswamy, Akanksha Agrawal, K. K. Nisha

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2110.06656

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Parameterized complexity of minimum membership dominating set

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• 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
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
• On the parameterized complexity of \([1,j\)-domination problems]
• Minimum-weight triangulation is NP-hard
• Parameterized Algorithms
• Computing and Combinatorics

This page was built for publication: Parameterized complexity of minimum membership dominating set