| * | 2009 |
|---|
| 8 | EE | 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 |
| 7 | EE | 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 |
|---|
| 6 | EE | Christos A. Kapoutsis,
Richard Královic,
Tobias Mömke:
On the Size Complexity of Rotating and Sweeping Automata.
Developments in Language Theory 2008: 455-466 |
| 5 | EE | Hans-Joachim Böckenhauer,
Juraj Hromkovic,
Tobias Mömke,
Peter Widmayer:
On the Hardness of Reoptimization.
SOFSEM 2008: 50-65 |
| 4 | EE | 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 |
| 2007 |
|---|
| 3 | EE | 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 |
| 2 | EE | Christos A. Kapoutsis,
Richard Královic,
Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.
SAGA 2007: 130-141 |
| 1 | EE | Juraj Hromkovic,
Tobias Mömke,
Kathleen Steinhöfel,
Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Algorithmic Operations Research 2(1): (2007) |
