| 2008 |
|---|
| 15 | On k-connectivity problems with sharpened triangle inequality. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. J. Discrete Algorithms (6): 605-617 (2008). Web SearchBibTeXDownload |
| 14 | On the Hardness of Reoptimization. Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer. SOFSEM 2008, 50-65. Web SearchBibTeXDownload |
| 13 | Reoptimization of Steiner Trees. Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych. SWAT 2008, 258-269. Web SearchBibTeXDownload |
| 2007 |
|---|
| 12 | On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer. Algorithmic Operations Research (2): 83-93 (2007). Web SearchBibTeXDownload |
| 11 | Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Juraj Hromkovic, Tobias Mömke, Peter Widmayer, Peter Widmayer. Algorithmic Operations Research (2) (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 10 | On the Stability of Approximation for Hamiltonian Path Problems. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert. Algorithmic Operations Research (1) (2006). Web SearchBibTeXDownload |
| 9 | Reusing Optimal TSP Solutions for Locally Modified Input Instances. Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke, Guido Proietti, Peter Widmayer. IFIP TCS 2006, 251-270. Web SearchBibTeXDownload |
| 2005 |
|---|
| 8 | On the Stability of Approximation for Hamiltonian Path Problems. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert. SOFSEM 2005, 147-156. Web SearchBibTeXDownload |
| 2004 |
|---|
| 7 | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. Theor. Comput. Sci. (326): 137-153 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 6 | On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. CIAC 2003, 189-200. Web SearchBibTeXDownload |
| 2002 |
|---|
| 5 | On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. FSTTCS 2002, 59-70. Web SearchBibTeXDownload |
| 2001 |
|---|
| 4 | Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Juraj Hromkovic, Tobias Mömke, Peter Widmayer, Peter Widmayer. ICTCS 2001, 90-106. Web SearchBibTeXDownload |
| 3 | Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke. J. Comput. Syst. Sci. (62): 565-588 (2001). Web SearchBibTeXDownload |
| 1997 |
|---|
| 2 | Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke. STACS 1997, 55-66. Web SearchBibTeXDownload |
| 1984 |
|---|
| 1 | Communication Complexity. Dömötör Pálvölgyi, Michael Sipser. ICALP 1984, 235-246. Web SearchBibTeXDownload |
