I was a post-doc working in Johan Håstad's approximation group until August 2012. For up to date information, please visit my current website at Saarland University, Germany.
In 2012, I gave the course FDD3402 Combinatorial Optimization.
[1] Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovič, Tobias Mömke, Andreas Sprock, and Björn Steffen. The Steiner tree reoptimization problem in graphs with sharpened triangle inequality. Journal of Discrete Algorithms. To appear.
[2] Hans-Joachim Böckenhauer, Tobias Mömke, and Monika Steinová. Improved approximations for TSP with simple precedence constraints. Journal of Discrete Algorithms. To appear.
[3] Christos A. Kapoutsis, Richard Královič, and Tobias Mömke. Size complexity of rotating and sweeping automata. Journal of Computer and System Sciences, In Press, Corrected Proof, 2011. (c) Elsevier, doi:10.1016/j.jcss.2011.06.004.
[4] Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Tobias Mömke, Sebastian Seibert, and Anna Zych. Reoptimization of the shortest common superstring problem. Algorithmica, 61(2):227–251, 2011. (c) Springer-Verlag, SpringerLink.
[5] Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Tobias Mömke, and Peter Rossmanith. Reoptimization of Steiner trees: Changing the terminal set. Theoretical Computer Science, 410(36):3428–3435, 2009. (c) Elsevier B.V., doi:10.1016/j.tcs.2008.04.039.
[6] Tobias Mömke. On the power of randomization for job shop scheduling with k-units length tasks. RAIRO Theoretical Informatics and Applications, 43:189–207, 2009. (c) EDP Sciences, doi: 10.1051/ita:2008024.
[7] Juraj Hromkovič, Tobias Mömke, Kathleen Steinhöfel, and Peter Widmayer. Job shop scheduling with unit length tasks: bounds and algorithms. Algorithmic Operations Research, 2(1):1–14, 2007.
[8] Tobias Mömke and Ola Svensson. Approximating graphic TSP by matchings. In Proc. of the 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pages 560–569, 2011. Best paper award.
[9] Tobias Mömke. Structural properties of hard metric TSP inputs. In Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), volume 6543 of Lecture Notes in Computer Science, pages 394–405, 2011. (c) Springer-Verlag, SpringerLink.
[10] Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovič, Tobias Mömke, Andreas Sprock, and Björn Steffen. The Steiner tree reoptimization problem with sharpened triangle inequality. In Proc. of the 7th International Conference on Algorithms and Complexity (CIAC 2010), volume 6078 of Lecture Notes in Computer Science, pages 180–191, 2010. (c) Springer-Verlag, SpringerLink.
[11] Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, and Monika Steinová. Improved approximations for TSP with simple precedence constraints. In Proc. of the 7th International Conference on Algorithms and Complexity (CIAC 2010), volume 6078 of Lecture Notes in Computer Science, pages 61–72, 2010. (c) Springer-Verlag, SpringerLink.
[12] Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Tobias Mömke, Sebastian Seibert, and Anna Zych. Reoptimization of the shortest common superstring problem. In Proc. of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), volume 5577 of Lecture Notes in Computer Science, pages 78–91, 2009. (c) Springer-Verlag, SpringerLink.
[13] Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič, Richard Královič, and Tobias Mömke. On the advice complexity of online problems. In Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), volume 5878 of Lecture Notes in Computer Science, pages 331–340, 2009. (c) Springer-Verlag, SpringerLink.
[14] Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Tobias Mömke, Peter Widmayer, and Anna Zych. Reoptimization of Steiner trees. In Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), volume 5124 of Lecture Notes in Computer Science, pages 258–269, 2008. (c) Springer-Verlag, SpringerLink.
[15] Hans-Joachim Böckenhauer, Juraj Hromkovič, Tobias Mömke, and Peter Widmayer. On the hardness of reoptimization. In Proc. of the 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008), volume 4910 of Lecture Notes in Computer Science, pages 50–65, Berlin, 2008. (c) Springer-Verlag, SpringerLink.
[16] Christos A. Kapoutsis, Richard Královič, and Tobias Mömke. On the size complexity of rotating and sweeping automata. In Proc. of the 12th Interational Conference on Developments in Language Theory (DLT 2008), volume 5257 of Lecture Notes in Computer Science, pages 455–466, 2008. (c) Springer-Verlag, SpringerLink.
[17] Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Tobias Mömke, and Kathleen Steinhöfel. Efficient algorithms for the spoonerism problem. In Proc. of the 4th International Conference on FUN with Algorithms (FUN 2007), volume 4475 of Lecture Notes in Computer Science, pages 78–92, Berlin, 2007. (c) Springer-Verlag, SpringerLink.
[18] Christos A. Kapoutsis, Richard Královič, and Tobias Mömke. An exponential gap between LasVegas and deterministic sweeping finite automata. In Proc. of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA 2007), volume 4665 of Lecture Notes in Computer Science, pages 130–141, 2007. (c) Springer-Verlag, SpringerLink.
[19] Richard Královič and Tobias Mömke. Approximation hardness of the traveling salesman reoptimization problem. In Proc. of the 3rd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), pages 97–104, 2007.
[20] Tobias Mömke. On the power of randomization for job shop scheduling with k-units length tasks. In Proc. of the 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006), pages 121–128, 2006.
[21] Tobias Mömke and Ola Svensson. Approximating graphic TSP by matchings. CoRR, abs/1104.3090, 2011. PDF.
[22] Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovič, Tobias Mömke, Andreas Sprock, and Björn Steffen. The Steiner tree reoptimization problem with sharpened triangle inequality. Technical Report 658, ETH Zürich, 2010. PDF.
[23] Tobias Mömke. Structural properties of hard metric TSP inputs. Technical Report 685, ETH Zürich, 2010. (c) PDF.
[24] Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, and Monika Steinová. Improved approximations for TSP with simple precedence constraints. Technical Report 650, ETH Zürich, 2009. PDF.
[25] Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič, Richard Královič, and Tobias Mömke. Online algorithms with advice. Technical Report 614, ETH Zürich, 2009. PDF.