default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans-Joachim Böckenhauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j32]Hans-Joachim Böckenhauer
, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of parameterized problems. Acta Informatica 59(4): 427-450 (2022)- [j31]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring sparse graphs with advice. Inf. Comput. 289(Part): 104950 (2022) - [j30]Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call admission problems on grids with advice. Theor. Comput. Sci. 918: 77-93 (2022) - [j29]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call admission problems on trees. Theor. Comput. Sci. 922: 410-423 (2022) - 2021
- [j28]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger:
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862: 81-96 (2021) - 2019
- [j27]Hans-Joachim Böckenhauer, Tobias Kohn, Dennis Komm, Giovanni Serafini:
An Elementary Approach Towards Teaching Dynamic Programming. Bull. EATCS 128 (2019) - 2018
- [j26]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): 505-527 (2018) - 2017
- [j25]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: 59-83 (2017) - [j24]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: 159-170 (2017) - 2014
- [j23]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70(1): 92-111 (2014) - [j22]Hans-Joachim Böckenhauer, Monika Steinová:
Improved approximations for ordered TSP on near-metric graphs. RAIRO Theor. Informatics Appl. 48(5): 479-494 (2014) - [j21]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
The online knapsack problem: Advice and randomization. Theor. Comput. Sci. 527: 61-72 (2014) - [j20]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: 22-39 (2014) - [j19]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: 95-108 (2014) - 2013
- [j18]Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová:
Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms 21: 32-40 (2013) - 2012
- [j17]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) - 2011
- [j16]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) - [j15]Hans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock:
On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Informaticae 110(1-4): 59-76 (2011) - 2010
- [j14]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): 363-377 (2010) - [j13]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1): 87-100 (2010) - 2009
- [j12]Hans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke:
Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009) - [j11]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) - 2008
- [j10]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) - 2007
- [j9]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): 83-93 (2007) - [j8]Hans-Joachim Böckenhauer, Dirk Bongartz:
Protein folding in the HP model on grid lattices with diagonals. Discret. Appl. Math. 155(2): 230-256 (2007) - [j7]Hans-Joachim Böckenhauer, Dirk Bongartz:
A weighted HP model for protein folding with diagonal contacts. RAIRO Theor. Informatics Appl. 41(4): 375-402 (2007) - [j6]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) - 2004
- [j5]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) - 2002
- [j4]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) - 2001
- [j3]Hans-Joachim Böckenhauer:
Communication in the two-way listen-in vertex-disjoint paths mode. Theor. Comput. Sci. 264(1): 65-90 (2001) - 2000
- [j2]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) - [j1]Hans-Joachim Böckenhauer, Sebastian Seibert:
Improved lower bounds on the approximability of the Traveling Salesman Problem. RAIRO Theor. Informatics Appl. 34(3): 213-255 (2000)
Conference and Workshop Papers
- 2024
- [c40]Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith:
Removable Online Knapsack and Advice. STACS 2024: 18:1-18:17 - 2023
- [c39]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner:
Online Knapsack with Removal and Recourse. IWOCA 2023: 123-135 - [c38]Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. SIROCCO 2023: 246-261 - 2022
- [c37]Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath:
Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract). ICS 2022: 25-36 - 2021
- [c36]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. STACS 2021: 16:1-16:18 - 2019
- [c35]Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call Admission Problems on Trees with Advice - (Extended Abstract). IWOCA 2019: 108-121 - 2018
- [c34]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: 172-190 - [c33]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring Sparse Graphs with Advice (Extended Abstract). WAOA 2018: 102-117 - [c32]Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner:
Call Admission Problems on Grids with Advice (Extended Abstract). WAOA 2018: 118-133 - 2016
- [c31]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM 2016: 195-207 - 2015
- [c30]Hans-Joachim Böckenhauer, Richard J. B. Dobson, Sacha Krug, Kathleen Steinhöfel:
On Energy-Efficient Computations With Advice. COCOON 2015: 747-758 - 2014
- [c29]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: 264-276 - [c28]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: 89-101 - 2013
- [c27]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 - [c26]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 - [c25]Hans-Joachim Böckenhauer, Lucia Keller:
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. IWOCA 2013: 54-66 - [c24]Hans-Joachim Böckenhauer, Monika Steinová:
Improved Approximations for Ordered TSP on Near-Metric Graphs, . SOFSEM 2013: 157-168 - 2012
- [c23]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 - [c22]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. COCOON 2012: 519-530 - [c21]Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72 - 2011
- [c20]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 - [c19]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 - [c18]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 - 2010
- [c17]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová:
Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72 - [c16]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 - 2009
- [c15]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 - [c14]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 - 2008
- [c13]Hans-Joachim Böckenhauer, Dennis Komm:
Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167 - [c12]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
On the Hardness of Reoptimization. SOFSEM 2008: 50-65 - [c11]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 - [c10]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 - 2007
- [c9]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 - 2006
- [c8]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 - [c7]Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195 - 2004
- [c6]Hans-Joachim Böckenhauer, Dirk Bongartz:
Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS 2004: 227-238 - 2003
- [c5]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 - 2002
- [c4]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 - 2000
- [c3]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 - [c2]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 - 1998
- [c1]Hans-Joachim Böckenhauer:
Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. WG 1998: 38-49
Parts in Books or Collections
- 2018
- [p2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm:
Reoptimization of Hard Optimization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 427-454 - [p1]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sebastian Seibert:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 473-487
Editorship
- 2018
- [e1]Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger:
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 11011, Springer 2018, ISBN 978-3-319-98354-7 [contents]
Reference Works
- 2007
- [r1]Hans-Joachim Böckenhauer, Sebastian Seibert, Juraj Hromkovic:
Stability of Approximation. Handbook of Approximation Algorithms and Metaheuristics 2007
Informal and Other Publications
- 2024
- [i10]Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - 2023
- [i9]Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. CoRR abs/2301.13860 (2023) - 2022
- [i8]Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath:
Priority Algorithms with Advice for Disjoint Path Allocation Problems. CoRR abs/2202.10254 (2022) - 2020
- [i7]Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith:
Advice for Online Knapsack With Removable Items. CoRR abs/2005.01867 (2020) - [i6]Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. CoRR abs/2009.14043 (2020) - 2018
- [i5]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
The Graph Exploration Problem with Advice. CoRR abs/1804.06675 (2018) - [i4]Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith:
Reoptimization of Parameterized Problems. CoRR abs/1809.10578 (2018) - 2016
- [i3]Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger:
Online Exploration of Rectangular Grids. CoRR abs/1611.00934 (2016) - 2012
- [i2]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. TR12 (2012) - 1999
- [i1]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. TR99 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
