dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Hans-Joachim Böckenhauer Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith: On the Advice Complexity of the Knapsack Problem. LATIN 2012: 61-72
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Computation, Cooperation, and Life 2011: 7-15
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavide 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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Andreas Sprock: On the Hardness of Reoptimization with Multiple Given Solutions. Fundam. Inform. 110(1-4): 59-76 (2011)
2010
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová: Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dennis Komm: Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1): 87-100 (2010)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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. Inf. and Applic. 44(3): 363-377 (2010)
2009
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavide 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
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke: Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dennis Komm: Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavide 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
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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 Operations Research 2(2): 83-93 (2007)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dirk Bongartz: Protein folding in the HP model on grid lattices with diagonals. Discrete Applied Mathematics 155(2): 230-256 (2007)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dirk Bongartz: A weighted HP model for protein folding with diagonal contacts. ITA 41(4): 375-402 (2007)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: The Parameterized Approximability of TSP with Deadlines. Theory Comput. Syst. 41(3): 431-444 (2007)
2006
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Dirk Bongartz: Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS 2004: 227-238
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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)
2003
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer: Communication in the two-way listen-in vertex-disjoint paths mode. Theor. Comput. Sci. 264(1): 65-90 (2001)
2000
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer, Sebastian Seibert: Improved lower bounds on the approximability of the Traveling Salesman Problem. ITA 34(3): 213-255 (2000)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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)
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-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 Electronic Colloquium on Computational Complexity (ECCC) 6(31): (1999)
1998
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Joachim Böckenhauer: Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. WG 1998: 38-49

Coauthor Index

1Davide Bilò [22] [28] [34]
2Dirk Bongartz [9] [10] [11] [12] [16] [17] [20]
3Michal Forisek [29]
4Luca Forlizzi [14] [18]
5Karin Freiermuth [32] [38]
6Juraj Hromkovic [2] [3] [5] [6] [8] [9] [10] [11] [13] [14] [15] [18] [19] [20] [22] [23] [25] [32] [33] [35] [37] [38]
7Leonidas Kapsokalivas [21]
8Ralf Klasing [2] [3] [5] [6] [8] [9] [10] [11] [20] [31]
9Joachim Kneis [13] [14] [15] [18] [26]
10Dennis Komm [24] [27] [28] [30] [34] [36] [39]
11Rastislav Kralovic (Rastislav Královic) [27] [36]
12Richard Královic [19] [22] [25] [27] [28] [34] [36] [39]
13Joachim Kupke [13] [14] [15] [18] [26]
14Tobias Mömke [19] [22] [23] [25] [27] [28] [31] [32] [34] [35] [38]
15Ján Oravec [29]
16Guido Proietti [9] [10] [11] [14] [18] [20]
17Peter Rossmanith [25] [39]
18Sebastian Seibert [2] [3] [4] [5] [6] [8] [9] [10] [11] [20] [28] [34]
19Andreas Sprock [32] [33] [37] [38]
20Björn Steffen [29] [32] [38]
21Kathleen Steinhöfel [19] [21] [29]
22Monika Steinová [29] [31]
23Abu Zafer M. Dayem Ullah [21]
24Walter Unger [2] [3] [5] [6] [8] [9] [10] [11] [20]
25Peter Widmayer [14] [18] [22] [23]
26Anna Zych [22] [28] [34]

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page