research
∙
08/27/2023
Superpixels algorithms through network community detection
Community detection is a powerful tool from complex networks analysis th...
share
research
∙
06/29/2023
An improved kernelization algorithm for Trivially Perfect Editing
In the Trivially Perfect Editing problem one is given an undirected grap...
research
∙
06/30/2022
On graphs coverable by k shortest paths
We show that if the edges or vertices of an undirected graph G can be co...
research
∙
01/31/2022
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
We consider edge modification problems towards block and strictly chorda...
research
∙
05/18/2021
A cubic vertex-kernel for Trivially Perfect Editing
We consider the Trivially Perfect Editing problem, where one is given an...
research
∙
03/23/2020
On the complexity of Broadcast Domination and Multipacking in digraphs
We study the complexity of the two dual covering and packing distance-ba...
research
∙
11/10/2017