| 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
Algorithmica | 2024-04-02 | Paper |
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
SIAM Journal on Computing | 2023-08-10 | Paper |
Multi-sided advertising markets: dynamic mechanisms and incremental user compensations
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Practical budgeted submodular maximization
Algorithmica | 2023-04-28 | Paper |
Correction to: ``Guess free maximization of submodular and linear sums
Algorithmica | 2022-10-06 | Paper |
A Framework for the Secretary Problem on the Intersection of Matroids
SIAM Journal on Computing | 2022-07-08 | Paper |
The power of subsampling in submodular maximization
Mathematics of Operations Research | 2022-06-27 | Paper |
Guess free maximization of submodular and linear sums
Algorithmica | 2021-04-08 | Paper |
Online contention resolution schemes with applications to Bayesian selection problems
SIAM Journal on Computing | 2021-03-24 | Paper |
The one-way communication complexity of submodular maximization with applications to streaming and robustness
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Online submodular maximization: beating 1/2 made simple
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Algorithms for Big Data
| 2020-05-29 | Paper |
Constrained submodular maximization via a nonsymmetric technique
Mathematics of Operations Research | 2020-04-30 | Paper |
A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
Mathematics of Operations Research | 2020-03-12 | Paper |
Online submodular maximization: beating 1/2 made simple
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Unconstrained submodular maximization with constant adaptive complexity
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Guess free maximization of submodular and linear sums
Lecture Notes in Computer Science | 2020-01-16 | 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 |
Submodular maximization with cardinality constraints
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved approximating algorithms for directed Steiner forest
| 2019-05-06 | Paper |
Deterministic Algorithms for Submodular Maximization Problems
ACM Transactions on Algorithms | 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
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Maximizing symmetric submodular functions
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online contention resolution schemes
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Deterministic algorithms for submodular maximization problems
Proceedings of the Twenty-Seventh 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 |
Building a good team: secretary problems and the supermodular degree
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The submodular secretary problem goes linear
SIAM Journal on Computing | 2018-04-24 | Paper |
A framework for the secretary problem on the intersection of matroids
| 2018-03-15 | Paper |
Distributed signaling games
| 2018-03-02 | Paper |
A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | 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 |
Non-preemptive buffer management for latency sensitive packets
Journal of Scheduling | 2017-08-25 | Paper |
Comparing apples and oranges: query trade-off in submodular maximization
Mathematics of Operations Research | 2017-06-02 | Paper |
Mechanism design with strategic mediators
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 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
Algorithmica | 2017-03-06 | Paper |
Maximizing symmetric submodular functions
Lecture Notes in Computer Science | 2015-11-19 | Paper |
A tight linear time (1/2)-approximation for unconstrained submodular maximization
SIAM Journal on Computing | 2015-11-04 | Paper |
Competition in the presence of social networks: How many service providers maximize welfare?
Web and Internet Economics | 2015-01-12 | Paper |
A Unified Continuous Greedy Algorithm for Submodular Maximization
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Improved approximation algorithms for directed Steiner forest
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Improved approximations for \(k\)-exchange systems (extended abstract)
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Improved competitive ratios for submodular secretary problems (extended abstract)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
