Rico Zenklusen

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 91

Top Venues

Publications

Vera Traub, Laura Vargas Koch, Rico Zenklusen
Single-Source Unsplittable Flows in Planar Graphs. SODA (2024)
D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
Ghost Value Augmentation for k-Edge-Connectivity. STOC (2024)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207 (1) (2024)
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
Advances on Strictly $\varDelta $-Modular IPs. IPCO (2023)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM 70 (4) (2023)
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. CoRR (2023)
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
Advances on Strictly Δ-Modular IPs. CoRR (2023)
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. IPCO (2023)
Vera Traub, Laura Vargas Koch, Rico Zenklusen
Single-Source Unsplittable Flows in Planar Graphs. CoRR (2023)
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. SOSA (2023)
Vera Traub, Rico Zenklusen
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC (2023)
Martin Nägele, Rico Zenklusen
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. CoRR (2023)
D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
Ghost Value Augmentation for k-ECSS and k-ECSM. CoRR (2023)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA (2023)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems. CoRR (2022)
Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
Fair and Fast k-Center Clustering for Data Summarization. ICML (2022)
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. CoRR (2022)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
A Simple Combinatorial Algorithm for Robust Matroid Center. CoRR (2022)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS (2022)
Vera Traub, Rico Zenklusen
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR (2022)
Georg Anegg, Laura Vargas Koch, Rico Zenklusen
Techniques for Generalized Colorful k-Center Problems. ESA (2022)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. SIAM J. Comput. 51 (3) (2022)
Martin Nägele, Richard Santiago, Rico Zenklusen
Congruency-Constrained TU Problems Beyond the Bimodular Case. SODA (2022)
Simon Bruggmann, Rico Zenklusen
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. Math. Program. 191 (2) (2022)
Vera Traub, Rico Zenklusen
Local Search for Weighted Tree Augmentation and Steiner Tree. SODA (2022)
Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Streaming Submodular Maximization Under Matroid Constraints. ICALP (2022)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR (2022)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR (2022)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192 (1) (2022)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA (2022)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. 51 (3) (2022)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC (2021)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS (2021)
Georg Anegg, Haris Angelidakis, Rico Zenklusen
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. SOSA (2021)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR (2021)
Martin Nägele, Richard Santiago, Rico Zenklusen
Congruency-Constrained TU Problems Beyond the Bimodular Case. CoRR (2021)
Moran Feldman, Ola Svensson, Rico Zenklusen
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. 50 (2) (2021)
Vera Traub, Rico Zenklusen
A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR (2021)
Vera Traub, Rico Zenklusen
Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR (2021)
Georg Anegg, Haris Angelidakis, Rico Zenklusen
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR (2020)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR (2020)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC (2020)
Federica Cecchetto, Vera Traub, Rico Zenklusen
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR (2020)
Martin Nägele, Rico Zenklusen
A new contraction technique with applications to congruency-constrained cuts. Math. Program. 183 (1) (2020)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR (2020)
Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO (2020)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing path TSP to TSP. STOC (2020)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183 (1) (2020)
David Adjiashvili, Andrea Baggio, Rico Zenklusen
Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms 15 (2) (2019)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. Comb. 39 (6) (2019)
Rico Zenklusen
A 1.5-Approximation for Path TSP. SODA (2019)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO (2019)
Simon Bruggmann, Rico Zenklusen
Submodular Maximization Through the Lens of Linear Programming. Math. Oper. Res. 44 (4) (2019)
Vera Traub, Jens Vygen, Rico Zenklusen
Reducing Path TSP to TSP. CoRR (2019)
Simon Bruggmann, Rico Zenklusen
An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint. CoRR (2019)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. 44 (4) (2019)
Martin Nägele, Rico Zenklusen
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. SODA (2019)
Martin Nägele, Rico Zenklusen
A New Contraction Technique with Applications to Congruency-Constrained Cuts. IPCO (2019)
Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. 32 (1) (2018)
Neil Olver, Rico Zenklusen
Chain-constrained spanning trees. Math. Program. 167 (2) (2018)
Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR (2018)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR (2018)
Moran Feldman, Ola Svensson, Rico Zenklusen
(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Math. Oper. Res. 43 (2) (2018)
Christoph Glanzer, Robert Weismantel, Rico Zenklusen
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. SIAM J. Discret. Math. 32 (3) (2018)
Alfonso Cevallos, Stefan Weltge, Rico Zenklusen
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. SODA (2018)
Moran Feldman, Rico Zenklusen
The Submodular Secretary Problem Goes Linear. SIAM J. Comput. 47 (2) (2018)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. SODA (2018)
Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
Improved approximation for tree augmentation: saving by rewiring. STOC (2018)
Mohit Singh, Rico Zenklusen
k-Trails: recognition, complexity, and approximations. Math. Program. 172 (1-2) (2018)
Jörg Bader, Robert Hildebrand, Robert Weismantel, Rico Zenklusen
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. 169 (2) (2018)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. SODA (2018)
Rico Zenklusen
A 1.5-Approximation for Path TSP. CoRR (2018)
Stephan Artmann, Robert Weismantel, Rico Zenklusen
A strongly polynomial algorithm for bimodular integer linear programming. STOC (2017)
Robert Hildebrand, Robert Weismantel, Rico Zenklusen
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA (2017)
Stephen R. Chestnut, Rico Zenklusen
Hardness and approximation for network flow interdiction. Networks 69 (4) (2017)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Local Search for Max-Sum Diversification. SODA (2017)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. CoRR (2017)
Simon Bruggmann, Rico Zenklusen
Submodular Maximization through the Lens of Linear Programming. CoRR (2017)
Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128 (2017)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. CoRR (2017)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42 (3) (2017)
Stephen R. Chestnut, Rico Zenklusen
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. Math. Oper. Res. 42 (1) (2017)
Alfonso Cevallos, Stefan Weltge, Rico Zenklusen
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. CoRR (2017)
David Adjiashvili, Andrea Baggio, Rico Zenklusen
Firefighting on Trees Beyond Integrality Gaps. SODA (2017)
Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
Extension complexities of Cartesian products involving a pyramid. CoRR (2017)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Max-Sum Diversity Via Convex Programming. SoCG (2016)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Local Search for Max-Sum Diversification. CoRR (2016)
Moran Feldman, Ola Svensson, Rico Zenklusen
Online Contention Resolution Schemes. SODA (2016)
Mohit Singh, Rico Zenklusen
k-Trails: Recognition, Complexity, and Approximations. IPCO (2016)
David Adjiashvili, Andrea Baggio, Rico Zenklusen
Firefighting on Trees Beyond Integrality Gaps. CoRR (2016)
Stephen R. Chestnut, Martin Nägele, Rico Zenklusen
Refuting a conjecture of Goemans on bounded degree spanning trees. Oper. Res. Lett. 44 (6) (2016)
Mohit Singh, Rico Zenklusen
k-Trails: Recognition, Complexity, and Approximations. CoRR (2015)
Moran Feldman, Rico Zenklusen
The Submodular Secretary Problem Goes Linear. FOCS (2015)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Max-sum diversity via convex programming. CoRR (2015)
Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
Congestion games viewed from M-convexity. Oper. Res. Lett. 43 (3) (2015)
Moran Feldman, Ola Svensson, Rico Zenklusen
Online Contention Resolution Schemes. CoRR (2015)
Stefan Wörner, Marco Laumanns, Rico Zenklusen, Apostolos Fertis
Approximate dynamic programming for stochastic linear control problems on compact state spaces. Eur. J. Oper. Res. 241 (1) (2015)
Rico Zenklusen
An O(1)-Approximation for Minimum Spanning Tree Interdiction. FOCS (2015)
Moran Feldman, Ola Svensson, Rico Zenklusen
(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. SODA (2015)
Stephen R. Chestnut, Rico Zenklusen
Hardness and Approximation for Network Flow Interdiction. CoRR (2015)

Rico Zenklusen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rico Zenklusen