| Publication | Date of Publication | Type |
|---|
Faster submodular maximization for several classes of matroids
| 2024-11-14 | Paper |
Submodular optimization in the MapReduce model
| 2024-08-26 | Paper |
Fixed-price approximations in bilateral trade
| 2024-07-19 | Paper |
A simple proof of the nonuniform Kahn-Kalai conjecture
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Approximating Nash social welfare by matching and local search
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7788407 (Why is no real title available?)
| 2024-01-15 | Paper |
On the hardness of dominant strategy mechanism design
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Towards an optimal contention resolution scheme for matchings
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
A simple proof of the non-uniform Kahn-Kalai conjecture
| 2023-06-21 | Paper |
Secretary Problems: The Power of a Single Sample
| 2022-08-19 | Paper |
On complex roots of the independence polynomial
| 2022-04-11 | Paper |
When are welfare guarantees robust?
| 2021-07-28 | Paper |
In memoriam: Maryam Mirzakhani
Bulletin of the American Mathematical Society | 2020-09-25 | Paper |
Submodular function maximization via the multilinear relaxation and contention resolution schemes
SIAM Journal on Computing | 2020-05-31 | Paper |
Stability and recovery for independence systems
| 2020-05-27 | Paper |
An algorithmic proof of the Lovász local lemma via resampling oracles
SIAM Journal on Computing | 2020-04-16 | Paper |
Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
Theoretical Computer Science | 2020-01-29 | Paper |
Fast algorithms for maximizing submodular functions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Local distribution and the symmetry gap: approximability of multiway partitioning problems
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Online submodular welfare maximization: greedy is optimal
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Communication complexity of combinatorial auctions with submodular valuations
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
| 2019-01-10 | Paper |
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
Journal of the ACM | 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
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Optimal approximation for submodular and supermodular optimization with bounded curvature
Mathematics of Operations Research | 2017-12-07 | Paper |
Short proofs for generalizations of the Lov\'asz Local Lemma: Shearer's condition and cluster expansion
| 2017-11-17 | Paper |
Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Optimal approximation for submodular and supermodular optimization with bounded curvature
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Multi-budgeted matchings and matroid intersection via dependent rounding
| 2017-09-29 | Paper |
Submodular maximization by simulated annealing
| 2017-09-29 | Paper |
On multiplicative weight updates for concave and submodular function maximization
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture
| 2017-03-22 | Paper |
Exchangeability and realizability: de Finetti theorems on graphs
| 2017-03-22 | Paper |
Optimal bounds on approximation of submodular and XOS functions by juntas
SIAM Journal on Computing | 2016-07-04 | Paper |
Limitations of randomized mechanisms for combinatorial auctions
Games and Economic Behavior | 2015-08-12 | Paper |
Covering minimum spanning trees of random subgraphs
| 2015-08-03 | Paper |
Multiway cut, pairwise realizable distributions, and descending thresholds
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On variants of the matroid secretary problem
Algorithmica | 2015-03-23 | Paper |
Is submodularity testable?
Algorithmica | 2014-11-19 | Paper |
Adaptivity and approximation for stochastic packing problems
| 2014-10-13 | Paper |
New model of precession, valid in time interval 400 thousand years.
| 2014-09-19 | Paper |
Matroid matching: the power of local search
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Limitations of randomized mechanisms for combinatorial auctions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Symmetry and Approximability of Submodular Maximization Problems
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
From query complexity to computational complexity
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Symmetry and approximability of submodular maximization problems
SIAM Journal on Computing | 2013-07-04 | Paper |
Matroid matching: the power of local search
SIAM Journal on Computing | 2013-07-04 | Paper |
Maximizing a monotone submodular function subject to a matroid constraint
SIAM Journal on Computing | 2012-03-15 | Paper |
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing | 2011-11-07 | Paper |
On variants of the matroid secretary problem
Lecture Notes in Computer Science | 2011-09-16 | Paper |
A randomized embedding algorithm for trees
Combinatorica | 2011-07-22 | Paper |
The submodular welfare problem with demand queries
Theory of Computing | 2011-05-24 | Paper |
scientific article; zbMATH DE number 5888315 (Why is no real title available?)
| 2011-05-16 | Paper |
Submodular maximization over multiple matroids via generalized exchange properties
Mathematics of Operations Research | 2011-04-27 | Paper |
Approximating the stochastic Knapsack problem: the benefit of adaptivity
Mathematics of Operations Research | 2011-04-27 | Paper |
Disjoint bases in a polymatroid
Random Structures & Algorithms | 2010-11-09 | Paper |
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Optimal approximation for the submodular welfare problem in the value oracle model
| 2009-01-05 | Paper |
Stochastic Covering and Adaptivity
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
How many random edges make a dense hypergraph non-2-colorable?
Random Structures & Algorithms | 2008-06-05 | Paper |
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Nearly optimal embeddings of trees
| 2007-07-13 | Paper |
A Ramsey-type result for the hypercube
Journal of Graph Theory | 2007-02-07 | Paper |
Covering minimum spanning trees of random subgraphs
Random Structures & Algorithms | 2007-02-07 | Paper |
Shortest‐path metric approximation for random subgraphs
Random Structures & Algorithms | 2007-02-07 | Paper |
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics | 2006-11-15 | Paper |
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry | 2006-04-28 | Paper |
Wide partitions, Latin tableaux, and Rota's basis conjecture
Advances in Applied Mathematics | 2003-12-03 | Paper |
Towards a theory of frustrated degeneracy.
Discrete Mathematics | 2003-09-25 | Paper |
scientific article; zbMATH DE number 1823758 (Why is no real title available?)
| 2002-11-05 | Paper |
The limit checker number of a graph
Discrete Mathematics | 2001-07-18 | Paper |
Optimization via enumeration: A new algorithm for the max cut problem
Mathematical Programming. Series A. Series B | 2001-06-26 | Paper |
scientific article; zbMATH DE number 1500689 (Why is no real title available?)
| 2000-11-08 | Paper |
scientific article; zbMATH DE number 3769017 (Why is no real title available?)
| 1982-01-01 | Paper |
