Home

Research

Teaching

Activities

Members

Links

Contact

Imprint

• Algorithmic Game Theory
• Combinatorial Optimization
• Approximation Algorithms
• Online Algorithms
• Complexity Theory
• Scheduling
• Tournament Timetabling

• "Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities", joint work with Stephan Westphal, Networks (to appear).

• "Approximation Algorithms for TTP(2)", joint work with Stephan Westphal, Mathematical Methods of Operations Research 76:1 (2012), pp. 1-20, DOI: 10.1007/s00186-012-0387-4.

• "Extensions to Online Delay Management on a Single Train Line: New Bounds for Delay Minimization and Profit Maximization", joint work with Sven O. Krumke and Christiane Zeck, Mathematical Methods of Operations Research 74:1 (2011), pp. 53-75, DOI:10.1007/s00186-011-0349-2.

• "Interval Scheduling on Related Machines", joint work with Sven O. Krumke and Stephan Westphal, Computers and Operations Research 38:12 (2011), pp. 1836-1844, DOI:10.1016/j.cor.2011.03.001.

•  "Minimum Cost Flows with Minimum Quantities", joint work with Sven O. Krumke, Information Processing Letters 111:11 (2011), pp. 533-537, DOI:10.1016/j.ipl.2011.03.007.

• "Complexity of the Traveling Tournament Problem", joint work with Stephan Westphal, Theoretical Computer Science 412:4-5 (2011), pp. 345-351, DOI:10.1016/j.tcs.2010.10.001. A preliminary version is available for download.

• "Truthful Mechanisms for Selfish Routing and Two-Parameter Agents", joint work with Sven O. Krumke, Theory of Computing Systems 49:1 (2011), pp. 196-223, DOI:10.1007/s00224-010-9281-8. A preliminary version is available as a technical report: Report in Wirtschaftsmathematik 119, TU Kaiserslautern (2009)

• "Approximation and Complexity in Algorithmic Mechanism Design", Dissertation, TU Kaiserslautern (2010). Published as ISBN 978-3-86853-439-9, Verlag Dr. Hut.

• "Algorithmic Game Theory and Applications", OptALI Summer School 2012, Lecture Series, University of Göttingen (Germany), 29 August 2012.

• "Maximum Flows with Minimum Quantities", 21st International Symposium on Mathematical Programming (ISMP 2012), Berlin (Germany), 21 August 2012.

• "Algorithms and Complexity for Several Scheduling Problems", Invited Talk, Polytech Tours (France), 12 July 2012.

• "Intervall-Scheduling auf verwandten Maschinen", Invited Talk, University of Dortmund (Germany), 21 December 2011.

• "Interval Scheduling on Related Machines: Complexity and Online Algorithms", 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011), Nymburk (Czech Republic), 23 June 2011.

• "Truthful Mechanisms for Selfish Routing and Two-Parameter Agents", Invited Talk, University of Göttingen (Germany), 14 February 2011.

• "A Combinatorial Algorithm for Strong Implementation of Social Choice Functions", 3rd International Workshop on Computational Social Choice (COMSOC 2010), Düsseldorf (Germany), 15 September 2010.

• "Approximation and Complexity in Algorithmic Mechanism Design", Defense of PhD Thesis, University of Kaiserslautern (Germany), 12 April 2010.

• "Truthful Mechanisms for Selfish Routing and Two Parameter Agents", 2nd International Symposium on Algorithmic Game Theory (SAGT 2009), Paphos (Cyprus), 18 October 2009.

• "Complexity of Strong Implementability", 4th Athens Colloquium on Algorithms and Complexity (ACAC 2009), Athens (Greece), 21 August 2009.

• "Generalized Truthful Mechanisms for Scheduling Verifiable Related Machines", 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), Abbey Rolduc (The Netherlands), 2 July 2009.

• "A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints", 6th Workshop on Approximation and Online Algorithms (WAOA 2008), Karlsruhe (Germany), 18 September 2008