| Publication | Date of Publication | Type |
|---|
| Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model | 2024-08-22 | Paper |
| Streaming submodular maximization under matroid constraints | 2024-06-24 | Paper |
| Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model | 2024-04-02 | Paper |
| Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid | 2023-08-10 | Paper |
| Multi-sided advertising markets: dynamic mechanisms and incremental user compensations | 2023-08-02 | Paper |
| Practical budgeted submodular maximization | 2023-04-28 | Paper |
| Correction to: ``Guess free maximization of submodular and linear sums | 2022-10-06 | Paper |
| A Framework for the Secretary Problem on the Intersection of Matroids | 2022-07-08 | Paper |
| The Power of Subsampling in Submodular Maximization | 2022-06-27 | Paper |
| Guess free maximization of submodular and linear sums | 2021-04-08 | Paper |
| Online Contention Resolution Schemes with Applications to Bayesian Selection Problems | 2021-03-24 | Paper |
| The one-way communication complexity of submodular maximization with applications to streaming and robustness | 2021-01-19 | Paper |
| Online submodular maximization: beating 1/2 made simple | 2020-08-28 | Paper |
| Algorithms for Big Data | 2020-05-29 | Paper |
| Constrained Submodular Maximization via a Nonsymmetric Technique | 2020-04-30 | Paper |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem | 2020-03-12 | Paper |
| Online submodular maximization: beating 1/2 made simple | 2020-02-06 | Paper |
| Unconstrained submodular maximization with constant adaptive complexity | 2020-01-30 | Paper |
| Guess free maximization of submodular and linear sums | 2020-01-16 | Paper |
| Online Submodular Maximization with Preemption | 2019-11-25 | Paper |
| Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid | 2019-10-15 | Paper |
| Submodular Maximization with Cardinality Constraints | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633905 | 2019-05-06 | Paper |
| Deterministic Algorithms for Submodular Maximization Problems | 2018-11-13 | Paper |
| Removal and threshold pricing: truthful two-sided markets with multi-dimensional participants | 2018-11-08 | Paper |
| All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2018-11-05 | Paper |
| Maximizing Symmetric Submodular Functions | 2018-11-05 | Paper |
| Online Contention Resolution Schemes | 2018-07-16 | Paper |
| Deterministic Algorithms for Submodular Maximization Problems | 2018-07-16 | Paper |
| O(depth)-Competitive Algorithm for Online Multi-level Aggregation | 2018-07-16 | Paper |
| Building a Good Team: Secretary Problems and the Supermodular Degree | 2018-07-16 | Paper |
| The Submodular Secretary Problem Goes Linear | 2018-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607930 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606312 | 2018-03-02 | Paper |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem | 2017-10-05 | Paper |
| Online Submodular Maximization with Preemption | 2017-10-05 | Paper |
| Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization | 2017-10-05 | Paper |
| Non-preemptive buffer management for latency sensitive packets | 2017-08-25 | Paper |
| Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization | 2017-06-02 | Paper |
| Mechanism Design with Strategic Mediators | 2017-05-19 | Paper |
| Constrained Monotone Function Maximization and the Supermodular Degree | 2017-03-22 | Paper |
| Revenue and reserve prices in a probabilistic single item auction | 2017-03-06 | Paper |
| Maximizing Symmetric Submodular Functions | 2015-11-19 | Paper |
| A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization | 2015-11-04 | Paper |
| Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? | 2015-01-12 | Paper |
| A Unified Continuous Greedy Algorithm for Submodular Maximization | 2014-07-30 | Paper |
| All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2013-03-19 | Paper |
| Improved approximation algorithms for directed Steiner forest | 2012-05-11 | Paper |
| Improved Approximations for k-Exchange Systems | 2011-09-16 | Paper |
| Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) | 2011-08-17 | Paper |
| Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm | 2011-07-06 | Paper |
