| 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 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084411 | 2023-10-31 | Paper |
| Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems | 2023-10-31 | Paper |
| Approximating Requirement Cut via a Configuration LP | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875661 | 2023-02-03 | Paper |
| A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075832 | 2022-05-11 | Paper |
| A refined analysis of submodular greedy | 2021-12-13 | Paper |
| Simplex Transformations and the Multiway Cut Problem | 2021-07-15 | Paper |
| Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems | 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 | 2020-02-10 | Paper |
| Online Submodular Maximization with Preemption | 2019-11-25 | Paper |
| Submodular Maximization with Cardinality Constraints | 2019-06-20 | Paper |
| Non-Uniform Graph Partitioning | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633907 | 2019-05-06 | Paper |
| All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns | 2018-11-05 | Paper |
| Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem | 2018-08-03 | Paper |
| Simplex Transformations and the Multiway Cut Problem | 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 |
| Local guarantees in graph cuts and clustering | 2017-08-31 | Paper |
| Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization | 2017-06-02 | Paper |
| Discrepancy Without Partial Colorings | 2017-03-22 | Paper |
| A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization | 2015-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501246 | 2015-08-03 | Paper |
| The directed circular arrangement problem | 2014-11-18 | Paper |
| Simplex partitioning via exponential clocks and the multiway cut problem | 2014-08-07 | Paper |
| Min-max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| A Unified Continuous Greedy Algorithm for Submodular Maximization | 2014-07-30 | Paper |
| Min-Max Graph Partitioning and Small Set Expansion | 2014-07-30 | Paper |
| All-or-nothing generalized assignment with application to scheduling advertising campaigns | 2013-03-19 | Paper |
| Improved approximations for \(k\)-exchange systems (extended abstract) | 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 (extended abstract) | 2011-07-06 | Paper |
| Balanced metric labeling | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549676 | 2009-01-05 | Paper |
