Rico Zenklusen

Nicolai Hähnle, Laura Sanità, Rico Zenklusen: Stable Routing and Unique-Max Coloring on Trees. SIAM J. Discrete Math. 27(1): 109-125 (2013)

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

Neil Olver, Rico Zenklusen: Chain-Constrained Spanning Trees. IPCO 2013: 324-335

Bernard Ries, Dominique de Werra, Rico Zenklusen: A note on chromatic properties of threshold graphs. Discrete Mathematics 312(10): 1838-1843 (2012)

Michel X. Goemans, Satoru Iwata, Rico Zenklusen: A flow model based on polylinking system. Math. Program. 135(1-2): 1-23 (2012)

Rico Zenklusen: Matroidal degree-bounded minimum spanning trees. SODA 2012: 1512-1521

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

Matthias Mnich, Rico Zenklusen: Bisections above Tight Lower Bounds. WG 2012: 184-193

Patrick Jaillet, José A. Soto, Rico Zenklusen: Advances on Matroid Secretary Problems: Free Order Model and Laminar Case. CoRR abs/1207.1333 (2012)

David Adjiashvili, Rico Zenklusen: An s-t connection problem with adaptability. Discrete Applied Mathematics 159(8): 695-705 (2011)

Bernard Ries, Rico Zenklusen: A 2-approximation for the maximum satisfying bisection problem. European Journal of Operational Research 210(2): 169-175 (2011)

Marco Laumanns, Rico Zenklusen: Stochastic convergence of random search methods to fixed size Pareto front approximations. European Journal of Operational Research 213(2): 414-421 (2011)

Rico Zenklusen, Marco Laumanns: High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks 57(4): 376-388 (2011)

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. Transportation Science 45(2): 212-227 (2011)

Kaspar Schüpbach, Rico Zenklusen: Approximation Algorithms for Conflict-Free Vehicle Routing. ESA 2011: 640-651

Chandra Chekuri, Jan Vondrák, Rico Zenklusen: Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA 2011: 1080-1097

Jan Vondrák, Chandra Chekuri, Rico Zenklusen: Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC 2011: 783-792

Chandra Chekuri, Jan Vondrák, Rico Zenklusen: Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. CoRR abs/1105.4593 (2011)

Rico Zenklusen: Matroidal Degree-Bounded Minimum Spanning Trees. CoRR abs/1107.5329 (2011)

Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen: Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. CoRR abs/1111.7280 (2011)

Rico Zenklusen: Network flow interdiction on planar graphs. Discrete Applied Mathematics 158(13): 1441-1455 (2010)

Rico Zenklusen: Matching interdiction. Discrete Applied Mathematics 158(15): 1676-1690 (2010)

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. Discrete Mathematics 310(1): 132-146 (2010)

Fabrizio Grandoni, Rico Zenklusen: Approximation Schemes for Multi-Budgeted Independence Systems. ESA (1) 2010: 536-548

Chandra Chekuri, Jan Vondrák, Rico Zenklusen: Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS 2010: 575-584

Fabrizio Grandoni, Rico Zenklusen: Optimization with More than One Budget. CoRR abs/1002.2147 (2010)

Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz: Blockers and transversals. Discrete Mathematics 309(13): 4306-4314 (2009)

Christian Balderer, Michael Guarisco, Marco Laumanns, Rico Zenklusen: Repair strategies for minimising the risk of cascading failures in electricity networks. IJCIS 5(1/2): 51-71 (2009)

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

Rico Zenklusen: Extensions to Network Flow Interdiction on Planar Graphs. CoRR abs/0801.1737 (2008)

Rico Zenklusen: Matching Interdiction. CoRR abs/0804.3583 (2008)

Marco Laumanns, Rico Zenklusen: Estimation of Small s-t Reliabilities in Acyclic Networks. CoRR abs/0707.3231 (2007)