3 papers
cs.DM2026
Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments
Boyue Lin, Phablo F. S. Moura, Roel Leus
A vertex coloring of a graph is convex if the vertices of each color induce a connected subgraph. In the convex recoloring problem (CR), the goal is to find a convex coloring while…
math.CO2025
On the connected (sub)partition polytope
Phablo F. S. Moura, Hande Yaman, Roel Leus
Let be a positive integer and let be a graph with vertices. A connected -subpartition of is a collection of pairwise disjoint sets (a.k.a. classes) of vertic…
cs.DM2025
Compact formulations and valid inequalities for parallel machine scheduling with conflicts
Phablo F. S. Moura, Roel Leus, Hande Yaman
The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same m…