Hans-Joachim Böckenhauer

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen: On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. COCOON 2013: 53-64

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock: The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505

Hans-Joachim Böckenhauer, Monika Steinová: Improved Approximations for Ordered TSP on Near-Metric Graphs, . SOFSEM 2013: 157-168

Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen: Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11: 73-86 (2012)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith: On the Power of Randomness versus Advice in Online Computation. Languages Alive 2012: 30-43

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller: Online Coloring of Bipartite Graphs with and without Advice. COCOON 2012: 519-530

Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith: On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock: The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. Electronic Colloquium on Computational Complexity (ECCC) 19: 162 (2012)

Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Inform. 110(1-4): 59-76 (2011)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke: Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science 2011: 3-19

Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life 2011: 7-15

Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic: On the Advice Complexity of the k-Server Problem. ICALP (1) 2011: 207-218

Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová: The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. RAIRO - Theor. Inf. and Applic. 44(3): 363-377 (2010)

Hans-Joachim Böckenhauer, Dennis Komm: Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1): 87-100 (2010)

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová: Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72

Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen: The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC 2010: 180-191

Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke: Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith: Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36): 3428-3435 (2009)

Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych: Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91

Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke: On the Advice Complexity of Online Problems. ISAAC 2009: 331-340

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008)

Hans-Joachim Böckenhauer, Dennis Komm: Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167

Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65

Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych: Reoptimization of Steiner Trees. SWAT 2008: 258-269

Hans-Joachim Böckenhauer, Abu Zafer M. Dayem Ullah, Leonidas Kapsokalivas, Kathleen Steinhöfel: A Local Move Set for Protein Folding in Triangular Lattice Models. WABI 2008: 369-381

Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer: On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Operations Research 2(2): 83-93 (2007)

Hans-Joachim Böckenhauer, Dirk Bongartz: Protein folding in the HP model on grid lattices with diagonals. Discrete Applied Mathematics 155(2): 230-256 (2007)

Hans-Joachim Böckenhauer, Dirk Bongartz: A weighted HP model for protein folding with diagonal contacts. ITA 41(4): 375-402 (2007)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92

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

Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004)

Hans-Joachim Böckenhauer, Dirk Bongartz: Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS 2004: 227-238

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. CIAC 2003: 189-200

Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285(1): 3-24 (2002)

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. FSTTCS 2002: 59-70

Hans-Joachim Böckenhauer: Communication in the two-way listen-in vertex-disjoint paths mode. Theor. Comput. Sci. 264(1): 65-90 (2001)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000)

Hans-Joachim Böckenhauer, Sebastian Seibert: Improved lower bounds on the approximability of the Traveling Salesman Problem. ITA 34(3): 213-255 (2000)

Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. CIAC 2000: 72-86

Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS 2000: 382-394

Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger: Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. Electronic Colloquium on Computational Complexity (ECCC) 6(31) (1999)

Hans-Joachim Böckenhauer: Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. WG 1998: 38-49