| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147321 | 2024-01-15 | Paper |
| On the hardness of dominant strategy mechanism design | 2023-12-08 | Paper |
| Towards an optimal contention resolution scheme for matchings | 2023-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002625 | 2021-07-28 | Paper |
| In memoriam: Maryam Mirzakhani | 2020-09-25 | Paper |
| Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes | 2020-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111712 | 2020-05-27 | Paper |
| An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles | 2020-04-16 | Paper |
| Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions | 2020-01-29 | Paper |
| Fast algorithms for maximizing submodular functions | 2019-06-20 | Paper |
| Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems | 2019-05-15 | Paper |
| Communication Complexity of Combinatorial Auctions with Submodular Valuations | 2019-05-15 | Paper |
| Online submodular welfare maximization: Greedy is optimal | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645666 | 2019-01-10 | Paper |
| Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations | 2018-08-02 | Paper |
| Concentration of Lipschitz Functions of Negatively Dependent Variables | 2018-04-20 | Paper |
| Computing the Independence Polynomial: from the Tree Threshold down to the Roots | 2018-03-15 | Paper |
| Sperner’s Colorings and Optimal Partitioning of the Simplex | 2018-02-26 | Paper |
| Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature | 2017-12-07 | Paper |
| Short proofs for generalizations of the Lov\'asz Local Lemma: Shearer's condition and cluster expansion | 2017-11-17 | Paper |
| Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature | 2017-10-05 | Paper |
| Sperner's Colorings, Hypergraph Labeling Problems and Fair Division | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365101 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365102 | 2017-09-29 | Paper |
| On Multiplicative Weight Updates for Concave and Submodular Function Maximization | 2017-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969615 | 2017-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969661 | 2017-03-22 | Paper |
| Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas | 2016-07-04 | Paper |
| Limitations of randomized mechanisms for combinatorial auctions | 2015-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501356 | 2015-08-03 | Paper |
| Multiway cut, pairwise realizable distributions, and descending thresholds | 2015-06-26 | Paper |
| On variants of the matroid secretary problem | 2015-03-23 | Paper |
| Is submodularity testable? | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921694 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3190915 | 2014-09-19 | Paper |
| Matroid matching | 2014-08-13 | Paper |
| Limitations of Randomized Mechanisms for Combinatorial Auctions | 2014-07-30 | Paper |
| Symmetry and Approximability of Submodular Maximization Problems | 2014-07-25 | Paper |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes | 2014-06-05 | Paper |
| From query complexity to computational complexity | 2014-05-13 | Paper |
| Symmetry and Approximability of Submodular Maximization Problems | 2013-07-04 | Paper |
| Matroid Matching: The Power of Local Search | 2013-07-04 | Paper |
| Maximizing a Monotone Submodular Function Subject to a Matroid Constraint | 2012-03-15 | Paper |
| Maximizing Non-monotone Submodular Functions | 2011-11-07 | Paper |
| On variants of the matroid secretary problem | 2011-09-16 | Paper |
| A randomized embedding algorithm for trees | 2011-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002824 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999661 | 2011-05-16 | Paper |
| Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity | 2011-04-27 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2011-04-27 | Paper |
| Disjoint bases in a polymatroid | 2010-11-09 | Paper |
| Submodular Maximization over Multiple Matroids via Generalized Exchange Properties | 2009-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549686 | 2009-01-05 | Paper |
| Stochastic Covering and Adaptivity | 2008-09-18 | Paper |
| How many random edges make a dense hypergraph non-2-colorable? | 2008-06-05 | Paper |
| Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) | 2007-11-29 | Paper |
| Nearly optimal embeddings of trees | 2007-07-13 | Paper |
| Covering minimum spanning trees of random subgraphs | 2007-02-07 | Paper |
| Shortest‐path metric approximation for random subgraphs | 2007-02-07 | Paper |
| A Ramsey-type result for the hypercube | 2007-02-07 | Paper |
| On the diameter of separated point sets with many nearly equal distances | 2006-11-15 | Paper |
| Nearly equal distances and Szemerédi's regularity lemma | 2006-04-28 | Paper |
| Wide partitions, Latin tableaux, and Rota's basis conjecture | 2003-12-03 | Paper |
| Towards a theory of frustrated degeneracy. | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153132 | 2002-11-05 | Paper |
| The limit checker number of a graph | 2001-07-18 | Paper |
| Optimization via enumeration: A new algorithm for the max cut problem | 2001-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501710 | 2000-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950020 | 1982-01-01 | Paper |
