Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm

Preprint available.

A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem

Published at Math Prog

Combinatorial and geometric dualities in graph homomorphism optimization problems

M.Sc. in Computer Science dissertation, available at USP digital library

Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming

Published at SIDMA

Sampling Spanning Trees: Theory and Algorithms

Undergraduate monograph; download it here