Rico Zenklusen

Citée par

	Toutes	Depuis 2020
Citations	3489	2028
indice h	33	26
indice i10	63	50

500

250

125

375

201020112012201320142015201620172018201920202021202220232024202546 65 75 96 114 142 136 233 237 263 268 333 413 447 491 61

Accès public

Tout afficher

52 articles

5 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Moran FeldmanUniversity of HaifaAdresse e-mail validée de cs.haifa.ac.il
Ola SvenssonEPFLAdresse e-mail validée de epfl.ch
Marco LaumannsAdresse e-mail validée de ethz.ch
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignAdresse e-mail validée de illinois.edu
Michel GoemansRSA Professor of Mathematics, MITAdresse e-mail validée de math.mit.edu
Bernard RiesProfessor, University of FribourgAdresse e-mail validée de unifr.ch
Martin NägeleUniversity of BonnAdresse e-mail validée de or.uni-bonn.de
Neil OlverLondon School of Economics and Political ScienceAdresse e-mail validée de lse.ac.uk
Alfonso CevallosWeb3 FoundationAdresse e-mail validée de web3.foundation
Christophe PicouleauProfesseur Cedric-CNAMAdresse e-mail validée de cnam.fr
Satoru IwataUniversity of TokyoAdresse e-mail validée de mist.i.u-tokyo.ac.jp
Mohit SinghProfessor, Georgia Institute of TechnologyAdresse e-mail validée de gatech.edu
Tobias HarksProfessor of Mathematical Optimization, University of PassauAdresse e-mail validée de uni-passau.de
R RaviCarnegie Mellon UnviersityAdresse e-mail validée de andrew.cmu.edu
Patrick JailletDugald C. Jackson Professor, EECS, MITAdresse e-mail validée de mit.edu
Stefan WeltgeProfessor at Technical University of MunichAdresse e-mail validée de tum.de
Sebastian StillerTechnische Universität BraunschweigAdresse e-mail validée de tu-braunschweig.de
Benjamin SudakovETH, ZurichAdresse e-mail validée de math.ethz.ch
Laura SanitàAssociate Professor, Bocconi University of MilanAdresse e-mail validée de unibocconi.it
Matthias MnichTU HamburgAdresse e-mail validée de tuhh.de

Suivre

Rico Zenklusen

ETH Zurich

Adresse e-mail validée de math.ethz.ch - Page d'accueil

Combinatorial Optimization Operations Research Theoretical Computer Science


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Submodular function maximization via the multilinear relaxation and contention resolution schemes C Chekuri, J Vondrák, R Zenklusen SIAM Journal on Computing 43 (6), 1831-1879, 2014	425	2014
Dependent randomized rounding via exchange properties of combinatorial structures C Chekuri, J Vondrák, R Zenklusen Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010	288	2010
Online contention resolution schemes M Feldman, O Svensson, R Zenklusen Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	145	2016
A simple O (log log (rank))-competitive algorithm for the matroid secretary problem M Feldman, O Svensson, R Zenklusen Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015	138	2015
A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling G Caimi, F Chudak, M Fuchsberger, M Laumanns, R Zenklusen Transportation science 45 (2), 212-227, 2011	119	2011
Matching interdiction R Zenklusen Discrete Applied Mathematics 158 (15), 1676-1690, 2010	111	2010
Multi-budgeted matchings and matroid intersection via dependent rounding C Chekuri, J Vondrák, R Zenklusen Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	96	2011
A strongly polynomial algorithm for bimodular integer linear programming S Artmann, R Weismantel, R Zenklusen Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	89	2017
Dependent randomized rounding for matroid polytopes and applications C Chekuri, J Vondrak, R Zenklusen Arxiv preprint arXiv:0909.4348, 2009	84*	2009
Blockers and transversals R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz Discrete Mathematics 309 (13), 4306-4314, 2009	79	2009
Matroids and integrality gaps for hypergraphic steiner tree relaxations MX Goemans, N Olver, T Rothvoß, R Zenklusen Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	76	2012
Stochastic convergence of random search methods to fixed size Pareto front approximations M Laumanns, R Zenklusen European Journal of Operational Research 213 (2), 414-421, 2011	71	2011
The one-way communication complexity of submodular maximization with applications to streaming and robustness M Feldman, A Norouzi-Fard, O Svensson, R Zenklusen Journal of the ACM 70 (4), 1-52, 2023	69	2023
Network flow interdiction on planar graphs R Zenklusen Discrete Applied Mathematics 158 (13), 1441-1455, 2010	66	2010
A 1.5-approximation for path TSP R Zenklusen Proceedings of the thirtieth annual ACM-SIAM symposium on discrete …, 2019	65	2019
New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming 146, 525-554, 2014	63	2014
Advances on matroid secretary problems: Free order model and laminar case P Jaillet, JA Soto, R Zenklusen International Conference on Integer Programming and Combinatorial …, 2013	61	2013
Improved approximation for tree augmentation: saving by rewiring F Grandoni, C Kalaitzis, R Zenklusen Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	58	2018
An algorithmic framework for wireless information flow MX Goemans, S Iwata, R Zenklusen 2009 47th Annual Allerton Conference on Communication, Control, and …, 2009	58	2009
The submodular secretary problem goes linear M Feldman, R Zenklusen SIAM Journal on Computing 47 (2), 330-366, 2018	56	2018

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs