引用次数
引用: 2,155
H-指数: 25
I10-指数 : 38
出版物: 80
Analysis of algorithms beyond the worst case
Heiko Röglin , Bodo Manthey , Tim Roughgarden , Marina-Florina Balcan
Dagstuhl reports 4 ( 9) 30 -49
4
2015
Pure nash equilibria in player-specific and weighted congestion games
Heiko Röglin , Heiner Ackermann , Berthold Vöcking
Lecture Notes in Computer Science 50 -61
65
2006
Improved smoothed analysis of the k-means method
Heiko Röglin , Bodo Manthey
symposium on discrete algorithms 461 -470
22
2009
Active clustering of biological sequences
Heiko Röglin , Yu Xia , Shang-Hua Teng , Maria-Florina Balcan
Journal of Machine Learning Research 13 ( 1) 203 -225
40
2012
Evolutionäre Algorithmen zwischen experimenteller und theoretischer Analyse
Patrick Briest , Dimo Brockhoff , Bastian Degener , Matthias Englert
Universität Dortmund, Fachbereich Informatik
2004
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)
Eli Upfal , Heiko Röglin , Bodo Manthey , Claire Mathieu
Dagstuhl Reports 7 ( 4) 22
2017
Analysis of Ward's Method.
Heiko Röglin , Melanie Schmidt , Anna Großwendt
arXiv: Data Structures and Algorithms
2
2019
Agnostic clustering
Heiko Röglin , Shang-Hua Teng , Maria Florina Balcan
algorithmic learning theory 384 -398
15
2009
Smoothed Analysis of Pareto Curves in Multiobjective Optimization.
Heiko Röglin
Beyond the Worst-Case Analysis of Algorithms 334 -358
2020
Economical Caching
Matthias Englert , Heiko Röglin , Jacob Spönemann , Berthold Vöcking
ACM Transactions on Computation Theory (TOCT) 5 ( 2)
6
2013
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
Matthias Englert , Heiko Röglin , Berthold Vöcking
Algorithmica 68 ( 1) 190 -264
199
2014
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
Patrick Briest , Dimo Brockhoff , Bastian Degener , Matthias Englert
parallel problem solving from nature 31 -40
5
2004
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
Patrick Briest , Dimo Brockhoff , Bastian Degener , Matthias Englert
parallel problem solving from nature 21 -30
13
2004
Computing Approximate Nash Equilibria in Network Congestion Games
Andreas Emil Feldmann , Heiko Röglin , Berthold Vöcking
Structural Information and Communication Complexity 209 -220
4
2008
Polynomial kernels for weighted problems
Michael Etscheid , Stefan Kratsch , Matthias Mnich , Heiko Röglin
Journal of Computer and System Sciences 84 1 -10
20
2017
Smoothed Analysis of the k-Means Method
David Arthur , Bodo Manthey , Heiko Röglin
Journal of the ACM 58 ( 5) 19
67
2011
Smoothed Analysis of the 2-Opt Algorithm for the General TSP
Matthias Englert , Heiko Röglin , Berthold Vöcking
ACM Transactions on Algorithms 13 ( 1) 10
6
2016
On the impact of combinatorial structure on congestion games
Heiner Ackermann , Heiko Röglin , Berthold Vöcking
Journal of the ACM 55 ( 6) 1 -22
180
2008
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
Tobias Brunsch , Heiko Röglin
Automata, Languages, and Programming 279 -290
11
2013
Uncoordinated two-sided matching markets
Heiner Ackermann , Paul W. Goldberg , Vahab S. Mirrokni , Heiko Röglin
Proceedings of the 9th ACM conference on Electronic commerce - EC '08 256 -263
17
2008
Berthold Vöcking Heiner Ackermann Bodo Manthey Matthias Englert Vahab Mirrokni Maria-Florina Balcan Paul Goldberg Yu (Brandon) Xia Dirk Sudholt Thomas Jansen Carsten Witt Frank Neumann Dimo Brockhoff Matthias Mnich Martin Hoefer Stefan Kratsch Andreas Emil Feldmann André Berger Luis Rademacher Tjark Vredeveld