| 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(\mathrm{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 trade-off 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 |
| Towards the randomized \(k\)-server conjecture, a primal-dual approach | 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 |
