Tobias Brunsch

According to our database, Tobias Brunsch authored at least 12 papers between 2011 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Bounds for the Convergence Time of Local Search in Scheduling Problems.

Tobias Brunsch, Michael Etscheid, Heiko Röglin

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015

Smoothed Analysis of the Successive Shortest Path Algorithm.

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner

SIAM J. Comput., 2015

Improved Smoothed Analysis of Multiobjective Optimization.

Tobias Brunsch, Heiko Röglin

J. ACM, 2015

Solving Totally Unimodular LPs with the Shadow Vertex Algorithm.

Tobias Brunsch, Anna Großwendt, Heiko Röglin

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Smoothed Analysis of Selected Optimization Problems and Algorithms.

Tobias Brunsch

PhD thesis, 2014

Lower Bounds for the Average and Smoothed Number of Pareto-Optima.

Tobias Brunsch, Navin Goyal, Luis Rademacher, Heiko Röglin

Theory Comput., 2014

Smoothed performance guarantees for local search.

Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld

Math. Program., 2014

2013

A bad instance for k-means++.

Tobias Brunsch, Heiko Röglin

Theor. Comput. Sci., 2013

Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching.

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin

J. Graph Algorithms Appl., 2013

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm.

Tobias Brunsch, Heiko Röglin

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Smoothed analysis of the successive shortest path algorithm.

Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

Lower Bounds for the Smoothed Number of Pareto Optimal Solutions.

Tobias Brunsch, Heiko Röglin

Proceedings of the Theory and Applications of Models of Computation, 2011