Tobias Brunsch

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

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

2014
Smoothed Analysis of Selected Optimization Problems and Algorithms.
PhD thesis, 2014

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

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

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

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

Smoothed Performance Guarantees for Local Search.
Proceedings of the Algorithms - ESA 2011, 2011


  Loading...