| Publication | Date of Publication | Type |
|---|
| A tight competitive ratio for online submodular welfare maximization | 2025-01-06 | Paper |
| An improved approximation algorithm for the Max-3-Section problem | 2025-01-06 | Paper |
| Fair correlation clustering in general graphs | 2024-08-22 | Paper |
| A simple algorithm for submodular minimum linear ordering | 2024-05-14 | Paper |
The metric relaxation for 0 -extension admits an Ω(log 2/3 k) gap
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7758351 (Why is no real title available?) | 2023-10-31 | Paper |
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Approximating Requirement Cut via a Configuration LP | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7650324 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
(available as arXiv preprint) | 2022-07-21 | Paper |
Graph balancing with orientation costs
(available as arXiv preprint) | 2022-05-11 | Paper |
A refined analysis of submodular greedy
Operations Research Letters | 2021-12-13 | Paper |
Simplex transformations and the multiway cut problem
Mathematics of Operations Research | 2021-07-15 | Paper |
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification | 2020-05-27 | Paper |
A simple algorithm for the multiway cut problem
Operations Research Letters | 2020-02-10 | Paper |
Online submodular maximization with preemption
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Submodular maximization with cardinality constraints
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Non-uniform graph partitioning
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Partitioning graphs into balanced components | 2019-05-06 | Paper |
All-or-nothing generalized assignment with application to scheduling advertising campaigns
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Simplex partitioning via exponential clocks and the multiway-cut problem
SIAM Journal on Computing | 2018-08-03 | Paper |
Simplex transformations and the multiway cut problem
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 |
Local guarantees in graph cuts and clustering
(available as arXiv preprint) | 2017-08-31 | Paper |
Comparing apples and oranges: query trade-off in submodular maximization
Mathematics of Operations Research | 2017-06-02 | Paper |
| Discrepancy without partial colorings | 2017-03-22 | Paper |
A tight linear time (1/2)-approximation for unconstrained submodular maximization
SIAM Journal on Computing | 2015-11-04 | Paper |
| The directed circular arrangement problem | 2015-08-03 | Paper |
The directed circular arrangement problem
ACM Transactions on Algorithms | 2014-11-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 |
Min-max Graph Partitioning and Small Set Expansion
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A Unified Continuous Greedy Algorithm for Submodular Maximization
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Min-Max Graph Partitioning and Small Set Expansion
SIAM Journal on Computing | 2014-07-30 | Paper |
Min-Max Graph Partitioning and Small Set Expansion
SIAM Journal on Computing | 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 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 |
Balanced metric labeling
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5485510 (Why is no real title available?) | 2009-01-05 | Paper |
