| Publication | Date of Publication | Type |
|---|
| Maintaining matroid intersections online | 2024-11-28 | Paper |
| Lossless online rounding for online bipartite matching (despite its impossibility) | 2024-05-14 | Paper |
| Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid | 2023-08-10 | Paper |
| Online \(k\)-taxi via double coverage and time-reverse primal-dual | 2023-03-14 | Paper |
| Online \(k\)-taxi via double coverage and time-reverse primal-dual | 2021-12-21 | Paper |
| Simplex Transformations and the Multiway Cut Problem | 2021-07-15 | Paper |
| Metrical Service Systems with Transformations | 2020-09-17 | Paper |
| Online submodular maximization: beating 1/2 made simple | 2020-08-28 | Paper |
| Online Algorithms for Maximum Cardinality Matching with Edge Arrivals | 2020-05-27 | Paper |
| Constrained Submodular Maximization via a Nonsymmetric Technique | 2020-04-30 | Paper |
| A simple algorithm for the multiway cut problem | 2020-02-10 | Paper |
| Online submodular maximization: beating 1/2 made simple | 2020-02-06 | Paper |
| Online Submodular Maximization with Preemption | 2019-11-25 | Paper |
| Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid | 2019-10-15 | Paper |
| k-Servers with a Smile: Online Algorithms via Projections | 2019-10-15 | Paper |
| Submodular Maximization with Cardinality Constraints | 2019-06-20 | Paper |
| Competitive Analysis via Regularization | 2019-06-20 | Paper |
| Online algorithms for maximum cardinality matching with edge arrivals | 2019-05-07 | Paper |
| Deterministic Algorithms for Submodular Maximization Problems | 2018-11-13 | Paper |
| Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem | 2018-08-03 | Paper |
| A Polylogarithmic-Competitive Algorithm for the k -Server Problem | 2018-08-02 | Paper |
| Deterministic Algorithms for Submodular Maximization Problems | 2018-07-16 | Paper |
| Fair Coin Flipping: Tighter Analysis and the Many-Party Case | 2018-07-16 | Paper |
| Simplex Transformations and the Multiway Cut Problem | 2018-07-16 | Paper |
| O(depth)-Competitive Algorithm for Online Multi-level Aggregation | 2018-07-16 | Paper |
| Online Submodular Maximization with Preemption | 2017-10-05 | Paper |
| Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization | 2017-10-05 | Paper |
| Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization | 2017-06-02 | Paper |
| Unified algorithms for online learning and competitive analysis | 2016-05-19 | Paper |
| How to allocate goods in an online market? | 2016-03-29 | Paper |
| A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization | 2015-11-04 | Paper |
| A general approach to online network optimization problems | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501312 | 2015-08-03 | Paper |
| Incentive compatible mulit-unit combinatorial auctions: a primal dual approach | 2015-05-21 | Paper |
| A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching | 2014-12-02 | Paper |
| Competitive Algorithms for Restricted Caching and Matroid Caching | 2014-10-08 | Paper |
| Fair online load balancing | 2014-08-18 | Paper |
| Simplex partitioning via exponential clocks and the multiway cut problem | 2014-08-07 | Paper |
| A Polylogarithmic-Competitive Algorithm for the k-Server Problem | 2014-07-30 | Paper |
| Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms | 2014-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417604 | 2014-05-22 | Paper |
| A Primal-Dual Randomized Algorithm for Weighted Paging | 2014-02-17 | Paper |
| Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints | 2013-08-12 | Paper |
| Online Primal-Dual Algorithms for Covering and Packing | 2011-04-27 | Paper |
| A Regularization Approach to Metrical Task Systems | 2010-10-01 | Paper |
| Metrical Task Systems and the k-Server Problem on HSTs | 2010-09-07 | Paper |
| Non-cooperative cost sharing games via subsidies | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579387 | 2010-08-06 | Paper |
| The Online Set Cover Problem | 2010-04-29 | Paper |
| The Design of Competitive Online Algorithms via a Primal—Dual Approach | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549707 | 2009-01-05 | Paper |
| An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching | 2008-09-25 | Paper |
| Non-cooperative Cost Sharing Games Via Subsidies | 2008-05-02 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Lower and upper bounds on obtaining history independence | 2006-04-28 | Paper |
