Andreas Sprock

According to our database, Andreas Sprock authored at least 8 papers between 2010 and 2013.

Collaborative distances:

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

2013

Analysis of hard problems in reoptimization and online computation.

Andreas Sprock

PhD thesis, 2013

The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Advice Complexity of the Online Coloring Problem.

Sebastian Seibert, Andreas Sprock, Walter Unger

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Steiner tree reoptimization in graphs with sharpened triangle inequality.

Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen

J. Discrete Algorithms, 2012

2011

On the Hardness of Reoptimization with Multiple Given Solutions.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock

Fundam. Informaticae, 2011

Knowing All Optimal Solutions Does Not Help for TSP Reoptimization.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock

Proceedings of the Computation, 2011

2010

Teaching Public-Key Cryptography in School.

Lucia Keller, Dennis Komm, Giovanni Serafini, Andreas Sprock, Björn Steffen

Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.

Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010