| 2024 | STOC | A Constant-Factor Approximation for Nash Social Welfare with Subadditive Valuations. | Shahar Dobzinski, Wenzheng Li, Aviad Rubinstein, Jan Vondrk |
| 2024 | STOC | Prophet Inequalities with Cancellation Costs. | Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrk |
| 2023 | ICALP | Faster Submodular Maximization for Several Classes of Matroids. | Monika Henzinger, Paul Liu, Jan Vondrk, Da Wei Zheng |
| 2023 | IPCO | Towards an Optimal Contention Resolution Scheme for Matchings. | Pranav Nuti, Jan Vondrk |
| 2023 | SODA | On complex roots of the independence polynomial. | Ferenc Bencs, Pter Csikvri, Piyush Srivastava, Jan Vondrk |
| 2023 | SODA | Secretary Problems: The Power of a Single Sample. | Pranav Nuti, Jan Vondrk |
| 2023 | STOC | Approximating Nash Social Welfare by Matching and Local Search. | Jugal Garg, Edin Husic, Wenzheng Li, Lszl A. Vgh, Jan Vondrk |
| 2022 | SODA | Fixed-Price Approximations in Bilateral Trade. | Zi Yang Kang, Francisco Pernice, Jan Vondrk |
| 2022 | STOC | On the hardness of dominant strategy mechanism design. | Shahar Dobzinski, Shiri Ron, Jan Vondrk |
| 2021 | FOCS | A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations. | Wenzheng Li, Jan Vondrk |
| 2021 | SODA | Estimating the Nash Social Welfare for coverage and other submodular valuations. | Wenzheng Li, Jan Vondrk |
| 2020 | STOC | A polynomial lower bound on adaptive complexity of submodular maximization. | Wenzheng Li, Paul Liu, Jan Vondrk |
| 2019 | COLT | High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. | Vitaly Feldman, Jan Vondrk |
| 2019 | SODA | Submodular Optimization in the MapReduce Model. | Paul Liu, Jan Vondrk |
| 2018 | SODA | Computing the Independence Polynomial: from the Tree Threshold down to the Roots. | Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrk |
| 2017 | ALT | Tight Bounds on ℓ | Vitaly Feldman, Pravesh Kothari, Jan Vondrk |
| 2017 | ESA | Stability and Recovery for Independence Systems. | Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrk |
| 2015 | AAAI | Lazier Than Lazy Greedy. | Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrk, Andreas Krause |
| 2015 | FOCS | Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS Functions. | Vitaly Feldman, Jan Vondrk |
| 2015 | FOCS | An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles. | Nicholas J. A. Harvey, Jan Vondrk |
| 2015 | SODA | Sperner's Colorings, Hypergraph Labeling Problems and Fair Division. | Maryam Mirzakhani, Jan Vondrk |
| 2015 | SODA | Optimal approximation for submodular and supermodular optimization with bounded curvature. | Maxim Sviridenko, Jan Vondrk, Justin Ward |
| 2014 | ITA | Optimal bounds on approximation of submodular and XOS functions by juntas. | Vitaly Feldman, Jan Vondrk |
| 2014 | SODA | Fast algorithms for maximizing submodular functions. | Ashwinkumar Badanidiyuru, Jan Vondrk |
| 2014 | STOC | Multiway cut, pairwise realizable distributions, and descending thresholds. | Ankit Sharma, Jan Vondrk |
| 2013 | COLT | Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. | Vitaly Feldman, Pravesh Kothari, Jan Vondrk |
| 2013 | EDBT | Eagle-eyed elephant: split-oriented indexing in Hadoop. | Mohamed Y. Eltabakh, Fatma zcan, Yannis Sismanis, Peter J. Haas, Hamid Pirahesh, Jan Vondrk |
| 2013 | FOCS | Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas. | Vitaly Feldman, Jan Vondrk |
| 2013 | SODA | Communication Complexity of Combinatorial Auctions with Submodular Valuations. | Shahar Dobzinski, Jan Vondrk |
| 2013 | SODA | Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. | Alina Ene, Jan Vondrk, Yi Wu |
| 2013 | SODA | Online Submodular Welfare Maximization: Greedy is Optimal. | Michael Kapralov, Ian Post, Jan Vondrk |
| 2012 | STOC | From query complexity to computational complexity. | Shahar Dobzinski, Jan Vondrk |
| 2011 | ESA | On Variants of the Matroid Secretary Problem. | Shayan Oveis Gharan, Jan Vondrk |
| 2011 | FOCS | Limitations of Randomized Mechanisms for Combinatorial Auctions. | Shaddin Dughmi, Jan Vondrk |
| 2011 | PODS | Maximizing conjunctive views in deletion propagation. | Benny Kimelfeld, Jan Vondrk, Ryan Williams |
| 2011 | SODA | Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2011 | SODA | Submodular Maximization by Simulated Annealing. | Shayan Oveis Gharan, Jan Vondrk |
| 2011 | STOC | Submodular function maximization via the multilinear relaxation and contention resolution schemes. | Jan Vondrk, Chandra Chekuri, Rico Zenklusen |
| 2010 | FOCS | Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2010 | STOC | Matroid matching: the power of local search. | Jon Lee, Maxim Sviridenko, Jan Vondrk |
| 2009 | FOCS | Symmetry and Approximability of Submodular Maximization Problems. | Jan Vondrk |
| 2008 | STOC | Optimal approximation for the submodular welfare problem in the value oracle model. | Jan Vondrk |
| 2007 | FOCS | Maximizing Non-Monotone Submodular Functions. | Uriel Feige, Vahab S. Mirrokni, Jan Vondrk |
| 2007 | IPCO | Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). | Gruia Calinescu, Chandra Chekuri, Martin Pl, Jan Vondrk |
| 2006 | FOCS | Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. | Uriel Feige, Jan Vondrk |
| 2006 | LATIN | Stochastic Covering and Adaptivity. | Michel X. Goemans, Jan Vondrk |
| 2005 | SODA | Adaptivity and approximation for stochastic packing problems. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2004 | FOCS | Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2004 | SODA | Covering minimum spanning trees of random subgraphs. | Michel X. Goemans, Jan Vondrk |
| 1999 | GD | Visibility Representations of Complete Graphs. | Robert Babilon, Helena Nyklov, Ondrej Pangrc, Jan Vondrk |