| Publication | Date of Publication | Type |
|---|
| An FPTAS for scheduling with resource constraints | 2023-09-12 | Paper |
| An improved approximation algorithm for scheduling monotonic moldable tasks | 2023-07-03 | Paper |
| Bounding Residence Times for Atomic Dynamic Routings | 2023-01-09 | Paper |
| Atomic congestion games with random players: network equilibrium and the price of anarchy | 2022-10-04 | Paper |
| Capacity Games with Supply Function Competition | 2022-09-19 | Paper |
| Optimizing voting order on sequential juries: a median voter theorem and beyond | 2022-04-13 | Paper |
| Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents | 2022-02-16 | Paper |
| Scheduling coupled tasks with exact delays for minimum total job completion time | 2021-12-13 | Paper |
| Rawlsian fairness in push and pull supply chains | 2021-06-04 | Paper |
| Incentive schemes for resolving Parkinson's law in project management | 2021-06-03 | Paper |
| A functional equation of tail-balance for continuous signals in the Condorcet jury theorem | 2021-02-15 | Paper |
| Price of fairness in two-agent single-machine scheduling problems | 2019-02-25 | Paper |
| Scheduling with time-of-use costs | 2019-01-09 | Paper |
| Vehicle routing with probabilistic capacity constraints | 2018-07-12 | Paper |
| The importance of voting order for jury decisions by sequential majority voting | 2018-05-25 | Paper |
| Who should cast the casting vote? Using sequential voting to amalgamate information | 2018-03-28 | Paper |
| Normal-form preemption sequences for an open problem in scheduling theory | 2018-02-28 | Paper |
| Supplier Competition with Option Contracts for Discrete Blocks of Capacity | 2017-09-26 | Paper |
| Tactical fixed job scheduling with spread-time constraints | 2016-11-10 | Paper |
| Strong stability of Nash equilibria in load balancing games | 2014-12-02 | Paper |
| Stability vs. optimality in selfish ring routing | 2014-06-11 | Paper |
| Efficiency analysis of load balancing games with and without activation costs | 2014-02-05 | Paper |
| Cost-effective designs of fault-tolerant access networks in communication systems | 2010-11-24 | Paper |
| The price of atomic selfish ring routing | 2010-06-11 | Paper |
| Equilibria in load balancing games | 2010-01-11 | Paper |
| On-line service scheduling | 2009-08-28 | Paper |
| Approximation algorithms for soft-capacitated facility location in capacitated network design | 2009-06-17 | Paper |
| Logistics scheduling with batching and transportation | 2008-04-24 | Paper |
| Lot-sizing scheduling with batch setup times | 2007-05-15 | Paper |
| Optimal Binomial Group Testing with a Test History | 2007-01-19 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem | 2005-11-11 | Paper |
| Optimisation models for re-routing air traffic flows in Europe | 2005-03-16 | Paper |
| On-line scheduling a batch processing system to minimize total weighted job completion time | 2005-03-15 | Paper |
| Algorithms for on-line bin-packing problems with cardinality constraints | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474104 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474134 | 2004-08-04 | Paper |
| On-line scheduling of small open shops | 2002-10-31 | Paper |
| How good is a dense shop schedule? | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247460 | 2000-09-26 | Paper |
| Approximation algorithms for two-machine flow shop scheduling with batch setup times | 1999-06-03 | Paper |
| An improved heuristic for one-machine scheduling with delays constraints | 1998-06-22 | Paper |
| On-line scheduling of two-machine open shops where jobs arrive over time | 1998-04-13 | Paper |
| Scheduling on identical machines: How good is LPT in an on-line setting? | 1998-03-18 | Paper |
| A New Heuristic for Three-Machine Flow Shop Scheduling | 1997-08-03 | Paper |
| A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" | 1997-05-26 | Paper |
| An optimal algorithm for preemptive on-line scheduling | 1997-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883371 | 1996-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840097 | 1996-01-08 | Paper |
| A lower bound for randomized on-line scheduling algorithms | 1995-09-19 | Paper |
| New lower and upper bounds for on-line scheduling | 1995-07-06 | Paper |
| Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage | 1995-05-28 | Paper |
| A note on LPT scheduling | 1994-04-12 | Paper |
| Approximation Algorithms for Three-Machine Open Shop Scheduling | 1994-03-24 | Paper |
| A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times | 1994-02-07 | Paper |
| Worst-case analysis of heuristics for open shops with parallel machines | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4025225 | 1993-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016115 | 1992-12-16 | Paper |
| Parametric bounds for LPT scheduling on uniform processors | 1992-06-26 | Paper |
| Tighter bound for MULTIFIT scheduling on uniform processors | 1992-06-25 | Paper |
| Operational Research: Methods and Applications | 0001-01-03 | Paper |
