research
∙
11/22/2022
Choose your witnesses wisely
This paper addresses a graph optimization problem, called the Witness Tr...
share
research
∙
11/22/2022
Stabilization of Capacitated Matching Games
An edge-weighted, vertex-capacitated graph G is called stable if the val...
research
∙
08/04/2021
Node Connectivity Augmentation via Iterative Randomized Rounding
Many network design problems deal with the design of low-cost networks t...
research
∙
03/23/2020
On the diameter of the polytope of the stable marriage with ties
The stable marriage problem with ties is a well-studied and interesting ...
research
∙
09/27/2019
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
Circuit-augmentation algorithms are a generalization of the Simplex meth...
research
∙
06/06/2019
An Efficient Characterization of Submodular Spanning Tree Games
Cooperative games are an important class of problems in game theory, whe...
research
∙
05/14/2018
On the approximability of the stable marriage problem with one-sided ties
The classical stable marriage problem asks for a matching between a set ...
research
∙
09/06/2017
