| Publication | Date of Publication | Type |
|---|
| Traveling repairperson, unrelated machines, and other stories about average completion times | 2026-05-12 | Paper |
| A nearly optimal deterministic online algorithm for non-metric facility location | 2026-04-21 | Paper |
| An optimal algorithm for online multiple knapsack | 2026-03-18 | Paper |
| An improved approximation algorithm for dynamic minimum linear arrangement | 2025-11-10 | Paper |
| A subquadratic bound for online bisection | 2025-11-10 | Paper |
| Online facility location with linear delay | 2024-08-22 | Paper |
| An improved deterministic algorithm for the online min-sum set cover problem | 2024-07-19 | Paper |
scientific article; zbMATH DE number 7650247 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Improved analysis of online balanced clustering
(available as arXiv preprint) | 2022-10-19 | Paper |
| An improved online algorithm for the traveling repairperson problem on a line | 2022-07-21 | Paper |
Better Bounds for Online Line Chasing
(available as arXiv preprint) | 2022-07-21 | Paper |
New results on multi-level aggregation
Theoretical Computer Science | 2021-03-09 | Paper |
Unbounded lower bound for k-server against weak adversaries
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Online Algorithms for Multilevel Aggregation
Operations Research | 2020-11-04 | Paper |
Dynamic balanced graph partitioning
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
(available as arXiv preprint) | 2020-05-27 | Paper |
Dynamic Beats Fixed
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Better Approximation Bounds for the Joint Replenishment Problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Collecting weighted items from a dynamic queue | 2019-05-06 | Paper |
| Online service with delay on a line | 2019-01-30 | Paper |
A primal-dual online deterministic algorithm for matching with delays
(available as arXiv preprint) | 2019-01-15 | Paper |
Distributed Online and Stochastic Queueing on a Multiple Access Channel
ACM Transactions on Algorithms | 2018-11-13 | Paper |
A match in time saves nine: deterministic online matching with delays
(available as arXiv preprint) | 2018-06-22 | Paper |
Online algorithms for multi-level aggregation
(available as arXiv preprint) | 2018-03-02 | Paper |
Logarithmic price of buffer downscaling on line metrics
Theoretical Computer Science | 2017-12-20 | Paper |
| An optimal lower bound for buffer management in multi-queue switches | 2017-09-29 | Paper |
| A deterministic algorithm for online Steiner tree leasing | 2017-09-22 | Paper |
Randomized mutual exclusion on a multiple access channel
Distributed Computing | 2017-04-04 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Journal of Scheduling | 2016-01-22 | Paper |
A randomized algorithm for online scheduling with interval conflicts
Structural Information and Communication Complexity | 2016-01-08 | Paper |
An optimal lower bound for buffer management in multi-queue switches
Algorithmica | 2014-12-02 | Paper |
Competitive FIB aggregation for independent prefixes: online ski rental on the trie
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Online control message aggregation in chain networks
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Lecture Notes in Computer Science | 2013-08-06 | Paper |
(1,2)-Hamiltonian completion on a matching
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Distributed Online and Stochastic Queuing on a Multiple Access Channel
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Collecting weighted items from a dynamic queue
Algorithmica | 2013-03-05 | Paper |
A -competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science | 2013-03-04 | Paper |
The \(k\)-resource problem in uniform metric spaces
Theoretical Computer Science | 2012-11-08 | Paper |
| DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL | 2012-01-23 | Paper |
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Theoretical Computer Science | 2011-10-10 | Paper |
Online function tracking with generalized penalties
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Event Extent Estimation
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Price fluctuations: to buy or to rent
Approximation and Online Algorithms | 2010-05-11 | Paper |
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms | 2009-12-10 | Paper |
The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms | 2009-02-12 | Paper |
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
