2 papers
cs.DS2019
Faster Algorithms for Parametric Global Minimum Cut Problems
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
The parametric global minimum cut problem concerns a graph where the cost of each edge is an affine function of a parameter for some fixed dimension…
math.CO2015
Largest minimal inversion-complete and pair-complete sets of permutations
Eric Balandraud, Maurice Queyranne, Fabio Tardella
We solve two related extremal problems in the theory of permutations. A set of permutations of the integers 1 to is inversion-complete (resp., pair-complete) if for every i…