Parameterized complexity of minimum membership dominating set

DOI10.1007/s00453-023-01139-7arXiv2110.06656OpenAlexW4380488849MaRDI QIDQ6090540

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

Publication date: 17 November 2023

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

dominating setsplit graphspathwidthplanar bipartite graphsFPTvertex cover number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• On perfect codes in Cartesian products of graphs
• 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
• Perfect codes over graphs
• Perfect Code is \(W[1\)-complete]
• Minimum membership hitting sets of axis parallel segments
• Parameterized complexity of minimum membership dominating set
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
• On the parameterized complexity of \([1,j\)-domination problems]
• \([1,2\)-sets in graphs]
• Perfect codes in graphs
• Minimum-weight triangulation is NP-hard
• Perfect Codes in Cayley Graphs
• Parameterized Algorithms
• Computing and Combinatorics
• Minimum Membership Set Covering and the Consecutive Ones Property
• Minimum membership covering and hitting

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