Reusing Optimal TSP Solutions for Locally Modified Input Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (IFIP TCS, 2006)

On Separating Constant from Polynomial Ambiguity of Finite Automata. - Joachim Kupke 002 (SOFSEM, 2006)

On the Approximation Hardness of Some Generalizations of TSP. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (SWAT, 2006)

On the Approximability of TSP on Local Modifications of Optimally Solved Instances. - Hans-Joachim Böckenhauer; Luca Forlizzi; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002; Guido Proietti; Peter Widmayer (Algorithmic Oper. Res., 2007)

The Parameterized Approximability of TSP with Deadlines. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (Theory Comput. Syst., 2007)

Binary operations on automatic functions. - Juhani Karhumäki; Jarkko Kari; Joachim Kupke 002 (RAIRO Theor. Informatics Appl., 2008)

Approximation hardness of deadline-TSP reoptimization. - Hans-Joachim Böckenhauer; Joachim Kneis; Joachim Kupke 002 (Theor. Comput. Sci., 2009)