| 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
SIAM Journal on Computing | 2023-08-10 | Paper |
Online \(k\)-taxi via double coverage and time-reverse primal-dual
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Online \(k\)-taxi via double coverage and time-reverse primal-dual
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Simplex transformations and the multiway cut problem
Mathematics of Operations Research | 2021-07-15 | Paper |
Metrical Service Systems with Transformations
| 2020-09-17 | Paper |
Online submodular maximization: beating 1/2 made simple
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Online algorithms for maximum cardinality matching with edge arrivals
| 2020-05-27 | Paper |
Constrained submodular maximization via a nonsymmetric technique
Mathematics of Operations Research | 2020-04-30 | Paper |
A simple algorithm for the multiway cut problem
Operations Research Letters | 2020-02-10 | Paper |
Online submodular maximization: beating 1/2 made simple
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Online submodular maximization with preemption
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
\(k\)-servers with a smile: online algorithms via projections
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Submodular maximization with cardinality constraints
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Competitive analysis via regularization
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Online algorithms for maximum cardinality matching with edge arrivals
Algorithmica | 2019-05-07 | Paper |
Deterministic Algorithms for Submodular Maximization Problems
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Simplex partitioning via exponential clocks and the multiway-cut problem
SIAM Journal on Computing | 2018-08-03 | Paper |
A polylogarithmic-competitive algorithm for the \(k\)-server problem
Journal of the ACM | 2018-08-02 | Paper |
Deterministic algorithms for submodular maximization problems
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Fair coin flipping: tighter analysis and the many-party case
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Simplex transformations and the multiway cut problem
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Online submodular maximization with preemption
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Comparing apples and oranges: query tradeoff in submodular maximization
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Comparing apples and oranges: query trade-off in submodular maximization
Mathematics of Operations Research | 2017-06-02 | Paper |
Unified algorithms for online learning and competitive analysis
Mathematics of Operations Research | 2016-05-19 | Paper |
How to allocate goods in an online market?
Algorithmica | 2016-03-29 | Paper |
A tight linear time (1/2)-approximation for unconstrained submodular maximization
SIAM Journal on Computing | 2015-11-04 | Paper |
A general approach to online network optimization problems
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6469194 (Why is no real title available?)
| 2015-08-03 | Paper |
Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
Algorithmica | 2015-05-21 | Paper |
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
Algorithmica | 2014-12-02 | Paper |
Competitive algorithms for restricted caching and matroid caching
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Fair online load balancing
Journal of Scheduling | 2014-08-18 | Paper |
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Online make-to-order joint replenishment model: primal-dual competitive algorithms
Operations Research | 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
Journal of the ACM | 2014-02-17 | Paper |
Approximation algorithms for online weighted rank function maximization under matroid constraints
Automata, Languages, and Programming | 2013-08-12 | Paper |
Online primal-dual algorithms for covering and packing
Mathematics of Operations Research | 2011-04-27 | Paper |
A regularization approach to metrical task systems
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Metrical task systems and the \(k\)-server problem on HSTs
Automata, Languages and Programming | 2010-09-07 | Paper |
Non-cooperative cost sharing games via subsidies
Theory of Computing Systems | 2010-08-13 | Paper |
scientific article; zbMATH DE number 5764798 (Why is no real title available?)
| 2010-08-06 | Paper |
The online set cover problem
SIAM Journal on Computing | 2010-04-29 | Paper |
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Foundations and Trends® in Theoretical Computer Science | 2009-06-30 | Paper |
scientific article; zbMATH DE number 5485535 (Why is no real title available?)
| 2009-01-05 | Paper |
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Non-cooperative Cost Sharing Games Via Subsidies
Algorithmic Game Theory | 2008-05-02 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Lower and upper bounds on obtaining history independence
Information and Computation | 2006-04-28 | Paper |
