research
∙
08/14/2023
Approximations for the Steiner Multicycle Problem
The Steiner Multicycle problem consists of, given a complete graph, a we...
share
research
∙
08/23/2021
Approximation and parameterized algorithms to find balanced connected partitions of graphs
Partitioning a connected graph into k vertex-disjoint connected subgraph...
research
∙
11/25/2019
Polyhedral study of the Convex Recoloring problem
A coloring of the vertices of a connected graph is convex if each color ...
research
∙
11/13/2019
