Rico Zenklusen

157 papers A* 32A 3B 9Journal 106Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Nearly Tight Sample Complexity for Matroid Online Contention Resolution. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2026	J	`jnl`	On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope. CoRR Martin Nägele, Christian Nöbel, Rico Zenklusen
2026	J	`jnl`	Streaming Submodular Maximization Under Matroid Constraints. Math. Oper. Res. Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2026	—	`conf`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. SOSA Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2025	J	`jnl`	Advances on strictly Δ-modular IPs. Math. Program. Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2025	J	`jnl`	Approximation Schemes for Planar Graph Connectivity Problems. CoRR Meike Neuwohner, Vera Traub, Rico Zenklusen
2025	J	`jnl`	Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. J. ACM Vera Traub, Rico Zenklusen
2025	J	`jnl`	Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. Math. Program. Richard Santiago, Ivan Sergeev, Rico Zenklusen
2025	J	`jnl`	Nearly Tight Sample Complexity for Matroid Online Contention Resolution. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2025	J	`jnl`	Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center. CoRR Jannis Blauth, Christian Nöbel, Rico Zenklusen
2025	J	`jnl`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. CoRR Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2024	J	`jnl`	A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. Math. Oper. Res. Martin Nägele, Rico Zenklusen
2024	J	`jnl`	Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. Federica Cecchetto, Vera Traub, Rico Zenklusen
2024	J	`jnl`	Congruency-Constrained TU Problems Beyond the Bimodular Case. Math. Oper. Res. Martin Nägele, Richard Santiago, Rico Zenklusen
2024	A*	`conf`	Ghost Value Augmentation for k-Edge-Connectivity. STOC D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
2024	A*	`conf`	Single-Source Unsplittable Flows in Planar Graphs. SODA Vera Traub, Laura Vargas Koch, Rico Zenklusen
2023	A*	`conf`	A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC Vera Traub, Rico Zenklusen
2023	J	`jnl`	A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. CoRR Martin Nägele, Rico Zenklusen
2023	—	`conf`	A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA Georg Anegg, Laura Vargas Koch, Rico Zenklusen
2023	B	`conf`	Advances on Strictly $\varDelta $-Modular IPs. IPCO Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2023	J	`jnl`	Advances on Strictly Δ-Modular IPs. CoRR Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2023	B	`conf`	Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. IPCO Richard Santiago, Ivan Sergeev, Rico Zenklusen
2023	J	`jnl`	Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. CoRR Richard Santiago, Ivan Sergeev, Rico Zenklusen
2023	J	`jnl`	Ghost Value Augmentation for k-ECSS and k-ECSM. CoRR D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
2023	—	`conf`	Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. SOSA Richard Santiago, Ivan Sergeev, Rico Zenklusen
2023	J	`jnl`	Single-Source Unsplittable Flows in Planar Graphs. CoRR Vera Traub, Laura Vargas Koch, Rico Zenklusen
2023	J	`jnl`	The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	J	`jnl`	A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR Vera Traub, Rico Zenklusen
2022	J	`jnl`	A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. Moran Feldman, Ola Svensson, Rico Zenklusen
2022	J	`jnl`	A Simple Combinatorial Algorithm for Robust Matroid Center. CoRR Georg Anegg, Laura Vargas Koch, Rico Zenklusen
2022	J	`jnl`	A technique for obtaining true approximations for k-center with covering constraints. Math. Program. Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2022	J	`jnl`	An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. Math. Program. Simon Bruggmann, Rico Zenklusen
2022	J	`jnl`	Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR Federica Cecchetto, Vera Traub, Rico Zenklusen
2022	A*	`conf`	Congruency-Constrained TU Problems Beyond the Bimodular Case. SODA Martin Nägele, Richard Santiago, Rico Zenklusen
2022	A*	`conf`	Fair and Fast k-Center Clustering for Data Summarization. ICML Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
2022	A*	`conf`	Local Search for Weighted Tree Augmentation and Steiner Tree. SODA Vera Traub, Rico Zenklusen
2022	J	`jnl`	Reducing Path TSP to TSP. SIAM J. Comput. Vera Traub, Jens Vygen, Rico Zenklusen
2022	J	`jnl`	Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. CoRR Richard Santiago, Ivan Sergeev, Rico Zenklusen
2022	A*	`conf`	Streaming Submodular Maximization Under Matroid Constraints. ICALP Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	A	`conf`	Submodular Maximization Subject to Matroid Intersection on the Fly. ESA Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	J	`jnl`	Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	A	`conf`	Techniques for Generalized Colorful k-Center Problems. ESA Georg Anegg, Laura Vargas Koch, Rico Zenklusen
2022	J	`jnl`	Techniques for Generalized Colorful k-Center Problems. CoRR Georg Anegg, Laura Vargas Koch, Rico Zenklusen
2021	A*	`conf`	A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS Vera Traub, Rico Zenklusen
2021	J	`jnl`	A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR Vera Traub, Rico Zenklusen
2021	A*	`conf`	Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC Federica Cecchetto, Vera Traub, Rico Zenklusen
2021	J	`jnl`	Congruency-Constrained TU Problems Beyond the Bimodular Case. CoRR Martin Nägele, Richard Santiago, Rico Zenklusen
2021	J	`jnl`	Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR Vera Traub, Rico Zenklusen
2021	J	`jnl`	Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. Moran Feldman, Ola Svensson, Rico Zenklusen
2021	—	`conf`	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. SOSA Georg Anegg, Haris Angelidakis, Rico Zenklusen
2021	J	`jnl`	Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2020	B	`conf`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
2020	J	`jnl`	A new contraction technique with applications to congruency-constrained cuts. Math. Program. Martin Nägele, Rico Zenklusen
2020	J	`jnl`	Approximate multi-matroid intersection via iterative refinement. Math. Program. André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2020	J	`jnl`	Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR Federica Cecchetto, Vera Traub, Rico Zenklusen
2020	A*	`conf`	Reducing path TSP to TSP. STOC Vera Traub, Jens Vygen, Rico Zenklusen
2020	J	`jnl`	Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR Georg Anegg, Haris Angelidakis, Rico Zenklusen
2020	J	`jnl`	The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2020	A*	`conf`	The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2019	A*	`conf`	A 1.5-Approximation for Path TSP. SODA Rico Zenklusen
2019	B	`conf`	A New Contraction Technique with Applications to Congruency-Constrained Cuts. IPCO Martin Nägele, Rico Zenklusen
2019	A*	`conf`	A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. SODA Martin Nägele, Rico Zenklusen
2019	J	`jnl`	An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
2019	J	`jnl`	An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint. CoRR Simon Bruggmann, Rico Zenklusen
2019	B	`conf`	Approximate Multi-matroid Intersection via Iterative Refinement. IPCO André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2019	J	`jnl`	Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms David Adjiashvili, Andrea Baggio, Rico Zenklusen
2019	J	`jnl`	Reducing Path TSP to TSP. CoRR Vera Traub, Jens Vygen, Rico Zenklusen
2019	J	`jnl`	Submodular Maximization Through the Lens of Linear Programming. Math. Oper. Res. Simon Bruggmann, Rico Zenklusen
2019	J	`jnl`	Submodular Minimization Under Congruency Constraints. Comb. Martin Nägele, Benny Sudakov, Rico Zenklusen
2018	J	`jnl`	A 1.5-Approximation for Path TSP. CoRR Rico Zenklusen
2018	A*	`conf`	A Framework for the Secretary Problem on the Intersection of Matroids. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2018	J	`jnl`	A Simple Math. Oper. Res. Moran Feldman, Ola Svensson, Rico Zenklusen
2018	J	`jnl`	Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2018	J	`jnl`	Chain-constrained spanning trees. Math. Program. Neil Olver, Rico Zenklusen
2018	J	`jnl`	Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
2018	A*	`conf`	Improved approximation for tree augmentation: saving by rewiring. STOC Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen
2018	A*	`conf`	Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. SODA Alfonso Cevallos, Stefan Weltge, Rico Zenklusen
2018	J	`jnl`	Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. Jörg Bader, Robert Hildebrand, Robert Weismantel, Rico Zenklusen
2018	J	`jnl`	On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. SIAM J. Discret. Math. Christoph Glanzer, Robert Weismantel, Rico Zenklusen
2018	J	`jnl`	Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen
2018	A*	`conf`	Submodular Minimization Under Congruency Constraints. SODA Martin Nägele, Benny Sudakov, Rico Zenklusen
2018	J	`jnl`	The Submodular Secretary Problem Goes Linear. SIAM J. Comput. Moran Feldman, Rico Zenklusen
2018	J	`jnl`	k-Trails: recognition, complexity, and approximations. Math. Program. Mohit Singh, Rico Zenklusen
2017	J	`jnl`	A Framework for the Secretary Problem on the Intersection of Matroids. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2017	A*	`conf`	A strongly polynomial algorithm for bimodular integer linear programming. STOC Stephan Artmann, Robert Weismantel, Rico Zenklusen
2017	A*	`conf`	Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA Robert Hildebrand, Robert Weismantel, Rico Zenklusen
2017	J	`jnl`	Extension complexities of Cartesian products involving a pyramid. CoRR Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
2017	J	`jnl`	Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
2017	A*	`conf`	Firefighting on Trees Beyond Integrality Gaps. SODA David Adjiashvili, Andrea Baggio, Rico Zenklusen
2017	J	`jnl`	Hardness and approximation for network flow interdiction. Networks Stephen R. Chestnut, Rico Zenklusen
2017	J	`jnl`	Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. Math. Oper. Res. Stephen R. Chestnut, Rico Zenklusen
2017	J	`jnl`	Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. CoRR Alfonso Cevallos, Stefan Weltge, Rico Zenklusen
2017	A*	`conf`	Local Search for Max-Sum Diversification. SODA Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
2017	J	`jnl`	Matroids Are Immune to Braess' Paradox. Math. Oper. Res. Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2017	J	`jnl`	Submodular Maximization through the Lens of Linear Programming. CoRR Simon Bruggmann, Rico Zenklusen
2017	J	`jnl`	Submodular Minimization Under Congruency Constraints. CoRR Martin Nägele, Benny Sudakov, Rico Zenklusen
2016	J	`jnl`	Firefighting on Trees Beyond Integrality Gaps. CoRR David Adjiashvili, Andrea Baggio, Rico Zenklusen
2016	J	`jnl`	Local Search for Max-Sum Diversification. CoRR Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
2016	A*	`conf`	Max-Sum Diversity Via Convex Programming. SoCG Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
2016	A*	`conf`	Online Contention Resolution Schemes. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2016	J	`jnl`	Refuting a conjecture of Goemans on bounded degree spanning trees. Oper. Res. Lett. Stephen R. Chestnut, Martin Nägele, Rico Zenklusen
2016	B	`conf`	k-Trails: Recognition, Complexity, and Approximations. IPCO Mohit Singh, Rico Zenklusen
2015	A*	`conf`	A Simple SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2015	A*	`conf`	An O(1)-Approximation for Minimum Spanning Tree Interdiction. FOCS Rico Zenklusen
2015	J	`jnl`	An O(1)-Approximation for Minimum Spanning Tree Interdiction. CoRR Rico Zenklusen
2015	J	`jnl`	Approximate dynamic programming for stochastic linear control problems on compact state spaces. Eur. J. Oper. Res. Stefan Woerner, Marco Laumanns, Rico Zenklusen, Apostolos Fertis
2015	J	`jnl`	Bulk-Robust combinatorial optimization. Math. Program. David Adjiashvili, Sebastian Stiller, Rico Zenklusen
2015	J	`jnl`	Congestion games viewed from M-convexity. Oper. Res. Lett. Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2015	J	`jnl`	Hardness and Approximation for Network Flow Interdiction. CoRR Stephen R. Chestnut, Rico Zenklusen
2015	J	`jnl`	Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. CoRR Stephen R. Chestnut, Rico Zenklusen
2015	J	`jnl`	Matroids are Immune to Braess Paradox. CoRR Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen
2015	J	`jnl`	Max-sum diversity via convex programming. CoRR Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
2015	J	`jnl`	Online Contention Resolution Schemes. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2015	A*	`conf`	The Submodular Secretary Problem Goes Linear. FOCS Moran Feldman, Rico Zenklusen
2015	J	`jnl`	The Submodular Secretary Problem Goes Linear. CoRR Moran Feldman, Rico Zenklusen
2015	J	`jnl`	k-Trails: Recognition, Complexity, and Approximations. CoRR Mohit Singh, Rico Zenklusen
2014	J	`jnl`	A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2014	J	`jnl`	Connectivity interdiction. Oper. Res. Lett. Rico Zenklusen
2014	J	`jnl`	New approaches to multi-objective optimization. Math. Program. Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen
2014	J	`jnl`	Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2014	—	`conf`	Time-Expanded Packings. ICALP (1) David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen
2013	B	`conf`	Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. IPCO Patrick Jaillet, José A. Soto, Rico Zenklusen
2013	J	`jnl`	An adaptive routing approach for personal rapid transit. Math. Methods Oper. Res. Kaspar Schüpbach, Rico Zenklusen
2013	B	`conf`	Chain-Constrained Spanning Trees. IPCO Neil Olver, Rico Zenklusen
2013	J	`jnl`	Network design with a discrete set of traffic matrices. Oper. Res. Lett. Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen
2013	J	`jnl`	Stable Routing and Unique-Max Coloring on Trees. SIAM J. Discret. Math. Nicolai Hähnle, Laura Sanità, Rico Zenklusen
2012	J	`jnl`	A flow model based on polylinking system. Math. Program. Michel X. Goemans, Satoru Iwata, Rico Zenklusen
2012	J	`jnl`	A note on chromatic properties of threshold graphs. Discret. Math. Bernard Ries, Dominique de Werra, Rico Zenklusen
2012	J	`jnl`	Advances on Matroid Secretary Problems: Free Order Model and Laminar Case CoRR Patrick Jaillet, José A. Soto, Rico Zenklusen
2012	B	`conf`	Bisections above Tight Lower Bounds. WG Matthias Mnich, Rico Zenklusen
2012	A*	`conf`	Matroidal degree-bounded minimum spanning trees. SODA Rico Zenklusen
2012	A*	`conf`	Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
2011	J	`jnl`	A 2-approximation for the maximum satisfying bisection problem. Eur. J. Oper. Res. Bernard Ries, Rico Zenklusen
2011	J	`jnl`	A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. Transp. Sci. Gabrio Caimi, Fabián A. Chudak, Martin Fuchsberger, Marco Laumanns, Rico Zenklusen
2011	J	`jnl`	An s-t connection problem with adaptability. Discret. Appl. Math. David Adjiashvili, Rico Zenklusen
2011	A	`conf`	Approximation Algorithms for Conflict-Free Vehicle Routing. ESA Kaspar Schüpbach, Rico Zenklusen
2011	J	`jnl`	High-confidence estimation of small Networks Rico Zenklusen, Marco Laumanns
2011	J	`jnl`	Matroidal Degree-Bounded Minimum Spanning Trees CoRR Rico Zenklusen
2011	J	`jnl`	Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations CoRR Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
2011	A*	`conf`	Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2011	J	`jnl`	Stochastic convergence of random search methods to fixed size Pareto front approximations. Eur. J. Oper. Res. Marco Laumanns, Rico Zenklusen
2011	J	`jnl`	Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes CoRR Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2011	A*	`conf`	Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC Jan Vondrák, Chandra Chekuri, Rico Zenklusen
2010	—	`conf`	Approximation Schemes for Multi-Budgeted Independence Systems. ESA (1) Fabrizio Grandoni, Rico Zenklusen
2010	J	`jnl`	Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen
2010	A*	`conf`	Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2010	J	`jnl`	Matching interdiction. Discret. Appl. Math. Rico Zenklusen
2010	J	`jnl`	Network flow interdiction on planar graphs. Discret. Appl. Math. Rico Zenklusen
2010	J	`jnl`	Optimization with More than One Budget CoRR Fabrizio Grandoni, Rico Zenklusen
2009	J	`jnl`	A tight bound on the collection of edges in MSTs of induced subgraphs. J. Comb. Theory B Gregory B. Sorkin, Angelika Steger, Rico Zenklusen
2009	—	`conf`	An algorithmic framework for wireless information flow. Allerton Michel X. Goemans, Satoru Iwata, Rico Zenklusen
2009	J	`jnl`	Blockers and transversals. Discret. Math. Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz
2009	J	`jnl`	Repair strategies for minimising the risk of cascading failures in electricity networks. Int. J. Crit. Infrastructures Christian Balderer, Michael Guarisco, Marco Laumanns, Rico Zenklusen
2008	J	`jnl`	Extensions to Network Flow Interdiction on Planar Graphs CoRR Rico Zenklusen
2008	J	`jnl`	Matching Interdiction CoRR Rico Zenklusen
2007	J	`jnl`	Estimation of Small s-t Reliabilities in Acyclic Networks CoRR Marco Laumanns, Rico Zenklusen