Hans-Joachim Bckenhauer
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
31
Venues
15
Active years
1998–2026
Best venue rank
A*
Where they publish
Papers
31 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Forbidden Subgraph Problems with Predictions. | Hans-Joachim Bckenhauer, Melvin Jahn, Dennis Komm, Moritz Stocker |
| 2024 | STACS | Removable Online Knapsack and Advice. | Hans-Joachim Bckenhauer, Fabian Frei, Peter Rossmanith |
| 2023 | IWOCA | Online Knapsack with Removal and Recourse. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | SIROCCO | Zero-Memory Graph Exploration with Unknown Inports. | Hans-Joachim Bckenhauer, Fabian Frei, Walter Unger, David Wehner |
| 2021 | STACS | Online Simple Knapsack with Reservation Costs. | Hans-Joachim Bckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
| 2019 | IWOCA | Call Admission Problems on Trees with Advice - (Extended Abstract). | Hans-Joachim Bckenhauer, Nina Corvelo Benz, Dennis Komm |
| 2018 | WAOA | Exploring Sparse Graphs with Advice (Extended Abstract). | Hans-Joachim Bckenhauer, Janosch Fuchs, Walter Unger |
| 2018 | WAOA | Call Admission Problems on Grids with Advice (Extended Abstract). | Hans-Joachim Bckenhauer, Dennis Komm, Raphael Wegner |
| 2016 | SOFSEM | Online Minimum Spanning Tree with Advice - (Extended Abstract). | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Tatjana Brlisauer, Dennis Komm, Beatrice Palano |
| 2015 | COCOON | On Energy-Efficient Computations With Advice. | Hans-Joachim Bckenhauer, Richard J. B. Dobson, Sacha Krug, Kathleen Steinhfel |
| 2014 | SOFSEM | On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. | Kfir Barhum, Hans-Joachim Bckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Bjrn Steffen |
| 2013 | COCOON | On the Advice Complexity of the Online | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Sacha Krug, Bjrn Steffen |
| 2013 | COCOON | The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock |
| 2013 | IWOCA | On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. | Hans-Joachim Bckenhauer, Lucia Keller |
| 2013 | SOFSEM | Improved Approximations for Ordered TSP on Near-Metric Graphs, . | Hans-Joachim Bckenhauer, Monika Steinov |
| 2012 | COCOON | Online Coloring of Bipartite Graphs with and without Advice. | Maria Paola Bianchi, Hans-Joachim Bckenhauer, Juraj Hromkovic, Lucia Keller |
| 2012 | LATIN | On the Advice Complexity of the Knapsack Problem. | Hans-Joachim Bckenhauer, Dennis Komm, Richard Krlovic, Peter Rossmanith |
| 2011 | ICALP | On the Advice Complexity of the k-Server Problem. | Hans-Joachim Bckenhauer, Dennis Komm, Rastislav Krlovic, Richard Krlovic |
| 2010 | CIAC | The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mmke, Andreas Sprock, Bjrn Steffen |
| 2010 | CIAC | Improved Approximations for TSP with Simple Precedence Constraints. | Hans-Joachim Bckenhauer, Ralf Klasing, Tobias Mmke, Monika Steinov |
| 2009 | CPM | Reoptimization of the Shortest Common Superstring Problem. | Davide Bil, Hans-Joachim Bckenhauer, Dennis Komm, Richard Krlovic, Tobias Mmke, Sebastian Seibert, Anna Zych |
| 2009 | ISAAC | On the Advice Complexity of Online Problems. | Hans-Joachim Bckenhauer, Dennis Komm, Rastislav Krlovic, Richard Krlovic, Tobias Mmke |
| 2008 | MFCS | Reoptimization of the Metric Deadline TSP. | Hans-Joachim Bckenhauer, Dennis Komm |
| 2008 | SOFSEM | On the Hardness of Reoptimization. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Tobias Mmke, Peter Widmayer |
| 2008 | WABI | A Local Move Set for Protein Folding in Triangular Lattice Models. | Hans-Joachim Bckenhauer, Abu Zafer M. Dayem Ullah, Leonidas Kapsokalivas, Kathleen Steinhfel |
| 2007 | FUN | Efficient Algorithms for the Spoonerism Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Richard Krlovic, Tobias Mmke, Kathleen Steinhfel |
| 2004 | MFCS | Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). | Hans-Joachim Bckenhauer, Dirk Bongartz |
| 2003 | CIAC | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
| 2000 | CIAC | Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 2000 | STACS | An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. | Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
| 1998 | WG | Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. | Hans-Joachim Bckenhauer |