research
∙
07/19/2023
On the Tractability of Defensive Alliance Problem
Given a graph G = (V, E), a non-empty set S ⊆ V is a defensive alliance,...
share
research
∙
07/17/2023
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees
Given a graph G=(V, E), the problem of Graph Burning is to find a sequen...
research
∙
04/02/2022
Improved Approximation Algorithm for Graph Burning on Trees
Given a graph G=(V,E), the problem of is to find a sequence of nodes fr...
research
∙
08/20/2020
Faster Heuristics for Graph Burning
Graph burning is a process of information spreading through the network ...
research
∙
04/11/2018
Bipartitioning Problems on Graphs with Bounded Tree-Width
For an undirected graph G, we consider the following problems: given a f...
research
∙
02/10/2018
