| Publication | Date of Publication | Type |
|---|
On circuit diameter bounds via circuit imbalances
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
On complete classes of valuated matroids
| 2024-07-19 | Paper |
Approximating equilibrium under constrained piecewise linear concave utilities with applications to matching markets
| 2024-07-19 | Paper |
On finding exact solutions of linear programs in the oracle model
| 2024-07-19 | Paper |
Directed shortest paths via approximate cost balancing
Journal of the ACM | 2024-07-04 | Paper |
Approximating Nash social welfare by matching and local search
| 2024-05-08 | Paper |
A Strongly Polynomial Algorithm for Linear Exchange Markets
Operations Research | 2024-03-12 | Paper |
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
Mathematics of Operations Research | 2024-03-01 | Paper |
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Directed shortest paths via approximate cost balancing
| 2024-01-15 | Paper |
Circuit Imbalance Measures and Linear Programming
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
Approximating Nash social welfare under rado valuations
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
An update-and-stabilize framework for the minimum-norm-point problem
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
On the correlation gap of matroids
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
An accelerated Newton-dinkelbach method and its application to two variables per inequality systems
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7650372 (Why is no real title available?)
| 2023-02-03 | Paper |
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
Journal of the ACM | 2022-12-08 | Paper |
On circuit diameter bounds via circuit imbalances
| 2022-08-16 | Paper |
Geometric rescaling algorithms for submodular function minimization
Mathematics of Operations Research | 2021-09-14 | Paper |
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A simpler and faster strongly polynomial algorithm for generalized flow maximization
Journal of the ACM | 2020-11-11 | Paper |
Rescaling algorithms for linear conic feasibility
Mathematics of Operations Research | 2020-09-01 | Paper |
On Submodular Search and Machine Scheduling
Mathematics of Operations Research | 2020-04-30 | Paper |
A strongly polynomial algorithm for linear exchange markets
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Approximating minimum cost connectivity orientation and augmentation
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Signed tropical convexity
| 2019-06-16 | Paper |
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Constant factor approximation for ATSP with two edge weights
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
A polynomial projection-type algorithm for linear programming
Operations Research Letters | 2018-08-27 | Paper |
Geometric rescaling algorithms for submodular function minimization
| 2018-03-15 | Paper |
Approximating Minimum Cost Connectivity Orientation and Augmentation
SIAM Journal on Computing | 2018-03-09 | Paper |
A 7/3-approximation for feedback vertex sets in tournaments
| 2018-03-02 | Paper |
A simpler and faster strongly polynomial algorithm for generalized flow maximization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
A strongly polynomial algorithm for generalized flow maximization
Mathematics of Operations Research | 2017-04-13 | Paper |
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
SIAM Journal on Computing | 2016-09-02 | Paper |
Rescaled coordinate descent methods for linear programming
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Constant factor approximation for ATSP with two edge weights (extended abstract)
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Algorithms for multiplayer multicommodity flow problems
CEJOR. Central European Journal of Operations Research | 2016-06-29 | Paper |
The cutting plane method is polynomial for perfect matchings
Mathematics of Operations Research | 2016-04-15 | Paper |
LP-based covering games with low price of anarchy
Theory of Computing Systems | 2015-09-04 | Paper |
A strongly polynomial algorithm for generalized flow maximization
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Oriented Euler complexes and signed perfect matchings
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
To save or not to save: the Fisher game
Web and Internet Economics | 2015-01-07 | Paper |
Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
SIAM Journal on Computing | 2014-11-14 | Paper |
Primal-dual approach for directed vertex connectivity augmentation and generalizations
| 2014-10-13 | Paper |
Augmenting undirected node-connectivity by one
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Concave generalized flows with applications to market equilibria
Mathematics of Operations Research | 2014-07-11 | Paper |
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
Automata, Languages, and Programming | 2013-08-06 | Paper |
The constructive characterization of \((k,l)\)-edge-connected digraphs
Combinatorica | 2011-12-20 | Paper |
Augmenting undirected node-connectivity by one
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
scientific article; zbMATH DE number 5888310 (Why is no real title available?)
| 2011-05-16 | Paper |
Restricted \(b\)-matchings in degree-bounded graphs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
An algorithm to increase the node-connectivity of a digraph by one
| 2009-03-30 | Paper |
An algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization | 2008-11-19 | Paper |
Nonadaptive Selfish Routing with Online Demands
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
