research
∙
07/05/2023
Exact and Parameterized Algorithms for the Independent Cutset Problem
The Independent Cutset problem asks whether there is a set of vertices i...
share
research
∙
01/19/2023
Vertex degrees close to the average degree
Let G be a finite, simple, and undirected graph of order n and average d...
research
∙
05/04/2021
FPT algorithms for packing k-safe spanning rooted sub(di)graphs
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...
research
∙
07/08/2020
Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree
We consider a non-monotone activation process (X_t)_t∈{ 0,1,2,…} on a gr...
research
∙
02/27/2020
Additive Tree O(ρlog n)-Spanners from Tree Breadth ρ
The tree breadth tb(G) of a connected graph G is the smallest non-negati...
research
∙
05/25/2018
On some tractable and hard instances for partial incentives and target set selection
A widely studied model for influence diffusion in social networks are t...
research
∙
02/12/2018
Dynamic monopolies for interval graphs with bounded thresholds
For a graph G and an integer-valued threshold function τ on its vertex s...
research
∙
11/30/2017
Approximating Connected Safe Sets in Weighted Trees
For a graph G and a non-negative integral weight function w on the verte...
research
∙
10/21/2017
