| Publication | Date of Publication | Type |
|---|
| Dynamic pricing of servers on trees | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875575 | 2023-02-03 | Paper |
| A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines | 2022-11-15 | Paper |
| Lower bounds on the performance of online algorithms for relaxed packing problems | 2022-08-30 | Paper |
| Better Bounds for Online Line Chasing | 2022-07-21 | Paper |
| Lower bounds on the performance of online algorithms for relaxed packing problems | 2022-01-16 | Paper |
| On packet scheduling with adversarial jamming and speedup | 2021-05-05 | Paper |
| New results on multi-level aggregation | 2021-03-09 | Paper |
| Unbounded lower bound for k-server against weak adversaries | 2021-01-19 | Paper |
| Online Algorithms for Multilevel Aggregation | 2020-11-04 | Paper |
| The ( h,k )-Server Problem on Bounded Depth Trees | 2019-11-25 | Paper |
| A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines | 2019-10-15 | Paper |
| Better Approximation Bounds for the Joint Replenishment Problem | 2019-06-20 | Paper |
| Online packet scheduling with bounded delay and lookahead | 2019-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633927 | 2019-05-06 | Paper |
| Make-to-Order Integrated Scheduling and Distribution | 2018-07-16 | Paper |
| The (h, k)-Server Problem on Bounded Depth Trees | 2018-07-16 | Paper |
| On packet scheduling with adversarial jamming and speedup | 2018-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636503 | 2018-04-19 | Paper |
| Tight bounds for double coverage against weak adversaries | 2018-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606281 | 2018-03-02 | Paper |
| Scheduling multipacket frames with frame deadlines | 2018-02-28 | Paper |
| Logarithmic price of buffer downscaling on line metrics | 2017-12-20 | Paper |
| Validating the Knuth-Morris-Pratt failure function, fast and online | 2017-11-07 | Paper |
| Pricing Online Decisions: Beyond Auctions | 2017-10-05 | Paper |
| Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling | 2017-09-13 | Paper |
| Online scheduling of jobs with fixed start times on related machines | 2016-03-23 | Paper |
| Online knapsack revisited | 2016-03-21 | Paper |
| Tight Bounds for Double Coverage Against Weak Adversaries | 2016-02-26 | Paper |
| Scheduling Multipacket Frames with Frame Deadlines | 2016-01-08 | Paper |
| Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption | 2015-09-30 | Paper |
| A universal randomized packet scheduling algorithm | 2015-03-23 | Paper |
| Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling | 2015-01-12 | Paper |
| Online scheduling of packets with agreeable deadlines | 2014-12-05 | Paper |
| Online Knapsack Revisited | 2014-09-02 | Paper |
| Lower bounds for online makespan minimization on a small number of related machines | 2014-08-18 | Paper |
| Online scheduling of bounded length jobs to maximize throughput | 2014-02-05 | Paper |
| Better bounds for incremental frequency allocation in bipartite graphs | 2013-12-11 | Paper |
| Online Control Message Aggregation in Chain Networks | 2013-08-12 | Paper |
| Collecting weighted items from a dynamic queue | 2013-03-05 | Paper |
| A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue | 2013-03-04 | Paper |
| Online Scheduling of Jobs with Fixed Start Times on Related Machines | 2012-11-02 | Paper |
| Randomized Algorithm for Agreeable Deadlines Packet Scheduling. | 2012-01-23 | Paper |
| Randomized competitive algorithms for online buffer management in the adaptive adversary model | 2011-10-10 | Paper |
| One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay | 2011-09-16 | Paper |
| Better Bounds for Incremental Frequency Allocation in Bipartite Graphs | 2011-09-16 | Paper |
| Validating the Knuth-Morris-Pratt Failure Function, Fast and Online | 2010-06-22 | Paper |
| Online Scheduling of Bounded Length Jobs to Maximize Throughput | 2010-05-11 | Paper |
| Randomized Algorithms for Buffer Management with 2-Bounded Delay | 2009-02-12 | Paper |
