Estimation of Small s-t Reliabilities in Acyclic Networks - Marco Laumanns; Rico Zenklusen (CoRR, 2007)

Extensions to Network Flow Interdiction on Planar Graphs - Rico Zenklusen (CoRR, 2008)

An algorithmic framework for wireless information flow. - Michel X. Goemans; Satoru Iwata 001; Rico Zenklusen (Allerton, 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

Repair strategies for minimising the risk of cascading failures in electricity networks. - Christian Balderer; Michael Guarisco; Marco Laumanns; Rico Zenklusen (Int. J. Crit. Infrastructures, 2009)

A tight bound on the collection of edges in MSTs of induced subgraphs. - Gregory B. Sorkin; Angelika Steger; Rico Zenklusen (J. Comb. Theory B, 2009)

Approximation Schemes for Multi-Budgeted Independence Systems. - Fabrizio Grandoni 001; Rico Zenklusen (ESA (1), 2010)

Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. - Chandra Chekuri; Jan Vondrák; Rico Zenklusen (FOCS, 2010)

Optimization with More than One Budget - Fabrizio Grandoni 001; Rico Zenklusen (CoRR, 2010)

Network flow interdiction on planar graphs. - Rico Zenklusen (Discret. Appl. Math., 2010)

Matching interdiction. - Rico Zenklusen (Discret. Appl. Math., 2010)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Approximation Algorithms for Conflict-Free Vehicle Routing. - Kaspar Schüpbach; Rico Zenklusen (ESA, 2011)

Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. - Chandra Chekuri; Jan Vondrák; Rico Zenklusen (SODA, 2011)

An s-t connection problem with adaptability. - David Adjiashvili; Rico Zenklusen (Discret. Appl. Math., 2011)

Stochastic convergence of random search methods to fixed size Pareto front approximations. - Marco Laumanns; Rico Zenklusen (Eur. J. Oper. Res., 2011)

A 2-approximation for the maximum satisfying bisection problem. - Bernard Ries; Rico Zenklusen (Eur. J. Oper. Res., 2011)

High-confidence estimation of small s-t reliabilities in directed acyclic networks. - Rico Zenklusen; Marco Laumanns (Networks, 2011)

A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. - Gabrio Caimi; Fabián A. Chudak; Martin Fuchsberger; Marco Laumanns; Rico Zenklusen (Transp. Sci., 2011)

Matroidal degree-bounded minimum spanning trees. - Rico Zenklusen (SODA, 2012)

Matroids and integrality gaps for hypergraphic steiner tree relaxations. - Michel X. Goemans; Neil Olver; Thomas Rothvoß; Rico Zenklusen (STOC, 2012)

Bisections above Tight Lower Bounds. - Matthias Mnich; Rico Zenklusen (WG, 2012)

A note on chromatic properties of threshold graphs. - Bernard Ries; Dominique de Werra; Rico Zenklusen (Discret. Math., 2012)

A flow model based on polylinking system. - Michel X. Goemans; Satoru Iwata 001; Rico Zenklusen (Math. Program., 2012)

Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. - Patrick Jaillet; José A. Soto; Rico Zenklusen (IPCO, 2013)

An adaptive routing approach for personal rapid transit. - Kaspar Schüpbach; Rico Zenklusen (Math. Methods Oper. Res., 2013)

Network design with a discrete set of traffic matrices. - Gianpaolo Oriolo; Laura Sanità; Rico Zenklusen (Oper. Res. Lett., 2013)

Stable Routing and Unique-Max Coloring on Trees. - Nicolai Hähnle; Laura Sanità; Rico Zenklusen (SIAM J. Discret. Math., 2013)

Time-Expanded Packings. - David Adjiashvili; Sandro Bosio; Robert Weismantel; Rico Zenklusen (ICALP (1), 2014)

A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2014)

New approaches to multi-objective optimization. - Fabrizio Grandoni 001; R. Ravi 001; Mohit Singh; Rico Zenklusen (Math. Program., 2014)

Connectivity interdiction. - Rico Zenklusen (Oper. Res. Lett., 2014)

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. - Chandra Chekuri; Jan Vondrák; Rico Zenklusen (SIAM J. Comput., 2014)

An O(1)-Approximation for Minimum Spanning Tree Interdiction. - Rico Zenklusen (FOCS, 2015)

Approximate dynamic programming for stochastic linear control problems on compact state spaces. - Stefan Woerner; Marco Laumanns; Rico Zenklusen; Apostolos Fertis (Eur. J. Oper. Res., 2015)

Bulk-Robust combinatorial optimization. - David Adjiashvili; Sebastian Stiller; Rico Zenklusen (Math. Program., 2015)

Congestion games viewed from M-convexity. - Satoru Fujishige; Michel X. Goemans; Tobias Harks; Britta Peis; Rico Zenklusen (Oper. Res. Lett., 2015)

Max-Sum Diversity Via Convex Programming. - Alfonso Cevallos; Friedrich Eisenbrand; Rico Zenklusen (SoCG, 2016)

Online Contention Resolution Schemes. - Moran Feldman; Ola Svensson; Rico Zenklusen (SODA, 2016)

Refuting a conjecture of Goemans on bounded degree spanning trees. - Stephen R. Chestnut; Martin Nägele; Rico Zenklusen (Oper. Res. Lett., 2016)

Local Search for Max-Sum Diversification. - Alfonso Cevallos; Friedrich Eisenbrand; Rico Zenklusen (SODA, 2017)

Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. - Robert Hildebrand; Robert Weismantel; Rico Zenklusen (SODA, 2017)

A strongly polynomial algorithm for bimodular integer linear programming. - Stephan Artmann; Robert Weismantel; Rico Zenklusen (STOC, 2017)

Extension complexities of Cartesian products involving a pyramid. - Hans Raj Tiwary; Stefan Weltge; Rico Zenklusen (Inf. Process. Lett., 2017)

Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. - Stephen R. Chestnut; Rico Zenklusen (Math. Oper. Res., 2017)

Matroids Are Immune to Braess' Paradox. - Satoru Fujishige; Michel X. Goemans; Tobias Harks; Britta Peis; Rico Zenklusen (Math. Oper. Res., 2017)

Hardness and approximation for network flow interdiction. - Stephen R. Chestnut; Rico Zenklusen (Networks, 2017)

Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. - Alfonso Cevallos; Stefan Weltge; Rico Zenklusen (SODA, 2018)

Improved approximation for tree augmentation: saving by rewiring. - Fabrizio Grandoni 001; Christos Kalaitzis; Rico Zenklusen (STOC, 2018)

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (Math. Oper. Res., 2018)

Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. - Jörg Bader; Robert Hildebrand; Robert Weismantel; Rico Zenklusen (Math. Program., 2018)

Chain-constrained spanning trees. - Neil Olver; Rico Zenklusen (Math. Program., 2018)

k-Trails: recognition, complexity, and approximations. - Mohit Singh; Rico Zenklusen (Math. Program., 2018)

The Submodular Secretary Problem Goes Linear. - Moran Feldman; Rico Zenklusen (SIAM J. Comput., 2018)

Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. - Stephen R. Chestnut; Robert Hildebrand; Rico Zenklusen (SIAM J. Discret. Math., 2018)

On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. - Christoph Glanzer; Robert Weismantel; Rico Zenklusen (SIAM J. Discret. Math., 2018)

A 1.5-Approximation for Path TSP. - Rico Zenklusen (SODA, 2019)

Submodular Minimization Under Congruency Constraints. - Martin Nägele; Benny Sudakov; Rico Zenklusen (Comb., 2019)

Submodular Maximization Through the Lens of Linear Programming. - Simon Bruggmann; Rico Zenklusen (Math. Oper. Res., 2019)

An Improved Analysis of Local Search for Max-Sum Diversification. - Alfonso Cevallos; Friedrich Eisenbrand; Rico Zenklusen (Math. Oper. Res., 2019)

Firefighting on Trees Beyond Integrality Gaps. - David Adjiashvili; Andrea Baggio; Rico Zenklusen (ACM Trans. Algorithms, 2019)

Approximate multi-matroid intersection via iterative refinement. - André Linhares; Neil Olver; Chaitanya Swamy; Rico Zenklusen (Math. Program., 2020)

A new contraction technique with applications to congruency-constrained cuts. - Martin Nägele; Rico Zenklusen (Math. Program., 2020)

A Better-Than-2 Approximation for Weighted Tree Augmentation. - Vera Traub; Rico Zenklusen (FOCS, 2021)

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. - Georg Anegg; Haris Angelidakis; Rico Zenklusen (SOSA, 2021)

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. - Federica Cecchetto; Vera Traub; Rico Zenklusen (STOC, 2021)

Streaming Submodular Maximization with Matroid and Matching Constraints. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (CoRR, 2021)

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2021)

Techniques for Generalized Colorful k-Center Problems. - Georg Anegg; Laura Vargas Koch; Rico Zenklusen (ESA, 2022)

Submodular Maximization Subject to Matroid Intersection on the Fly. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ESA, 2022)

Streaming Submodular Maximization Under Matroid Constraints. - Moran Feldman; Paul Liu 001; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ICALP, 2022)

Fair and Fast k-Center Clustering for Data Summarization. - Haris Angelidakis; Adam Kurpisz; Leon Sering; Rico Zenklusen (ICML, 2022)

Local Search for Weighted Tree Augmentation and Steiner Tree. - Vera Traub; Rico Zenklusen (SODA, 2022)

Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. - Federica Cecchetto; Vera Traub; Rico Zenklusen (CoRR, 2022)

A technique for obtaining true approximations for k-center with covering constraints. - Georg Anegg; Haris Angelidakis; Adam Kurpisz; Rico Zenklusen (Math. Program., 2022)

An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. - Simon Bruggmann; Rico Zenklusen (Math. Program., 2022)

A Framework for the Secretary Problem on the Intersection of Matroids. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2022)

Reducing Path TSP to TSP. - Vera Traub; Jens Vygen; Rico Zenklusen (SIAM J. Comput., 2022)

Advances on Strictly $ varDelta $-Modular IPs. - Martin Nägele; Christian Nöbel; Richard Santiago; Rico Zenklusen (IPCO, 2023)

A Simple Combinatorial Algorithm for Robust Matroid Center. - Georg Anegg; Laura Vargas Koch; Rico Zenklusen (SOSA, 2023)

Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. - Richard Santiago; Ivan Sergeev; Rico Zenklusen (SOSA, 2023)

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. - Vera Traub; Rico Zenklusen (STOC, 2023)

Ghost Value Augmentation for k-ECSS and k-ECSM. - D. Ellis Hershkowitz; Nathan Klein; Rico Zenklusen (CoRR, 2023)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (J. ACM, 2023)

Single-Source Unsplittable Flows in Planar Graphs. - Vera Traub; Laura Vargas Koch; Rico Zenklusen (SODA, 2024)

Ghost Value Augmentation for k-Edge-Connectivity. - D. Ellis Hershkowitz; Nathan Klein; Rico Zenklusen (STOC, 2024)

Congruency-Constrained TU Problems Beyond the Bimodular Case. - Martin Nägele; Richard Santiago; Rico Zenklusen (Math. Oper. Res., 2024)

A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. - Martin Nägele; Rico Zenklusen (Math. Oper. Res., 2024)

Better-than-$ frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. - Federica Cecchetto; Vera Traub; Rico Zenklusen (Math. Program., 2024)

Advances on strictly Δ-modular IPs. - Martin Nägele; Christian Nöbel; Richard Santiago; Rico Zenklusen (Math. Program., 2025)

Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. - Richard Santiago; Ivan Sergeev; Rico Zenklusen (Math. Program., 2025)

Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. - Vera Traub; Rico Zenklusen (J. ACM, 2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2025)