| Publication | Date of Publication | Type |
|---|
| Data Center Scheduling, Generalized Flows, and Submodularity | 2019-09-16 | Paper |
| Preference-constrained oriented matching | 2019-09-16 | Paper |
| Online Mixed Packing and Covering | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633887 | 2019-05-06 | Paper |
| Separating maximally violated comb inequalities in planar graphs | 2019-01-11 | Paper |
| A Simple and Efficient Algorithm for Computing Market Equilibria | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365037 | 2017-09-29 | Paper |
| On the Uniqueness of Equilibrium in Atomic Splittable Routing Games | 2015-11-04 | Paper |
| A Stackelberg strategy for routing flow over time | 2015-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501364 | 2015-08-03 | Paper |
| Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree | 2014-11-25 | Paper |
| Ordering by weighted number of wins gives a good ranking for weighted tournaments | 2014-11-18 | Paper |
| A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions | 2014-09-26 | Paper |
| Improved algorithms for submodular function minimization and submodular flow | 2014-09-26 | Paper |
| When the cut condition is enough | 2014-05-13 | Paper |
| Tight Approximation Algorithms for Maximum Separable Assignment Problems | 2012-05-24 | Paper |
| Submodular Approximation: Sampling-based Algorithms and Lower Bounds | 2012-03-15 | Paper |
| Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999659 | 2011-05-16 | Paper |
| Strict Cost Sharing Schemes for Steiner Forest | 2011-04-04 | Paper |
| Tight approximation algorithms for maximum general assignment problems | 2010-08-16 | Paper |
| Ordering by weighted number of wins gives a good ranking for weighted tournaments | 2010-08-16 | Paper |
| The Price of Collusion in Series-Parallel Networks | 2010-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549715 | 2009-01-05 | Paper |
| Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions | 2008-05-27 | Paper |
| Polynomial-Time Separation of a Superclass of Simple Comb Inequalities | 2008-05-27 | Paper |
| Prompt Mechanisms for Online Auctions | 2008-05-02 | Paper |
| A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions | 2008-02-11 | Paper |
| Quickest Flows Over Time | 2008-01-03 | Paper |
| Linear tolls suffice: new bounds and algorithms for tolls in single source networks | 2006-01-09 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737515 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471274 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471275 | 2004-07-28 | Paper |
| A push-relabel framework for submodular function minimization and applications to parametric optimization | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537740 | 2002-06-20 | Paper |
| Universally maximum flow with piecewise-constant capacities | 2002-04-22 | Paper |
| A faster capacity scaling algorithm for minimum cost submodular flow | 2002-01-01 | Paper |
| Fast and simple approximation schemes for generalized flow. | 2002-01-01 | Paper |
| Separating Maximally Violated Comb Inequalities in Planar Graphs | 2001-11-26 | Paper |
| Faster Algorithms for the Quickest Transshipment Problem | 2001-06-21 | Paper |
| Approximating Fractional Multicommodity Flow Independent of the Number of Commodities | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761871 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263709 | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952606 | 2000-10-23 | Paper |
| Optimal Rounding of Instantaneous Fractional Flows Over Time | 2000-07-20 | Paper |
| Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time | 2000-05-28 | Paper |
| Efficient continuous-time dynamic network flow algorithms | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252441 | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840367 | 1998-08-10 | Paper |
