2 citations · 4 across the 2 of their papers we have counts for
1 paper · 1 filter
Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas +1
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algori…