Prof. Dr. Tobias Mömke


Universität Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5
28359 Bremen

Office: MZH 3210
Phone: +49 (421) 218-xxx

Office hours: by appointment

Interim Professor for Theoretical Computer Science

Research Interests

My research aims to develop new algorithmic approaches for computationally hard problems. In particular I am interested in algorithms for global NP-hard optimization problems such as the traveling salesperson problem or the Steiner tree problem. I am particularly interested in using and developing techniques from combinatorial optimization, with a special focus on linear programming and related advanced methods.

As a second major theme of my research, I focus on online problems. The purpose of online computation is to analyze strategies to take decisions in the absence of future information. Unlike in the case of NP-hard optimization problems, the hardness of online problems does not arise from limited time resources but instead from a limited knowledge of future events. My research on online algorithms aims to identify the inherent properties of online problems that are responsible for the existence or nonexistence of useful algorithms.


My list of publications can be found here.

For accessing further information (citations, bibtex files etc.), please visit my profile at DBLP or my profile at google scholar.

Current Teaching (WS 2017/18)

  • Bachelor Course: Theoretical Computer Science
  • Master's Course: Efficient Algorithms
  • Seminar: Diskrete Strukturen: Kombinatorik, Graphen, Färbungen (Megow, Mömke)
  • Projekt: Shared Mobility: Modelle, Algorithmen und Optimierung (Megow, Mömke, Eberle)

A complete list of my current and previous courses can be found here.


DFG Project "Neuartige Approximationstechniken für Traveling Salesperson Probleme"

Program Committee Member

19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2016)

Recent Positions

Valid XHTML 1.0 Transitional