Showing 1–20 of 32 results
/ Date/ Name
Sep 27, 2019Pivot Rules for Circuit-Augmentation Algorithms in Linear OptimizationDec 15, 2010Set Covering with Ordered Replacement -- Additive and Multiplicative GapsJun 9, 2018The diameter of the fractional matching polytope and its hardness implicationsMar 23, 2020On the diameter of the polytope of the stable marriage with tiesNov 28, 2021On the Simplex method for 0/1 polytopesAug 4, 2021Node Connectivity Augmentation via Iterative Randomized RoundingSep 27, 2017On the Circuit Diameter of some Combinatorial PolytopesNov 28, 2024A Note on the Core of 2-Matching GamesNov 16, 2023Capacitated Network Bargaining Games: Stability and StructureJun 2, 2025Two-stage Stochastic Assignment GamesDec 12, 2008The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract)Nov 22, 2022Stabilization of Capacitated Matching GamesNov 22, 2022Finding Almost Tight Witness TreesNov 28, 2023Node Connectivity Augmentation of Highly Connected GraphsJul 8, 2025Learning-Augmented Online Covering ProblemsNov 27, 2023On the Number of Degenerate Simplex PivotsMay 14, 2018On the approximability of the stable marriage problem with one-sided tiesJul 21, 2009The interval constrained 3-coloring problemFeb 8, 2013An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner TreeOct 19, 2014Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems