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...
share
research
∙
07/03/2022
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
For many problems, the important instances from practice possess certain...
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
∙
08/29/2019
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
We consider the subgraph isomorphism problem where, given two graphs G (...
research
∙
07/18/2019
On the m-eternal Domination Number of Cactus Graphs
Given a graph G, guards are placed on vertices of G. Then vertices are s...
research
∙
01/11/2019