Heiko Röglin

According to our database1, Heiko Röglin authored at least 63 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020

2019
Noisy, Greedy and Not So Greedy k-means++.
CoRR, 2019

Analysis of Ward's Method.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
The Alternating Stock Size Problem and the Gasoline Puzzle.
ACM Trans. Algorithms, 2018

New deterministic algorithms for solving parity games.
Discret. Optim., 2018

Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Smoothed Analysis of Local Search for the Maximum-Cut Problem.
ACM Trans. Algorithms, 2017

Polynomial kernels for weighted problems.
J. Comput. Syst. Sci., 2017

Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141).
Dagstuhl Reports, 2017

Improved Analysis of Complete-Linkage Clustering.
Algorithmica, 2017

The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
Smoothed Analysis.
Encyclopedia of Algorithms, 2016

Smoothed Analysis of the 2-Opt Algorithm for the General TSP.
ACM Trans. Algorithms, 2016

Bounds for the Convergence Time of Local Search in Scheduling Problems.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Smoothed Analysis of the Successive Shortest Path Algorithm.
SIAM J. Comput., 2015

Improved Smoothed Analysis of Multiobjective Optimization.
J. ACM, 2015

Internet routing between autonomous systems: Fast algorithms for path trading.
Discret. Appl. Math., 2015

Solving Totally Unimodular LPs with the Shadow Vertex Algorithm.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Lower Bounds for the Average and Smoothed Number of Pareto-Optima.
Theory Comput., 2014

Smoothed performance guarantees for local search.
Math. Program., 2014

Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372).
Dagstuhl Reports, 2014

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Algorithmica, 2014

2013
Economical Caching.
ACM Trans. Comput. Theory, 2013

A bad instance for k-means++.
Theor. Comput. Sci., 2013

Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences.
JoCG, 2013

Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.
J. Graph Algorithms Appl., 2013

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Smoothed analysis of the successive shortest path algorithm.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Theoretical analysis of two ACO approaches for the traveling salesman problem.
Swarm Intelligence, 2012

Computing approximate Nash equilibria in network congestion games.
Networks, 2012

Active Clustering of Biological Sequences.
J. Mach. Learn. Res., 2012

2011
Competitive routing over time.
Theor. Comput. Sci., 2011

Smoothed Analysis of the k-Means Method.
J. ACM, 2011

Smoothed Analysis: Analysis of Algorithms Beyond Worst Case.
it Inf. Technol., 2011

Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function
CoRR, 2011

Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Lower Bounds for the Smoothed Number of Pareto Optimal Solutions.
Proceedings of the Theory and Applications of Models of Computation, 2011

Min-sum Clustering of Protein Sequences with Limited Distance Information.
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

2010
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Efficient Clustering with Limited Distance Information.
Proceedings of the UAI 2010, 2010

Analysis of Algorithms.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem.
Proceedings of the Swarm Intelligence - 7th International Conference, 2010

2009
Pure Nash equilibria in player-specific and weighted congestion games.
Theor. Comput. Sci., 2009

Uncoordinated two-sided matching markets.
SIGecom Exch., 2009

Evaluation of online strategies for reordering buffers.
ACM J. Exp. Algorithmics, 2009

Improved smoothed analysis of the k-means method.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Smoothed Analysis of Multiobjective Optimization.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

k-Means Has Polynomial Smoothed Complexity.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Agnostic Clustering.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
On the impact of combinatorial structure on congestion games.
J. ACM, 2008

A Unified Approach to Congestion Games and Two-Sided Markets.
Internet Math., 2008

Improved Smoothed Analysis of the k-Means Method
CoRR, 2008

On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games
CoRR, 2008

Approximate Equilibria in Games with Few Players
CoRR, 2008

2007
Decision-making based on approximate and smoothed Pareto curves.
Theor. Comput. Sci., 2007

Smoothed analysis of integer programming.
Math. Program., 2007

Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2004
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004


  Loading...