research
∙
03/20/2023
An Improved Exact Algorithm for Knot-Free Vertex Deletion
A knot K in a directed graph D is a strongly connected component of size...
share
research
∙
08/06/2022
Parameterized Algorithms for Locally Minimal Defensive Alliance
A set D of vertices of a graph is a defensive alliance if, for each elem...
research
∙
08/05/2022
Offensive Alliances in Graphs
A set S⊆ V of vertices is an offensive alliance in an undirected graph G...
research
∙
08/04/2022
Parameterized Complexity of Upper Edge Domination
In this paper we study a maximization version of the classical Edge Domi...
research
∙
08/03/2022
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective
In this paper we study a maximization version of the classical Feedback ...
research
∙
02/04/2022
Globally Minimal Defensive Alliances: A Parameterized Perspective
A defensive alliance in an undirected graph G=(V,E) is a non-empty set o...
research
∙
11/11/2021
The Harmless Set Problem
Given a graph G = (V,E), a threshold function t : V →ℕ and an integer ...
research
∙
11/10/2021
Defensive Alliances in Graphs
A set S of vertices of a graph is a defensive alliance if, for each elem...
research
∙
10/29/2021
On Structural Parameterizations of the Offensive Alliance Problem
The Offensive Alliance problem has been studied extensively during the l...
research
∙
05/22/2021
Parameterized Complexity of Locally Minimal Defensive Alliances
The Defensive Alliance problem has been studied extensively during the l...
research
∙
02/11/2021
Edge Deletion to Restrict the Size of an Epidemic
Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱ-Free E...
research
∙
07/28/2020