Hans-Joachim Böckenhauer

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 27

Top Topics

Extended Abstract

Top Venues

Theor. Comput. Sci.

Publications

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
Online Unbounded Knapsack. CoRR (2024)
Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
Removable Online Knapsack and Advice. STACS (2024)
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
Zero-Memory Graph Exploration with Unknown Inports. CoRR (2023)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
Online Knapsack with Removal and Recourse. IWOCA (2023)
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
Zero-Memory Graph Exploration with Unknown Inports. SIROCCO (2023)
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
Priority Algorithms with Advice for Disjoint Path Allocation Problems. CoRR (2022)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Exploring sparse graphs with advice. Inf. Comput. 289 (Part) (2022)
Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner
Call admission problems on grids with advice. Theor. Comput. Sci. 918 (2022)
Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm
Call admission problems on trees. Theor. Comput. Sci. 922 (2022)
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
Reoptimization of parameterized problems. Acta Informatica 59 (4) (2022)
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract). ICS (2022)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. STACS (2021)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862 (2021)
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
Online Simple Knapsack with Reservation Costs. CoRR (2020)
Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith
Advice for Online Knapsack With Removable Items. CoRR (2020)
Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm
Call Admission Problems on Trees with Advice - (Extended Abstract). IWOCA (2019)
Hans-Joachim Böckenhauer, Tobias Kohn, Dennis Komm, Giovanni Serafini
An Elementary Approach Towards Teaching Dynamic Programming. Bull. EATCS 128 (2019)
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
Reoptimization of Parameterized Problems. CoRR (2018)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Exploring Sparse Graphs with Advice (Extended Abstract). WAOA (2018)
Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner
Call Admission Problems on Grids with Advice (Extended Abstract). WAOA (2018)
Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger
Fully Online Matching with Advice on General Bipartite Graphs and Paths. Adventures Between Lower Bounds and Higher Altitudes (2018)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. 29 (4) (2018)
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
The Graph Exploration Problem with Advice. CoRR (2018)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
Online algorithms with advice: The tape model. Inf. Comput. 254 (2017)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
On the advice complexity of the k-server problem. J. Comput. Syst. Sci. 86 (2017)
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger
Online Exploration of Rectangular Grids. CoRR (2016)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM (2016)
Hans-Joachim Böckenhauer, Richard J. B. Dobson, Sacha Krug, Kathleen Steinhöfel
On Energy-Efficient Computations With Advice. COCOON (2015)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70 (1) (2014)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527 (2014)
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. Theor. Comput. Sci. 554 (2014)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey. Computing with New Resources (2014)
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. Theor. Comput. Sci. 554 (2014)
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM (2014)
Hans-Joachim Böckenhauer, Monika Steinová
Improved approximations for ordered TSP on near-metric graphs. RAIRO Theor. Informatics Appl. 48 (5) (2014)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
(2, 1)-Coloring Problem on Paths and Cycles. COCOON (2013)
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)
Hans-Joachim Böckenhauer, Lucia Keller
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. IWOCA (2013)
Hans-Joachim Böckenhauer, Monika Steinová
Improved Approximations for Ordered TSP on Near-Metric Graphs, . SOFSEM (2013)
Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová
Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms 21 (2013)
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 (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)
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
On the Advice Complexity of the Knapsack Problem. LATIN (2012)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. COCOON (2012)
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. Electron. Colloquium Comput. Complex. 19 (2012)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
On the Advice Complexity of the k-Server Problem. ICALP (1) (2011)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life (2011)
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) (2011)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Informaticae 110 (1-4) (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)
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)
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
Improved Approximations for TSP with Simple Precedence Constraints. CIAC (2010)
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. Informatics Appl. 44 (3) (2010)
Hans-Joachim Böckenhauer, Dennis Komm
Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8 (1) (2010)
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)
Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke
Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410 (21-23) (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) (2009)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
On the Advice Complexity of Online Problems. ISAAC (2009)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
On the Hardness of Reoptimization. SOFSEM (2008)
Hans-Joachim Böckenhauer, Dennis Komm
Reoptimization of the Metric Deadline TSP. MFCS (2008)
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
Reoptimization of Steiner Trees. SWAT (2008)
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)
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) (2008)
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 Oper. Res. 2 (2) (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41 (3) (2007)
Hans-Joachim Böckenhauer, Dirk Bongartz
A weighted HP model for protein folding with diagonal contacts. RAIRO Theor. Informatics Appl. 41 (4) (2007)
Hans-Joachim Böckenhauer, Dirk Bongartz
Protein folding in the HP model on grid lattices with diagonals. Discret. Appl. Math. 155 (2) (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
Efficient Algorithms for the Spoonerism Problem. FUN (2007)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
On the Approximation Hardness of Some Generalizations of TSP. SWAT (2006)
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)
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) (2004)
Hans-Joachim Böckenhauer, Dirk Bongartz
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS (2004)
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)
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)
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) (2002)
Hans-Joachim Böckenhauer
Communication in the two-way listen-in vertex-disjoint paths mode. Theor. Comput. Sci. 264 (1) (2001)
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)
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)
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) (2000)
Hans-Joachim Böckenhauer, Sebastian Seibert
Improved lower bounds on the approximability of the Traveling Salesman Problem. RAIRO Theor. Informatics Appl. 34 (3) (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 Electron. Colloquium Comput. Complex. 6 (31) (1999)
Hans-Joachim Böckenhauer
Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. WG (1998)