| Publication | Date of Publication | Type |
|---|
Preference-constrained oriented matching
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Data Center Scheduling, Generalized Flows, and Submodularity
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Online Mixed Packing and Covering
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| scientific article; zbMATH DE number 7051244 (Why is no real title available?) | 2019-05-06 | Paper |
Separating maximally violated comb inequalities in planar graphs
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A simple and efficient algorithm for computing market equilibria
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| scientific article; zbMATH DE number 6783389 (Why is no real title available?) | 2017-09-29 | Paper |
On the uniqueness of equilibrium in atomic splittable routing games
Mathematics of Operations Research | 2015-11-04 | Paper |
A Stackelberg strategy for routing flow over time
Games and Economic Behavior | 2015-08-12 | Paper |
| A fast approximation scheme for fractional covering problems with variable upper bounds | 2015-08-03 | Paper |
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Ordering by weighted number of wins gives a good ranking for weighted tournaments
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Improved algorithms for submodular function minimization and submodular flow
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Tight approximation algorithms for maximum separable assignment problems
Mathematics of Operations Research | 2012-05-24 | Paper |
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing | 2012-03-15 | Paper |
Lower bound for envy-free and truthful makespan approximation on related machines
Algorithmic Game Theory | 2011-10-28 | Paper |
| Algorithms and lower bounds for submodular cuts and approximating submodular functions | 2011-05-16 | Paper |
Strict cost sharing schemes for Steiner forest
SIAM Journal on Computing | 2011-04-04 | Paper |
Tight approximation algorithms for maximum general assignment problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Ordering by weighted number of wins gives a good ranking for weighted tournaments
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The price of collusion in series-parallel networks
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
| scientific article; zbMATH DE number 5485543 (Why is no real title available?) | 2009-01-05 | Paper |
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
Mathematics of Operations Research | 2008-05-27 | Paper |
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research | 2008-05-27 | Paper |
Prompt Mechanisms for Online Auctions
Algorithmic Game Theory | 2008-05-02 | Paper |
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM | 2008-02-11 | Paper |
Quickest Flows Over Time
SIAM Journal on Computing | 2008-01-03 | Paper |
Linear tolls suffice: new bounds and algorithms for tolls in single source networks
Theoretical Computer Science | 2006-01-09 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2086912 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079322 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079321 (Why is no real title available?) | 2004-07-28 | Paper |
A push-relabel framework for submodular function minimization and applications to parametric optimization
Discrete Applied Mathematics | 2003-10-14 | Paper |
| scientific article; zbMATH DE number 1757952 (Why is no real title available?) | 2002-06-20 | Paper |
Universally maximum flow with piecewise-constant capacities
Networks | 2002-04-22 | Paper |
A faster capacity scaling algorithm for minimum cost submodular flow
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Fast and simple approximation schemes for generalized flow.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Separating maximally violated comb inequalities in planar graphs
Mathematics of Operations Research | 2001-11-26 | Paper |
Faster algorithms for the quickest transshipment problem
SIAM Journal on Optimization | 2001-06-21 | Paper |
Approximating fractional multicommodity flow independent of the number of commodities
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1568067 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1342127 (Why is no real title available?) | 2000-11-27 | Paper |
| scientific article; zbMATH DE number 1445293 (Why is no real title available?) | 2000-10-23 | Paper |
Optimal Rounding of Instantaneous Fractional Flows Over Time
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
Journal of Algorithms | 2000-05-28 | Paper |
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1305549 (Why is no real title available?) | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1187160 (Why is no real title available?) | 1998-08-10 | Paper |
