3 citations · 11 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
Georgios Stamoulis
In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates. The Goemans-Linial SDP coupled with t…
cs.DS2026
Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
Georgios Stamoulis
We study the rainbow matching (RM) problem: given an edge-colored graph, find a maximum matching with at most one edge of each color. Rainbow matchings correspond to stable sets in…