Rico Zenklusen
Orcid: 0000-0002-7148-9304Affiliations:
- ETH Zurich, Department of Mathematics, Switzerland
According to our database1,
Rico Zenklusen
authored at least 91 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation.
Math. Program., September, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness.
J. ACM, August, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
2022
SIAM J. Comput., 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint.
Math. Program., 2022
A technique for obtaining true approximations for k-center with covering constraints.
Math. Program., 2022
CoRR, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems.
SIAM J. Comput., 2021
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Math. Program., 2020
Math. Program., 2020
2019
Math. Oper. Res., 2019
Math. Oper. Res., 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
SIAM J. Discret. Math., 2018
SIAM J. Discret. Math., 2018
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix.
Math. Program., 2018
A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.
Math. Oper. Res., 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
Math. Oper. Res., 2017
Inf. Process. Lett., 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
Oper. Res. Lett., 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
Approximate dynamic programming for stochastic linear control problems on compact state spaces.
Eur. J. Oper. Res., 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes.
SIAM J. Comput., 2014
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.
CoRR, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Math. Methods Oper. Res., 2013
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling.
Transp. Sci., 2011
High-confidence estimation of small <i>s</i>-<i>t</i> reliabilities in directed acyclic networks.
Networks, 2011
Eur. J. Oper. Res., 2011
Stochastic convergence of random search methods to fixed size Pareto front approximations.
Eur. J. Oper. Res., 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.
Discret. Math., 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Proceedings of the Algorithms, 2010
2009
J. Comb. Theory B, 2009
Repair strategies for minimising the risk of cascading failures in electricity networks.
Int. J. Crit. Infrastructures, 2009
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
2007