| 2026 | IPCO | On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope. | Martin Ngele, Christian Nbel, Rico Zenklusen |
| 2026 | IPCO | Approximation Schemes for Planar Graph Connectivity Problems. | Meike Neuwohner, Vera Traub, Rico Zenklusen |
| 2026 | SODA | Nearly Tight Sample Complexity for Matroid Online Contention Resolution. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2026 | STOC | Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-uniform k-Center. | Jannis Blauth, Christian Nbel, Rico Zenklusen |
| 2024 | SODA | Single-Source Unsplittable Flows in Planar Graphs. | Vera Traub, Laura Vargas Koch, Rico Zenklusen |
| 2024 | STOC | Ghost Value Augmentation for k-Edge-Connectivity. | D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen |
| 2023 | IPCO | Advances on Strictly $\varDelta $-Modular IPs. | Martin Ngele, Christian Nbel, Richard Santiago, Rico Zenklusen |
| 2023 | IPCO | Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. | Richard Santiago, Ivan Sergeev, Rico Zenklusen |
| 2023 | STOC | A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. | Vera Traub, Rico Zenklusen |
| 2022 | ESA | Techniques for Generalized Colorful k-Center Problems. | Georg Anegg, Laura Vargas Koch, Rico Zenklusen |
| 2022 | ESA | Submodular Maximization Subject to Matroid Intersection on the Fly. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | ICALP | Streaming Submodular Maximization Under Matroid Constraints. | Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | ICML | Fair and Fast k-Center Clustering for Data Summarization. | Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen |
| 2022 | SODA | Congruency-Constrained TU Problems Beyond the Bimodular Case. | Martin Ngele, Richard Santiago, Rico Zenklusen |
| 2022 | SODA | Local Search for Weighted Tree Augmentation and Steiner Tree. | Vera Traub, Rico Zenklusen |
| 2021 | FOCS | A Better-Than-2 Approximation for Weighted Tree Augmentation. | Vera Traub, Rico Zenklusen |
| 2021 | STOC | Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. | Federica Cecchetto, Vera Traub, Rico Zenklusen |
| 2020 | IPCO | A Technique for Obtaining True Approximations for k-Center with Covering Constraints. | Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen |
| 2020 | STOC | The one-way communication complexity of submodular maximization with applications to streaming and robustness. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2020 | STOC | Reducing path TSP to TSP. | Vera Traub, Jens Vygen, Rico Zenklusen |
| 2019 | IPCO | Approximate Multi-matroid Intersection via Iterative Refinement. | Andr Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen |
| 2019 | IPCO | A New Contraction Technique with Applications to Congruency-Constrained Cuts. | Martin Ngele, Rico Zenklusen |
| 2019 | SODA | A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. | Martin Ngele, Rico Zenklusen |
| 2019 | SODA | A 1.5-Approximation for Path TSP. | Rico Zenklusen |
| 2018 | SODA | Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. | Alfonso Cevallos, Stefan Weltge, Rico Zenklusen |
| 2018 | SODA | A Framework for the Secretary Problem on the Intersection of Matroids. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2018 | SODA | Submodular Minimization Under Congruency Constraints. | Martin Ngele, Benny Sudakov, Rico Zenklusen |
| 2018 | STOC | Improved approximation for tree augmentation: saving by rewiring. | Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen |
| 2017 | SODA | Firefighting on Trees Beyond Integrality Gaps. | David Adjiashvili, Andrea Baggio, Rico Zenklusen |
| 2017 | SODA | Local Search for Max-Sum Diversification. | Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen |
| 2017 | SODA | Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. | Robert Hildebrand, Robert Weismantel, Rico Zenklusen |
| 2017 | STOC | A strongly polynomial algorithm for bimodular integer linear programming. | Stephan Artmann, Robert Weismantel, Rico Zenklusen |
| 2016 | IPCO | k-Trails: Recognition, Complexity, and Approximations. | Mohit Singh, Rico Zenklusen |
| 2016 | SODA | Online Contention Resolution Schemes. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2015 | FOCS | The Submodular Secretary Problem Goes Linear. | Moran Feldman, Rico Zenklusen |
| 2015 | FOCS | An O(1)-Approximation for Minimum Spanning Tree Interdiction. | Rico Zenklusen |
| 2015 | SODA | A Simple | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2014 | ICALP | Time-Expanded Packings. | David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen |
| 2013 | IPCO | Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. | Patrick Jaillet, Jos A. Soto, Rico Zenklusen |
| 2013 | IPCO | Chain-Constrained Spanning Trees. | Neil Olver, Rico Zenklusen |
| 2012 | SODA | Matroidal degree-bounded minimum spanning trees. | Rico Zenklusen |
| 2012 | STOC | Matroids and integrality gaps for hypergraphic steiner tree relaxations. | Michel X. Goemans, Neil Olver, Thomas Rothvo, Rico Zenklusen |
| 2012 | WG | Bisections above Tight Lower Bounds. | Matthias Mnich, Rico Zenklusen |
| 2011 | ESA | Approximation Algorithms for Conflict-Free Vehicle Routing. | Kaspar Schpbach, Rico Zenklusen |
| 2011 | SODA | Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2011 | STOC | Submodular function maximization via the multilinear relaxation and contention resolution schemes. | Jan Vondrk, Chandra Chekuri, Rico Zenklusen |
| 2010 | ESA | Approximation Schemes for Multi-Budgeted Independence Systems. | Fabrizio Grandoni, Rico Zenklusen |
| 2010 | FOCS | Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |