| Publication | Date of Publication | Type |
|---|
| Multi-source multi-sink Nash flows over time | 2024-08-27 | Paper |
| Total completion time scheduling under scenarios | 2024-07-19 | Paper |
| A faster algorithm for quickest transshipments via an extended discrete Newton method | 2024-07-19 | Paper |
| Competitive strategies for symmetric rendezvous on the line | 2024-07-19 | Paper |
| Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size | 2024-03-22 | Paper |
| Reduction of Potential-Based Flow Networks | 2024-03-01 | Paper |
| A note on the quickest minimum cost transshipment problem | 2023-07-03 | Paper |
| Towards Lower Bounds on the Depth of ReLU Neural Networks | 2023-06-22 | Paper |
| On the robustness of potential-based flow networks | 2023-03-14 | Paper |
| Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds | 2022-10-14 | Paper |
| Packing Under Convex Quadratic Constraints | 2022-10-14 | Paper |
| Packing under convex quadratic constraints | 2022-03-22 | Paper |
| Single source unsplittable flows with arc-wise lower and upper bounds | 2022-03-22 | Paper |
| A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs | 2022-03-11 | Paper |
| Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria | 2021-12-20 | Paper |
| A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs | 2021-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304142 | 2020-08-05 | Paper |
| Robust Randomized Matchings | 2020-03-12 | Paper |
| Maximizing the storage capacity of gas networks: a global MINLP approach | 2019-10-29 | Paper |
| Paths to stable allocations | 2019-10-17 | Paper |
| Optimal Evacuation Solutions for Large-Scale Scenarios | 2019-09-13 | Paper |
| Algorithmic results for potential‐based flows: Easy and hard cases | 2019-07-30 | Paper |
| On the complexity of instationary gas flows | 2019-06-11 | Paper |
| The Simplex Algorithm Is NP-Mighty | 2019-03-28 | Paper |
| Stable flows over time | 2019-03-26 | Paper |
| Protection of flows under targeted attacks | 2019-02-21 | Paper |
| A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective | 2019-01-11 | Paper |
| A tight bound on the speed-up through storage for quickest multi-commodity flows | 2018-09-28 | Paper |
| Fast and Memory-Efficient Algorithms for Evacuation Problems | 2018-07-16 | Paper |
| Parallel repetition of MIP(2,1) systems | 2018-07-03 | Paper |
| An incremental algorithm for the uncapacitated facility location problem | 2018-06-13 | Paper |
| Graph orientation and flows over time | 2018-05-23 | Paper |
| A note on the ring loading problem | 2017-10-05 | Paper |
| The Simplex Algorithm Is NP-Mighty | 2017-10-05 | Paper |
| Robust randomized matchings | 2017-10-05 | Paper |
| On the Complexity of Instationary Gas Flows | 2017-08-29 | Paper |
| Randomization Helps Computing a Minimum Spanning Tree under Uncertainty | 2017-07-21 | Paper |
| On the size of weights in randomized search heuristics | 2017-07-14 | Paper |
| An Introduction to Network Flows over Time | 2017-04-07 | Paper |
| Stochastic Scheduling on Unrelated Machines | 2017-03-03 | Paper |
| A PTAS for minimizing the weighted sum of job completion times on parallel machines | 2016-09-29 | Paper |
| PolySCIP | 2016-09-28 | Paper |
| Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures | 2016-08-10 | Paper |
| Unrelated Machine Scheduling with Stochastic Processing Times | 2016-08-10 | Paper |
| The power of recourse for online MST and TSP | 2016-07-04 | Paper |
| A note on the ring loading problem | 2016-03-04 | Paper |
| Node-Balancing by Edge-Increments | 2015-11-19 | Paper |
| Randomization Helps Computing a Minimum Spanning Tree under Uncertainty | 2015-11-19 | Paper |
| Convex quadratic and semidefinite programming relaxations in scheduling | 2015-10-30 | Paper |
| Earliest arrival flows in networks with multiple sinks | 2015-09-22 | Paper |
| Graph Orientation and Flows over Time | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501828 | 2015-08-14 | Paper |
| Paths to Stable Allocations | 2015-01-14 | Paper |
| Latency-constrained aggregation in sensor networks | 2014-11-18 | Paper |
| Length-bounded cuts and flows | 2014-09-09 | Paper |
| The Power of Recourse for Online MST and TSP | 2013-08-12 | Paper |
| Maximum Multicommodity Flows over Time without Intermediate Storage | 2012-09-25 | Paper |
| Universal sequencing on an unreliable machine | 2012-09-12 | Paper |
| Generalized Maximum Flows over Time | 2012-07-16 | Paper |
| The power of preemption on unrelated machines and applications to scheduling orders | 2012-05-24 | Paper |
| Earliest arrival flows in networks with multiple sinks | 2012-05-13 | Paper |
| A note on the generalized min-sum set cover problem | 2012-04-05 | Paper |
| Nash equilibria and the price of anarchy for flows over time | 2011-11-23 | Paper |
| Continuous and discrete flows over time | 2011-08-16 | Paper |
| Earliest Arrival Flows with Multiple Sources | 2011-04-27 | Paper |
| Online Scheduling with Bounded Migration | 2011-04-27 | Paper |
| Computing minimum cuts by randomized search heuristics | 2011-03-30 | Paper |
| An FPTAS for Flows over Time with Aggregate Arc Capacities | 2011-02-15 | Paper |
| On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency | 2010-09-16 | Paper |
| Scheduling Periodic Tasks in a Hard Real-Time Environment | 2010-09-07 | Paper |
| Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods | 2010-09-06 | Paper |
| A Robust PTAS for Machine Covering and Packing | 2010-09-06 | Paper |
| Universal Sequencing on a Single Machine | 2010-06-22 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Packet Routing: Complexity and Algorithms | 2010-05-11 | Paper |
| Packet Routing on the Grid | 2010-04-27 | Paper |
| Evolutionary algorithms and matroid optimization problems | 2010-03-04 | Paper |
| Flows with unit path capacities and related packing and covering problems | 2009-12-02 | Paper |
| Nash Equilibria and the Price of Anarchy for Flows over Time | 2009-12-01 | Paper |
| Real-Time Message Routing and Scheduling | 2009-10-28 | Paper |
| The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders | 2009-10-28 | Paper |
| The complexity of economic equilibria for house allocation markets | 2009-07-09 | Paper |
| Traffic Networks and Flows over Time | 2009-07-09 | Paper |
| Single-source \(k\)-splittable min-cost flows | 2009-05-07 | Paper |
| Multiline addressing by network flow | 2009-05-06 | Paper |
| Length-Bounded Cuts and Flows | 2009-03-12 | Paper |
| Flows with Unit Path Capacities and Related Packing and Covering Problems | 2009-01-27 | Paper |
| Convex Combinations of Single Source Unsplittable Flows | 2008-09-25 | Paper |
| A short proof of the VPN tree routing conjecture on ring networks | 2008-09-10 | Paper |
| New Approaches for Virtual Private Network Design | 2008-06-19 | Paper |
| Maximum \(k\)-splittable \(s, t\)-flows | 2008-06-06 | Paper |
| List Scheduling in Order of α-Points on a Single Machine | 2008-03-14 | Paper |
| Multiline Addressing by Network Flow | 2008-03-11 | Paper |
| Latency Constrained Aggregation in Sensor Networks | 2008-03-11 | Paper |
| Quickest Flows Over Time | 2008-01-03 | Paper |
| Multicommodity flows over time: Efficient algorithms and complexity | 2007-07-16 | Paper |
| An FPTAS for quickest multicommodity flows with inflow-dependent transit times | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2006-11-06 | Paper |
| Flows on few paths: Algorithms and lower bounds | 2006-09-12 | Paper |
| The \(k\)-splittable flow problem | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5706101 | 2005-11-04 | Paper |
| Stochastic Machine Scheduling with Precedence Constraints | 2005-09-16 | Paper |
| Flows over Time with Load-Dependent Transit Times | 2005-09-16 | Paper |
| Approximating \(k\)-hop minimum-spanning trees | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Scheduling with AND/OR Precedence Constraints | 2005-02-21 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828930 | 2004-11-29 | Paper |
| Cooperative facility location games | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737515 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471275 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449191 | 2004-02-08 | Paper |
| Preemptive scheduling with rejection | 2003-10-29 | Paper |
| The power of \(\alpha\)-points in preemptive single machine scheduling. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411349 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411394 | 2003-07-08 | Paper |
| Scheduling Unrelated Machines by Randomized Rounding | 2003-01-05 | Paper |
| Approximating the single source unsplittable min-cost flow problem | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331306 | 2002-05-15 | Paper |
| Single machine scheduling with release dates | 2002-04-23 | Paper |
| Scheduling precedence-constrained jobs with stochastic processing times on parallel machines | 2002-03-24 | Paper |
| Approximation algorithms for the discrete time-cost tradeoff problem | 2001-11-26 | Paper |
| A PTAS for minimizing the total weighted completion time on identical parallel machines. | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753942 | 2001-11-11 | Paper |
| Approximation and randomization in scheduling | 2001-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938773 | 2000-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952622 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952603 | 2000-05-10 | Paper |
