default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRico Zenklusen
Person information
- affiliation: ETH Zurich, Department of Mathematics, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]Martin Nägele
, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. Math. Oper. Res. 49(3): 1303-1348 (2024)- [j47]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. Math. Program. 207(1): 515-549 (2024) - [c49]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. SODA 2024: 639-668 - [c48]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-Edge-Connectivity. STOC 2024: 1853-1864 - 2023
- [j46]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): 24:1-24:52 (2023) - [c47]Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly $\varDelta $-Modular IPs. IPCO 2023: 393-407 - [c46]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. IPCO 2023: 423-437 - [c45]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. SOSA 2023: 84-95 - [c44]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. SOSA 2023: 96-102 - [c43]Vera Traub, Rico Zenklusen:
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. STOC 2023: 1820-1833 - [i48]Martin Nägele, Rico Zenklusen:
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. CoRR abs/2301.09340 (2023) - [i47]Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen:
Advances on Strictly Δ-Modular IPs. CoRR abs/2302.07029 (2023) - [i46]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. CoRR abs/2305.05353 (2023) - [i45]Vera Traub, Laura Vargas Koch, Rico Zenklusen:
Single-Source Unsplittable Flows in Planar Graphs. CoRR abs/2308.02651 (2023) - [i44]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-ECSS and k-ECSM. CoRR abs/2311.09941 (2023) - 2022
- [j45]Simon Bruggmann, Rico Zenklusen:
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. Math. Program. 191(2): 795-845 (2022) - [j44]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192(1): 3-27 (2022) - [j43]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. SIAM J. Comput. 51(3): 20-24 (2022) - [j42]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. 51(3): 766-819 (2022) - [c42]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. ESA 2022: 7:1-7:14 - [c41]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA 2022: 52:1-52:14 - [c40]Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. ICALP 2022: 59:1-59:20 - [c39]Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen:
Fair and Fast k-Center Clustering for Data Summarization. ICML 2022: 669-702 - [c38]Martin Nägele, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. SODA 2022: 2743-2790 - [c37]Vera Traub, Rico Zenklusen:
Local Search for Weighted Tree Augmentation and Steiner Tree. SODA 2022: 3253-3272 - [i43]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR abs/2204.05154 (2022) - [i42]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation. CoRR abs/2204.06944 (2022) - [i41]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. CoRR abs/2207.02609 (2022) - [i40]Vera Traub, Rico Zenklusen:
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. CoRR abs/2209.07860 (2022) - [i39]Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
A Simple Combinatorial Algorithm for Robust Matroid Center. CoRR abs/2211.03601 (2022) - [i38]Richard Santiago, Ivan Sergeev, Rico Zenklusen:
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information. CoRR abs/2211.15146 (2022) - 2021
- [j41]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. 50(2): 255-300 (2021) - [c36]Vera Traub, Rico Zenklusen:
A Better-Than-2 Approximation for Weighted Tree Augmentation. FOCS 2021: 1-12 - [c35]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: 196-203 - [c34]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. STOC 2021: 370-383 - [i37]Vera Traub, Rico Zenklusen:
A Better-Than-2 Approximation for Weighted Tree Augmentation. CoRR abs/2104.07114 (2021) - [i36]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR abs/2107.07183 (2021) - [i35]Vera Traub, Rico Zenklusen:
Local Search for Weighted Tree Augmentation and Steiner Tree. CoRR abs/2107.07403 (2021) - [i34]Martin Nägele, Richard Santiago, Rico Zenklusen:
Congruency-Constrained TU Problems Beyond the Bimodular Case. CoRR abs/2109.03148 (2021) - 2020
- [j40]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020) - [j39]Martin Nägele, Rico Zenklusen:
A new contraction technique with applications to congruency-constrained cuts. Math. Program. 183(1): 455-481 (2020) - [c33]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. IPCO 2020: 52-65 - [c32]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing path TSP to TSP. STOC 2020: 14-27 - [c31]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: 1363-1374 - [i33]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR abs/2003.13459 (2020) - [i32]Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
A Technique for Obtaining True Approximations for k-Center with Covering Constraints. CoRR abs/2007.03946 (2020) - [i31]Georg Anegg, Haris Angelidakis, Rico Zenklusen:
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture. CoRR abs/2009.00697 (2020) - [i30]Federica Cecchetto, Vera Traub, Rico Zenklusen:
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. CoRR abs/2012.00086 (2020)
2010 – 2019
- 2019
- [j38]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. Comb. 39(6): 1351-1386 (2019) - [j37]Simon Bruggmann, Rico Zenklusen:
Submodular Maximization Through the Lens of Linear Programming. Math. Oper. Res. 44(4): 1221-1244 (2019) - [j36]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. 44(4): 1494-1509 (2019) - [j35]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. ACM Trans. Algorithms 15(2): 20:1-20:33 (2019) - [c30]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312 - [c29]Martin Nägele, Rico Zenklusen:
A New Contraction Technique with Applications to Congruency-Constrained Cuts. IPCO 2019: 327-340 - [c28]Rico Zenklusen:
A 1.5-Approximation for Path TSP. SODA 2019: 1539-1549 - [c27]Martin Nägele, Rico Zenklusen:
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. SODA 2019: 1550-1569 - [i29]Simon Bruggmann, Rico Zenklusen:
An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint. CoRR abs/1905.08658 (2019) - [i28]Vera Traub, Jens Vygen, Rico Zenklusen:
Reducing Path TSP to TSP. CoRR abs/1907.10376 (2019) - 2018
- [j34]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Math. Oper. Res. 43(2): 638-650 (2018) - [j33]Neil Olver, Rico Zenklusen:
Chain-constrained spanning trees. Math. Program. 167(2): 293-314 (2018) - [j32]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): 565-584 (2018) - [j31]Mohit Singh, Rico Zenklusen:
k-Trails: recognition, complexity, and approximations. Math. Program. 172(1-2): 169-189 (2018) - [j30]Moran Feldman, Rico Zenklusen:
The Submodular Secretary Problem Goes Linear. SIAM J. Comput. 47(2): 330-366 (2018) - [j29]Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen:
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. SIAM J. Discret. Math. 32(1): 352-371 (2018) - [j28]Christoph Glanzer, Robert Weismantel, Rico Zenklusen:
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. SIAM J. Discret. Math. 32(3): 1706-1720 (2018) - [c26]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. SODA 2018: 735-752 - [c25]Alfonso Cevallos, Stefan Weltge, Rico Zenklusen:
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. SODA 2018: 788-807 - [c24]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. SODA 2018: 849-866 - [c23]Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen:
Improved approximation for tree augmentation: saving by rewiring. STOC 2018: 632-645 - [i27]Fabrizio Grandoni, Christos Kalaitzis, Rico Zenklusen:
Improved Approximation for Tree Augmentation: Saving by Rewiring. CoRR abs/1804.02242 (2018) - [i26]Rico Zenklusen:
A 1.5-Approximation for Path TSP. CoRR abs/1805.04131 (2018) - [i25]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR abs/1811.09027 (2018) - 2017
- [j27]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128: 11-13 (2017) - [j26]Stephen R. Chestnut, Rico Zenklusen:
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. Math. Oper. Res. 42(1): 144-166 (2017) - [j25]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42(3): 745-761 (2017) - [j24]Stephen R. Chestnut, Rico Zenklusen:
Hardness and approximation for network flow interdiction. Networks 69(4): 378-387 (2017) - [c22]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Local Search for Max-Sum Diversification. SODA 2017: 130-142 - [c21]Robert Hildebrand, Robert Weismantel, Rico Zenklusen:
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations. SODA 2017: 2342-2350 - [c20]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. SODA 2017: 2364-2383 - [c19]Stephan Artmann, Robert Weismantel, Rico Zenklusen:
A strongly polynomial algorithm for bimodular integer linear programming. STOC 2017: 1206-1219 - [i24]Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. CoRR abs/1702.01959 (2017) - [i23]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. CoRR abs/1704.02608 (2017) - [i22]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. CoRR abs/1707.06212 (2017) - [i21]Simon Bruggmann, Rico Zenklusen:
Submodular Maximization through the Lens of Linear Programming. CoRR abs/1711.11316 (2017) - [i20]Alfonso Cevallos, Stefan Weltge, Rico Zenklusen:
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting. CoRR abs/1712.02176 (2017) - 2016
- [j23]Stephen R. Chestnut, Martin Nägele, Rico Zenklusen:
Refuting a conjecture of Goemans on bounded degree spanning trees. Oper. Res. Lett. 44(6): 766-771 (2016) - [c18]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Max-Sum Diversity Via Convex Programming. SoCG 2016: 26:1-26:14 - [c17]Mohit Singh, Rico Zenklusen:
k-Trails: Recognition, Complexity, and Approximations. IPCO 2016: 114-125 - [c16]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes. SODA 2016: 1014-1033 - [i19]David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. CoRR abs/1601.00271 (2016) - [i18]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Local Search for Max-Sum Diversification. CoRR abs/1607.04557 (2016) - 2015
- [j22]Stefan Woerner, Marco Laumanns, Rico Zenklusen, Apostolos Fertis:
Approximate dynamic programming for stochastic linear control problems on compact state spaces. Eur. J. Oper. Res. 241(1): 85-98 (2015) - [j21]David Adjiashvili, Sebastian Stiller, Rico Zenklusen:
Bulk-Robust combinatorial optimization. Math. Program. 149(1-2): 361-390 (2015) - [j20]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3): 329-333 (2015) - [c15]Moran Feldman, Rico Zenklusen:
The Submodular Secretary Problem Goes Linear. FOCS 2015: 486-505 - [c14]Rico Zenklusen:
An O(1)-Approximation for Minimum Spanning Tree Interdiction. FOCS 2015: 709-728 - [c13]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. SODA 2015: 1189-1201 - [i17]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids are Immune to Braess Paradox. CoRR abs/1504.07545 (2015) - [i16]Moran Feldman, Rico Zenklusen:
The Submodular Secretary Problem Goes Linear. CoRR abs/1507.08384 (2015) - [i15]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes. CoRR abs/1508.00142 (2015) - [i14]Rico Zenklusen:
An O(1)-Approximation for Minimum Spanning Tree Interdiction. CoRR abs/1508.01448 (2015) - [i13]Stephen R. Chestnut, Rico Zenklusen:
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. CoRR abs/1511.02484 (2015) - [i12]Stephen R. Chestnut, Rico Zenklusen:
Hardness and Approximation for Network Flow Interdiction. CoRR abs/1511.02486 (2015) - [i11]Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Max-sum diversity via convex programming. CoRR abs/1511.07077 (2015) - [i10]Mohit Singh, Rico Zenklusen:
k-Trails: Recognition, Complexity, and Approximations. CoRR abs/1512.01781 (2015) - 2014
- [j19]Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen:
New approaches to multi-objective optimization. Math. Program. 146(1-2): 525-554 (2014) - [j18]Rico Zenklusen:
Connectivity interdiction. Oper. Res. Lett. 42(6-7): 450-454 (2014) - [j17]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. 43(6): 1831-1879 (2014) - [c12]David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen:
Time-Expanded Packings. ICALP (1) 2014: 64-76 - [i9]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. CoRR abs/1404.4473 (2014) - 2013
- [j16]Kaspar Schüpbach, Rico Zenklusen:
An adaptive routing approach for personal rapid transit. Math. Methods Oper. Res. 77(3): 371-380 (2013) - [j15]Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen:
Network design with a discrete set of traffic matrices. Oper. Res. Lett. 41(4): 390-396 (2013) - [j14]Nicolai Hähnle, Laura Sanità, Rico Zenklusen:
Stable Routing and Unique-Max Coloring on Trees. SIAM J. Discret. Math. 27(1): 109-125 (2013) - [c11]Patrick Jaillet, José A. Soto, Rico Zenklusen:
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. IPCO 2013: 254-265 - [c10]Neil Olver, Rico Zenklusen:
Chain-Constrained Spanning Trees. IPCO 2013: 324-335 - 2012
- [j13]Bernard Ries, Dominique de Werra, Rico Zenklusen:
A note on chromatic properties of threshold graphs. Discret. Math. 312(10): 1838-1843 (2012) - [j12]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
A flow model based on polylinking system. Math. Program. 135(1-2): 1-23 (2012) - [c9]Rico Zenklusen:
Matroidal degree-bounded minimum spanning trees. SODA 2012: 1512-1521 - [c8]Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen:
Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC 2012: 1161-1176 - [c7]Matthias Mnich, Rico Zenklusen:
Bisections above Tight Lower Bounds. WG 2012: 184-193 - [i8]Patrick Jaillet, José A. Soto, Rico Zenklusen:
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. CoRR abs/1207.1333 (2012) - 2011
- [j11]David Adjiashvili, Rico Zenklusen:
An s-t connection problem with adaptability. Discret. Appl. Math. 159(8): 695-705 (2011) - [j10]Bernard Ries, Rico Zenklusen:
A 2-approximation for the maximum satisfying bisection problem. Eur. J. Oper. Res. 210(2): 169-175 (2011) - [j9]Marco Laumanns, Rico Zenklusen:
Stochastic convergence of random search methods to fixed size Pareto front approximations. Eur. J. Oper. Res. 213(2): 414-421 (2011) - [j8]Rico Zenklusen, Marco Laumanns:
High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks 57(4): 376-388 (2011) - [j7]Gabrio Caimi, Fabián A. Chudak, Martin Fuchsberger, Marco Laumanns, Rico Zenklusen:
A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. Transp. Sci. 45(2): 212-227 (2011) - [c6]Kaspar Schüpbach, Rico Zenklusen:
Approximation Algorithms for Conflict-Free Vehicle Routing. ESA 2011: 640-651 - [c5]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA 2011: 1080-1097 - [c4]Jan Vondrák, Chandra Chekuri, Rico Zenklusen:
Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC 2011: 783-792 - [i7]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. CoRR abs/1105.4593 (2011) - [i6]Rico Zenklusen:
Matroidal Degree-Bounded Minimum Spanning Trees. CoRR abs/1107.5329 (2011) - [i5]Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen:
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. CoRR abs/1111.7280 (2011) - 2010
- [j6]Rico Zenklusen:
Network flow interdiction on planar graphs. Discret. Appl. Math. 158(13): 1441-1455 (2010) - [j5]Rico Zenklusen:
Matching interdiction. Discret. Appl. Math. 158(15): 1676-1690 (2010) - [j4]Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. 310(1): 132-146 (2010) - [c3]Fabrizio Grandoni, Rico Zenklusen:
Approximation Schemes for Multi-Budgeted Independence Systems. ESA (1) 2010: 536-548 - [c2]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS 2010: 575-584 - [i4]Fabrizio Grandoni, Rico Zenklusen:
Optimization with More than One Budget. CoRR abs/1002.2147 (2010)
2000 – 2009
- 2009
- [j3]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j2]Christian Balderer, Michael Guarisco, Marco Laumanns, Rico Zenklusen:
Repair strategies for minimising the risk of cascading failures in electricity networks. Int. J. Crit. Infrastructures 5(1/2): 51-71 (2009) - [j1]Gregory B. Sorkin, Angelika Steger, Rico Zenklusen:
A tight bound on the collection of edges in MSTs of induced subgraphs. J. Comb. Theory B 99(2): 428-435 (2009) - [c1]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
An algorithmic framework for wireless information flow. Allerton 2009: 294-300 - 2008
- [i3]Rico Zenklusen:
Extensions to Network Flow Interdiction on Planar Graphs. CoRR abs/0801.1737 (2008) - [i2]Rico Zenklusen:
Matching Interdiction. CoRR abs/0804.3583 (2008) - 2007
- [i1]Marco Laumanns, Rico Zenklusen:
Estimation of Small s-t Reliabilities in Acyclic Networks. CoRR abs/0707.3231 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
