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

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

Improved lower bounds on the approximability of the Traveling Salesman Problem. - Hans-Joachim Böckenhauer; Sebastian Seibert (RAIRO Theor. Informatics Appl., 2000)

Communication in the two-way listen-in vertex-disjoint paths mode. - Hans-Joachim Böckenhauer (Theor. Comput. Sci., 2001)

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

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

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

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

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 the Approximation Hardness of Some Generalizations of TSP. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Joachim Kneis; Joachim Kupke 002 (SWAT, 2006)

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

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)

Protein folding in the HP model on grid lattices with diagonals. - Hans-Joachim Böckenhauer; Dirk Bongartz (Discret. Appl. Math., 2007)

A weighted HP model for protein folding with diagonal contacts. - Hans-Joachim Böckenhauer; Dirk Bongartz (RAIRO Theor. Informatics Appl., 2007)

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

Stability of Approximation. - Hans-Joachim Böckenhauer; Sebastian Seibert; Juraj Hromkovic (Handbook of Approximation Algorithms and Metaheuristics, 2007)

On the Hardness of Reoptimization. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Tobias Mömke; Peter Widmayer (SOFSEM, 2008)

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

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

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

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

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

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

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 (CIAC, 2010)

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

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

Reoptimization of the metric deadline TSP. - Hans-Joachim Böckenhauer; Dennis Komm (J. Discrete Algorithms, 2010)

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

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

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

On the Hardness of Reoptimization with Multiple Given Solutions. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Andreas Sprock (Fundam. Informaticae, 2011)

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

On the Advice Complexity of the Knapsack Problem. - Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Peter Rossmanith (LATIN, 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)

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

On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. - Hans-Joachim Böckenhauer; Lucia Keller (IWOCA, 2013)

Improved approximations for TSP with simple precedence constraints. - Hans-Joachim Böckenhauer; Tobias Mömke; Monika Steinová (J. Discrete Algorithms, 2013)

A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm (Computing with New Resources, 2014)

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. - Kfir Barhum; Hans-Joachim Böckenhauer; Michal Forisek; Heidi Gebauer; Juraj Hromkovic; Sacha Krug; Jasmin Smula; Björn Steffen (SOFSEM, 2014)

Online Coloring of Bipartite Graphs with and without Advice. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Lucia Keller (Algorithmica, 2014)

Improved approximations for ordered TSP on near-metric graphs. - Hans-Joachim Böckenhauer; Monika Steinová (RAIRO Theor. Informatics Appl., 2014)

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (Theor. Comput. Sci., 2014)

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 (Theor. Comput. Sci., 2014)

The online knapsack problem: Advice and randomization. - Hans-Joachim Böckenhauer; Dennis Komm; Richard Královic; Peter Rossmanith (Theor. Comput. Sci., 2014)

On Energy-Efficient Computations With Advice. - Hans-Joachim Böckenhauer; Richard J. B. Dobson; Sacha Krug; Kathleen Steinhöfel (COCOON, 2015)

Online Minimum Spanning Tree with Advice - (Extended Abstract). - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Tatjana Brülisauer; Dennis Komm; Beatrice Palano (SOFSEM, 2016)

Online Exploration of Rectangular Grids. - Hans-Joachim Böckenhauer; Janosch Fuchs; Ulla Karhumäki; Walter Unger (CoRR, 2016)

Online algorithms with advice: The tape model. - Hans-Joachim Böckenhauer; Dennis Komm; Rastislav Královic; Richard Královic; Tobias Mömke (Inf. Comput., 2017)

On the advice complexity of the k-server problem. - Hans-Joachim Böckenhauer; Dennis Komm; Rastislav Královic; Richard Královic (J. Comput. Syst. Sci., 2017)

Reoptimization of Hard Optimization Problems. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Stability of Approximation. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sebastian Seibert (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Fully Online Matching with Advice on General Bipartite Graphs and Paths. - Hans-Joachim Böckenhauer; Lucia Di Caro; Walter Unger (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Exploring Sparse Graphs with Advice (Extended Abstract). - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (WAOA, 2018)

Call Admission Problems on Grids with Advice (Extended Abstract). - Hans-Joachim Böckenhauer; Dennis Komm; Raphael Wegner (WAOA, 2018)

The Graph Exploration Problem with Advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (CoRR, 2018)

Online Minimum Spanning Tree with Advice. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Tatjana Brülisauer; Dennis Komm; Beatrice Palano (Int. J. Found. Comput. Sci., 2018)

Call Admission Problems on Trees with Advice - (Extended Abstract). - Hans-Joachim Böckenhauer; Nina Corvelo Benz; Dennis Komm (IWOCA, 2019)

An Elementary Approach Towards Teaching Dynamic Programming. - Hans-Joachim Böckenhauer; Tobias Kohn; Dennis Komm; Giovanni Serafini (Bull. EATCS, 2019)

Advice for Online Knapsack With Removable Items. - Hans-Joachim Böckenhauer; Jan Dreier; Fabian Frei; Peter Rossmanith (CoRR, 2020)

Online Simple Knapsack with Reservation Costs. - Hans-Joachim Böckenhauer; Elisabet Burjons; Juraj Hromkovic; Henri Lotze; Peter Rossmanith (STACS, 2021)

On the advice complexity of the online dominating set problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Walter Unger (Theor. Comput. Sci., 2021)

Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract). - Hans-Joachim Böckenhauer; Fabian Frei; Silvan Horvath (ICS, 2022)

Reoptimization of parameterized problems. - Hans-Joachim Böckenhauer; Elisabet Burjons; Martin Raszyk; Peter Rossmanith (Acta Informatica, 2022)

Exploring sparse graphs with advice. - Hans-Joachim Böckenhauer; Janosch Fuchs; Walter Unger (Inf. Comput., 2022)

Call admission problems on trees. - Hans-Joachim Böckenhauer; Nina Corvelo Benz; Dennis Komm (Theor. Comput. Sci., 2022)

Call admission problems on grids with advice. - Hans-Joachim Böckenhauer; Dennis Komm; Raphael Wegner (Theor. Comput. Sci., 2022)

Zero-Memory Graph Exploration with Unknown Inports. - Hans-Joachim Böckenhauer; Fabian Frei; Walter Unger; David Wehner (SIROCCO, 2023)

Removable Online Knapsack and Advice. - Hans-Joachim Böckenhauer; Fabian Frei; Peter Rossmanith (STACS, 2024)

Priority algorithms with advice for disjoint path allocation problems. - Hans-Joachim Böckenhauer; Fabian Frei; Silvan Horvath (Theor. Comput. Sci., 2024)

Forbidden Subgraph Problems with Predictions. - Hans-Joachim Böckenhauer; Melvin Jahn; Dennis Komm; Moritz Stocker (CoRR, 2025)

Online Unbounded Knapsack. - Hans-Joachim Böckenhauer; Matthias Gehnen; Juraj Hromkovic; Ralf Klasing; Dennis Komm; Henri Lotze; Daniel Mock; Peter Rossmanith; Moritz Stocker (Theory Comput. Syst., 2025)

A survey of online knapsack problems. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Peter Rossmanith; Moritz Stocker (Discret. Appl. Math., 2026)

Online knapsack with removal and recourse. - Hans-Joachim Böckenhauer; Ralf Klasing; Tobias Mömke; Peter Rossmanith; Moritz Stocker; David Wehner (J. Comput. Syst. Sci., 2026)