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

Hans-Joachim Böckenhauer Vis

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

*2009
25EEDavide 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
24EEHans-Joachim Böckenhauer, Joachim Kneis, Joachim Kupke: Approximation hardness of deadline-TSP reoptimization. Theor. Comput. Sci. 410(21-23): 2241-2249 (2009)
23EEHans-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
22EEHans-Joachim Böckenhauer, Dennis Komm: Reoptimization of the Metric Deadline TSP. MFCS 2008: 156-167
21EEHans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer: On the Hardness of Reoptimization. SOFSEM 2008: 50-65
20EEDavide 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
19EEHans-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
18EEHans-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
17EEHans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
16EEHans-Joachim Böckenhauer, Dirk Bongartz: Protein folding in the HP model on grid lattices with diagonals. Discrete Applied Mathematics 155(2): 230-256 (2007)
15EEHans-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
14EEHans-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
13EEHans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke: On the Approximation Hardness of Some Generalizations of TSP. SWAT 2006: 184-195
2004
12EEHans-Joachim Böckenhauer, Dirk Bongartz: Protein Folding in the HP Model on Grid Lattices with Diagonals (Extended Abstract). MFCS 2004: 227-238
11EEHans-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
10EEHans-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
9EEHans-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
8EEHans-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
7EEHans-Joachim Böckenhauer: Communication in the two-way listen-in vertex-disjoint paths mode. Theor. Comput. Sci. 264(1): 65-90 (2001)
2000
6EEHans-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
5EEHans-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
4 Hans-Joachim Böckenhauer, Sebastian Seibert: Improved lower bounds on the approximability of the Traveling Salesman Problem. ITA 34(3): 213-255 (2000)
3EEHans-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
2EEHans-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
1EEHans-Joachim Böckenhauer: Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. WG 1998: 38-49

Coauthor Index

1Davide Bilò [20] [25]
2Dirk Bongartz [9] [10] [11] [12] [16] [18]
3Luca Forlizzi [14]
4Juraj Hromkovic [2] [3] [5] [6] [8] [9] [10] [11] [13] [14] [15] [17] [18] [20] [21] [23]
5Leonidas Kapsokalivas [19]
6Ralf Klasing [2] [3] [5] [6] [8] [9] [10] [11] [18]
7Joachim Kneis [13] [14] [15] [24]
8Dennis Komm [22] [25]
9Richard Královic [17] [20] [23] [25]
10Joachim Kupke [13] [14] [15] [24]
11Tobias Mömke [17] [20] [21] [23] [25]
12Guido Proietti [9] [10] [11] [14] [18]
13Peter Rossmanith [23]
14Sebastian Seibert [2] [3] [4] [5] [6] [8] [9] [10] [11] [18] [25]
15Kathleen Steinhöfel [17] [19]
16Abu Zafer M. Dayem Ullah [19]
17Walter Unger [2] [3] [5] [6] [8] [9] [10] [11] [18]
18Peter Widmayer [14] [20] [21]
19Anna Zych [20] [25]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)