Heiko Röglin

Citat de

	Toate	Din 2019
Referințe bibliografice	2226	879
h-index	25	14
i10-index	38	19

200

100

150

2005200620072008200920102011201220132014201520162017201820192020202120222023202412 11 35 55 83 60 115 103 131 113 182 128 138 131 144 142 129 137 165 160

Acces public

Afișați-le pe toate

28 de articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityAdresă de e-mail confirmată pe cs.rwth-aachen.de
Heiner AckermannFraunhofer ITWMAdresă de e-mail confirmată pe itwm.fraunhofer.de
Bodo MantheyAssociate Professor, University of TwenteAdresă de e-mail confirmată pe utwente.nl
Matthias EnglertUniversity of WarwickAdresă de e-mail confirmată pe warwick.ac.uk
Vahab MirrokniGoogle Fellow, VP, Google ResearchAdresă de e-mail confirmată pe google.com
Maria-Florina BalcanProfessor, School of Computer Science, Carnegie Mellon UniversityAdresă de e-mail confirmată pe cs.cmu.edu
Paul GoldbergProfessor of Computer Science, Oxford UniversityAdresă de e-mail confirmată pe cs.ox.ac.uk
Yu (Brandon) XiaProfessor of Bioengineering, McGill UniversityAdresă de e-mail confirmată pe mcgill.ca
Dirk SudholtUniversity of Passau, GermanyAdresă de e-mail confirmată pe uni-passau.de
Thomas JansenAberystwyth UniversityAdresă de e-mail confirmată pe aber.ac.uk
Carsten WittTechnical University of DenmarkAdresă de e-mail confirmată pe imm.dtu.dk
Frank NeumannOptimisation and Logistics, School of ComputerAdresă de e-mail confirmată pe adelaide.edu.au
Matthias MnichTU HamburgAdresă de e-mail confirmată pe tuhh.de
Dimo BrockhoffInria, Ecole Polytechnique, Institut Polytechnique de ParisAdresă de e-mail confirmată pe inria.fr
Martin HoeferProfessor of Computer Science, RWTH Aachen UniversityAdresă de e-mail confirmată pe cs.rwth-aachen.de
Stefan KratschProfessor at Humboldt University BerlinAdresă de e-mail confirmată pe informatik.hu-berlin.de
Andreas Emil FeldmannUniversity of SheffieldAdresă de e-mail confirmată pe sheffield.ac.uk
André BergerAssociate Professor of Operations ResearchAdresă de e-mail confirmată pe maastrichtuniversity.nl
Luis RademacherDepartment of Mathematics, UC DavisAdresă de e-mail confirmată pe math.ucdavis.edu
Tjark VredeveldMaastricht UniversityAdresă de e-mail confirmată pe maastrichtuniversity.nl

Urmăriți

Heiko Röglin

Professor of Computer Science, University of Bonn

Adresă de e-mail confirmată pe cs.uni-bonn.de - Pagina de pornire

Theoretical Computer Science Smoothed Analysis Algorithmic Game Theory


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
On the impact of combinatorial structure on congestion games H Ackermann, H Röglin, B Vöcking Journal of the ACM (JACM) 55 (6), 1-22, 2008	312	2008
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP M Englert, H Röglin, B Vöcking Algorithmica 68 (1), 190-264, 2014	244	2014
Pure Nash equilibria in player-specific and weighted congestion games H Ackermann, H Röglin, B Vöcking Theoretical Computer Science 410 (17), 1552-1563, 2009	175	2009
Smoothed analysis of the k-means method D Arthur, B Manthey, H Röglin Journal of the ACM (JACM) 58 (5), 1-31, 2011	136	2011
Uncoordinated two-sided matching markets H Ackermann, PW Goldberg, VS Mirrokni, H Röglin, B Vöcking Proceedings of the 9th ACM Conference on Electronic Commerce, 256-263, 2008	129	2008
K-means has polynomial smoothed complexity D Arthur, B Manthey, H Röglin 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 405-414, 2009	80	2009
Theoretical analysis of two ACO approaches for the traveling salesman problem T Kötzing, F Neumann, H Röglin, C Witt Swarm Intelligence 6, 1-21, 2012	73*	2012
Competitive routing over time M Hoefer, VS Mirrokni, H Röglin, SH Teng Theoretical Computer Science 412 (39), 5420-5432, 2011	65	2011
Smoothed analysis of local search for the maximum-cut problem M Etscheid, H Röglin ACM Transactions on Algorithms (TALG) 13 (2), 1-12, 2017	64	2017
Active Clustering of Biological Sequences. K Voevodski, MF Balcan, H Röglin, SH Teng, Y Xia Journal of Machine Learning Research 13 (1), 2012	54	2012
Polynomial kernels for weighted problems M Etscheid, S Kratsch, M Mnich, H Röglin Journal of Computer and System Sciences 84, 1-10, 2017	52	2017
Smoothed analysis of integer programming H Röglin, B Vöcking Mathematical programming 110, 21-56, 2007	51	2007
Analysis of ward's method A Großwendt, H Röglin, M Schmidt Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	49	2019
Improved analysis of complete-linkage clustering A Grosswendt, H Roeglin Algorithmica 78, 1131-1150, 2017	49	2017
Decision-making based on approximate and smoothed Pareto curves H Ackermann, A Newman, H Röglin, B Vöcking Theoretical Computer Science 378 (3), 253-270, 2007	42	2007
Improved Smoothed Analysis of the k-Means Method B Manthey, H Röglin Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009	39	2009
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences B Manthey, H Röglin International Symposium on Algorithms and Computation, 1024-1033, 2009	38*	2009
Smoothed analysis of multiobjective optimization H Röglin, SH Teng 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 681-690, 2009	38	2009
The smoothed number of Pareto optimal solutions in bicriteria integer optimization R Beier, H Röglin, B Vöcking Integer Programming and Combinatorial Optimization: 12th International IPCO …, 2007	37	2007
Smoothed analysis of the successive shortest path algorithm T Brunsch, K Cornelissen, B Manthey, H Röglin, C Rösner SIAM Journal on Computing 44 (6), 1798-1819, 2015	36	2015

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori