Heiko Röglin

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

2017
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141).
Dagstuhl Reports, 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

New Deterministic Algorithms for Solving Parity Games.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

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

The Alternating Stock Size Problem and the Gasoline Puzzle.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

Internet routing between autonomous systems: Fast algorithms for path trading.
Discrete Applied Mathematics, 2015

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

Polynomial Kernels for Weighted Problems.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Improved Analysis of Complete-Linkage Clustering.
Proceedings of the Algorithms - ESA 2015, 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 of Computing, 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

Smoothed Analysis of Local Search for the Maximum-Cut Problem.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

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.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Smoothed Analysis of the Successive Shortest Path Algorithm.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Active Clustering of Biological Sequences.
Journal of Machine Learning Research, 2012

Improved smoothed analysis of multiobjective optimization.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

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

Smoothed Analysis: Analysis of Algorithms Beyond Worst Case.
it - Information Technology, 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

A Bad Instance for k-Means++.
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

Smoothed Performance Guarantees for Local Search.
Proceedings of the Algorithms - ESA 2011, 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
Competitive Routing over Time.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Economical Caching.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 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
Computing Approximate Nash Equilibria in Network Congestion Games.
Proceedings of the Structural Information and Communication Complexity, 2008

Uncoordinated two-sided matching markets.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

2007
A Unified Approach to Congestion Games and Two-Sided Markets.
Proceedings of the Internet and Network Economics, Third International Workshop, 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

2006
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Pure Nash Equilibria in Player-Specific and Weighted Congestion Games.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Evaluation of Online Strategies for Reordering Buffers.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

On the Impact of Combinatorial Structure on Congestion Games.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Decision Making Based on Approximate and Smoothed Pareto Curves.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Smoothed Analysis of Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

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...