| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4633882 | 2019-05-06 | Paper |
| All-or-nothing generalized assignment with application to scheduling advertising campaigns | 2018-11-05 | Paper |
| A simple and efficient algorithm for computing market equilibria | 2018-11-05 | Paper |
| Approximation algorithms for movement repairmen | 2018-11-05 | Paper |
| Bicovering: covering edges with two small subsets of vertices | 2017-12-19 | Paper |
| Bi-covering: covering edges with two small subsets of vertices | 2017-12-11 | Paper |
| A tight algorithm for strongly connected Steiner subgraph on two terminals with demands | 2017-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957491 | 2017-01-26 | Paper |
| On fixed cost \(k\)-flow problems | 2016-03-21 | Paper |
| Real-time scheduling to minimize machine busy times | 2016-01-22 | Paper |
| Graph partitioning using single commodity flows | 2015-11-11 | Paper |
| A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) | 2015-09-15 | Paper |
| A logarithmic approximation for unsplittable flow on line graphs | 2015-08-14 | Paper |
| Local search heuristic for k-median and facility location problems | 2015-02-27 | Paper |
| On a local protocol for concurrent file transfers | 2015-01-19 | Paper |
| Distributed algorithms for multicommodity flow problems via approximate steepest descent framework | 2014-12-18 | Paper |
| Stateless distributed algorithms for near optimal maximum multicommodity flows | 2014-12-12 | Paper |
| Distributed algorithms for multicommodity flow problems via approximate steepest descent framework | 2014-12-05 | Paper |
| Prize-collecting steiner network problems | 2014-12-05 | Paper |
| Graph partitioning using single commodity flows | 2014-11-25 | Paper |
| On the advantage of overlapping clusters for minimizing conductance | 2014-11-19 | Paper |
| Improved approximation for universal facility location | 2014-10-13 | Paper |
| On fixed cost \(k\)-flow problems | 2014-09-02 | Paper |
| On cost sharing mechanisms in the network design game | 2014-03-13 | Paper |
| Greedy distributed optimization of multi-commodity flows | 2014-03-13 | Paper |
| Distributed network monitoring and multicommodity flows, a primal-dual approach | 2014-03-13 | Paper |
| Minimizing the total cost of network measurements in a distributed manner, a primal-dual approach | 2014-03-13 | Paper |
| On generalizations of network design problems with degree bounds | 2013-11-11 | Paper |
| Approximation algorithms for movement repairmen | 2013-10-04 | Paper |
| On some network design problems with degree constraints | 2013-07-24 | Paper |
| Greedy distributed optimization of multi-commodity flows | 2013-06-28 | Paper |
| All-or-nothing generalized assignment with application to scheduling advertising campaigns | 2013-03-19 | Paper |
| Two-stage robust network design with exponential scenarios | 2013-03-05 | Paper |
| Local search algorithms for the red-blue median problem | 2012-12-06 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-10-24 | Paper |
| Bounded size graph clustering with applications to stream processing | 2012-10-24 | Paper |
| The checkpoint problem | 2012-10-11 | Paper |
| Minimizing busy time in multiple machine real-time scheduling | 2012-08-29 | Paper |
| Advantage of Overlapping Clusters for Minimizing Conductance | 2012-06-29 | Paper |
| Approximating fault-tolerant group-Steiner problems | 2012-03-13 | Paper |
| Network-design with degree constraints | 2011-08-17 | Paper |
| The checkpoint problem | 2010-09-10 | Paper |
| Budgeted red-blue median and its generalizations | 2010-09-06 | Paper |
| Additive guarantees for degree-bounded directed network design | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579479 | 2010-08-06 | Paper |
| On generalizations of network design problems with degree bounds | 2010-06-22 | Paper |
| Prize-collecting Steiner network problems | 2010-06-22 | Paper |
| Bandwidth maximization in multicasting | 2010-03-03 | Paper |
| Online and offline algorithms for the sorting buffers problem on the line metric | 2010-02-26 | Paper |
| Stateless distributed gradient descent for positive linear programs | 2010-01-06 | Paper |
| On Hardness of Pricing Items for Single-Minded Bidders | 2009-10-28 | Paper |
| On the integrality ratio for tree augmentation | 2009-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302102 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302094 | 2009-01-05 | Paper |
| Two-Stage Robust Network Design with Exponential Scenarios | 2008-11-25 | Paper |
| Offline Sorting Buffers on Line | 2008-04-24 | Paper |
| Stateless Near Optimal Flow Control with Poly-logarithmic Convergence | 2008-04-15 | Paper |
| Online Sorting Buffers on Line | 2008-03-19 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Local Search Heuristics for k-Median and Facility Location Problems | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537744 | 2002-06-20 | Paper |
