Hans-Joachim Böckenhauer

91 papers A 4B 13C 8Misc 5Journal 47Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
A survey of online knapsack problems.
Discret. Appl. Math.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Peter Rossmanith, Moritz Stocker
2026 J jnl
Online knapsack with removal and recourse.
J. Comput. Syst. Sci.
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2025 J jnl
Forbidden Subgraph Problems with Predictions.
CoRR
Hans-Joachim Böckenhauer, Melvin Jahn, Dennis Komm, Moritz Stocker
2025 J jnl
Online Unbounded Knapsack.
Theory Comput. Syst.
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024 J jnl
Online Unbounded Knapsack.
CoRR
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker
2024 J jnl
Priority algorithms with advice for disjoint path allocation problems.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
2024 A conf
Removable Online Knapsack and Advice.
STACS
Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
2023 C conf
Online Knapsack with Removal and Recourse.
IWOCA
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2023 B conf
Zero-Memory Graph Exploration with Unknown Inports.
SIROCCO
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
2023 J jnl
Zero-Memory Graph Exploration with Unknown Inports.
CoRR
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner
2022 J jnl
Call admission problems on grids with advice.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner
2022 J jnl
Call admission problems on trees.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm
2022 J jnl
Exploring sparse graphs with advice.
Inf. Comput.
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
2022 A conf
Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract).
ICS
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
2022 J jnl
Priority Algorithms with Advice for Disjoint Path Allocation Problems.
CoRR
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
2022 J jnl
Reoptimization of parameterized problems.
Acta Informatica
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
2021 J jnl
On the advice complexity of the online dominating set problem.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger
2021 A conf
Online Simple Knapsack with Reservation Costs.
STACS
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2020 J jnl
Advice for Online Knapsack With Removable Items.
CoRR
Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith
2020 J jnl
Online Simple Knapsack with Reservation Costs.
CoRR
Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith
2019 J jnl
An Elementary Approach Towards Teaching Dynamic Programming.
Bull. EATCS
Hans-Joachim Böckenhauer, Tobias Kohn, Dennis Komm, Giovanni Serafini
2019 C conf
Call Admission Problems on Trees with Advice - (Extended Abstract).
IWOCA
Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm
2018 — ed.
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday
Adventures Between Lower Bounds and Higher Altitudes
Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
2018 B conf
Call Admission Problems on Grids with Advice (Extended Abstract).
WAOA
Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner
2018 B conf
Exploring Sparse Graphs with Advice (Extended Abstract).
WAOA
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
2018 — conf
Fully Online Matching with Advice on General Bipartite Graphs and Paths.
Adventures Between Lower Bounds and Higher Altitudes
Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger
2018 J jnl
Online Minimum Spanning Tree with Advice.
Int. J. Found. Comput. Sci.
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
2018 — ch.
Reoptimization of Hard Optimization Problems.
Handbook of Approximation Algorithms and Metaheuristics (1)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
2018 J jnl
Reoptimization of Parameterized Problems.
CoRR
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith
2018 — ch.
Stability of Approximation.
Handbook of Approximation Algorithms and Metaheuristics (1)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert
2018 J jnl
The Graph Exploration Problem with Advice.
CoRR
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
2017 J jnl
On the advice complexity of the k-server problem.
J. Comput. Syst. Sci.
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
2017 J jnl
Online algorithms with advice: The tape model.
Inf. Comput.
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2016 J jnl
Online Exploration of Rectangular Grids.
CoRR
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger
2016 B conf
Online Minimum Spanning Tree with Advice - (Extended Abstract).
SOFSEM
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
2015 Misc conf
On Energy-Efficient Computations With Advice.
COCOON
Hans-Joachim Böckenhauer, Richard J. B. Dobson, Sacha Krug, Kathleen Steinhöfel
2014 — conf
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey.
Computing with New Resources
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm
2014 J jnl
Improved approximations for ordered TSP on near-metric graphs.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Monika Steinová
2014 B conf
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem.
SOFSEM
Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen
2014 J jnl
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles.
Theor. Comput. Sci.
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
2014 J jnl
Online Coloring of Bipartite Graphs with and without Advice.
Algorithmica
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
2014 J jnl
The online knapsack problem: Advice and randomization.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
2014 J jnl
The string guessing problem as a method to prove lower bounds on the advice complexity.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2013 B conf
Improved Approximations for Ordered TSP on Near-Metric Graphs, .
SOFSEM
Hans-Joachim Böckenhauer, Monika Steinová
2013 J jnl
Improved approximations for TSP with simple precedence constraints.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová
2013 Misc conf
On the Advice Complexity of the Online
COCOON
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
2013 C conf
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas.
IWOCA
Hans-Joachim Böckenhauer, Lucia Keller
2013 Misc conf
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
COCOON
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2012 B conf
On the Advice Complexity of the Knapsack Problem.
LATIN
Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith
2012 — conf
On the Power of Randomness versus Advice in Online Computation.
Languages Alive
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith
2012 Misc conf
Online Coloring of Bipartite Graphs with and without Advice.
COCOON
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
2012 J jnl
Steiner tree reoptimization in graphs with sharpened triangle inequality.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2012 J jnl
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity.
Electron. Colloquium Comput. Complex.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
2011 — conf
Improved Approximations for Hard Optimization Problems via Problem Instance Classification.
Rainbow of Computer Science
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke
2011 — conf
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization.
Computation, Cooperation, and Life
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
2011 — conf
On the Advice Complexity of the k-Server Problem.
ICALP (1)
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic
2011 J jnl
On the Hardness of Reoptimization with Multiple Given Solutions.
Fundam. Informaticae
Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock
2011 J jnl
Reoptimization of the Shortest Common Superstring Problem.
Algorithmica
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2010 C conf
Improved Approximations for TSP with Simple Precedence Constraints.
CIAC
Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
2010 J jnl
Reoptimization of the metric deadline TSP.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Dennis Komm
2010 C conf
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.
CIAC
Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2010 J jnl
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová
2009 J jnl
Approximation hardness of deadline-TSP reoptimization.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke
2009 B conf
On the Advice Complexity of Online Problems.
ISAAC
Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2009 J jnl
Reoptimization of Steiner trees: Changing the terminal set.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
2009 B conf
Reoptimization of the Shortest Common Superstring Problem.
CPM
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2008 C conf
A Local Move Set for Protein Folding in Triangular Lattice Models.
WABI
Hans-Joachim Böckenhauer, Abu Zafer M. Dayem Ullah, Leonidas Kapsokalivas, Kathleen Steinhöfel
2008 J jnl
On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2008 B conf
On the Hardness of Reoptimization.
SOFSEM
Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
2008 — conf
Reoptimization of Steiner Trees.
SWAT
Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
2008 B conf
Reoptimization of the Metric Deadline TSP.
MFCS
Hans-Joachim Böckenhauer, Dennis Komm
2007 J jnl
A weighted HP model for protein folding with diagonal contacts.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Dirk Bongartz
2007 Misc conf
Efficient Algorithms for the Spoonerism Problem.
FUN
Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
2007 J jnl
On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Oper. Res.
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2007 J jnl
Protein folding in the HP model on grid lattices with diagonals.
Discret. Appl. Math.
Hans-Joachim Böckenhauer, Dirk Bongartz
2007 — ch.
Stability of Approximation.
Handbook of Approximation Algorithms and Metaheuristics
Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic
2007 J jnl
The Parameterized Approximability of TSP with Deadlines.
Theory Comput. Syst.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
2006 — conf
On the Approximation Hardness of Some Generalizations of TSP.
SWAT
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke
2006 — conf
Reusing Optimal TSP Solutions for Locally Modified Input Instances.
IFIP TCS
Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer
2004 J jnl
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2004 B conf
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract).
MFCS
Hans-Joachim Böckenhauer, Dirk Bongartz
2003 C conf
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
CIAC
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2002 — conf
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.
FSTTCS
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
2002 J jnl
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2001 J jnl
Communication in the two-way listen-in vertex-disjoint paths mode.
Theor. Comput. Sci.
Hans-Joachim Böckenhauer
2000 A conf
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
STACS
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 J jnl
Approximation algorithms for the TSP with sharpened triangle inequality.
Inf. Process. Lett.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000 J jnl
Improved lower bounds on the approximability of the Traveling Salesman Problem.
RAIRO Theor. Informatics Appl.
Hans-Joachim Böckenhauer, Sebastian Seibert
2000 C conf
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
CIAC
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
1999 J jnl
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
Electron. Colloquium Comput. Complex.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
1998 B conf
Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode.
WG
Hans-Joachim Böckenhauer