research
∙
06/29/2023
An improved kernelization algorithm for Trivially Perfect Editing
In the Trivially Perfect Editing problem one is given an undirected grap...
share
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