research
∙
07/20/2023
Shortest Dominating Set Reconfiguration under Token Sliding
In this paper, we present novel algorithms that efficiently compute a sh...
share
research
∙
01/12/2023
Computing m-Eternal Domination Number of Cactus Graphs in Linear Time
In m-eternal domination attacker and defender play on a graph. Initially...
research
∙
04/06/2022
Efficient attack sequences in m-eternal domination
We study the m-eternal domination problem from the perspective of the at...
research
∙
02/24/2022
Polynomial Kernels for Tracking Shortest Paths
Given an undirected graph G=(V,E), vertices s,t∈ V, and an integer k, Tr...
research
∙
08/03/2021
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
Consider a vertex-weighted graph G with a source s and a target t. Track...
research
∙
07/18/2019