Andreas Sprock
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The string guessing problem as a method to prove lower bounds on the advice complexity Theoretical Computer Science | 2014-10-06 | Paper |
| The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract) Lecture Notes in Computer Science | 2013-06-11 | Paper |
| Advice complexity of the online coloring problem Lecture Notes in Computer Science | 2013-06-07 | Paper |
| Steiner tree reoptimization in graphs with sharpened triangle inequality Journal of Discrete Algorithms | 2012-05-11 | Paper |
| On the Hardness of Reoptimization with Multiple Given Solutions Fundamenta Informaticae | 2011-11-22 | Paper |
| Knowing all optimal solutions does not help for TSP reoptimization Computation, Cooperation, and Life | 2011-06-24 | Paper |
| The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract) Lecture Notes in Computer Science | 2010-05-28 | Paper |
Research outcomes over time
This page was built for person: Andreas Sprock
