7 citations · 10 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
New Algorithms for Weighted -Domination and Total -Domination Problems in Proper Interval Graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni +2
Given a positive integer , a -dominating set in a graph is a set of vertices such that every vertex not in the set has at least neighbors in the set. A total -domi…
cs.DS2017
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
Nina Chiarelli, Tatiana R. Hartinger, Matthew Johnson +2
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Trans…