Zur Hauptnavigation / To main navigation

Zur Sekundärnavigation / To secondary navigation

Zum Inhalt dieser Seite / To the content of this page

Hauptnavigation / Main Navigation

Sekundärnavigation / Secondary navigation

Research

Inhaltsbereich / Content

Research Areas

  • Algorithmic Game Theory
  • Approximation Algorithms
  • Combinatorial Optimization
  • Network Flows
  • Online Algorithms
  • Scheduling

  

Journal Articles

  • "A General Approximation Method for Bicriteria Minimization Problems", joint work with Pascal Halffmann, Stefan Ruzika, and David Willems, Theoretical Computer Science (online first), DOI: 10.1016/j.tcs.2017.07.003
  • "On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows", joint work with Michael Holzhauser and Sven O. Krumke, Information Processing Letters 126 (2017), pp. 24-29 DOI: 10.1016/j.ipl.2017.06.003
  • "Online Interval Scheduling with Bounded Number of Failures", joint work with Marco Bender and Stephan Westphal, Journal of Scheduling (online first), DOI: 10.1007/s10951-016-0506-9
  • "Competitive Algorithms for Multistage Online Scheduling" joint work with Michael Hopf and Oliver Wendt, European Journal of Operational Research 260:2 (2017), pp. 468-481, DOI: 10.1016/j.ejor.2016.12.047
  • "Approximation Schemes for the Parametric Knapsack Problem", joint work with Alberto Giudici, Pascal Halffmann and Stefan Ruzika, Information Processing Letters 120 (2017), pp. 11-15, DOI: 10.1016/j.ipl.2016.12.003
  • "A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem", joint work with Michael Holzhauser and Sven O. Krumke, European Journal of Operational Research 259:3 (2017), pp. 864-872, DOI: 10.1016/j.ejor.2016.11.024
  • "Maximum Flows in Generalized Processing Networks", joint work with Michael Holzhauser and Sven O. Krumke, Journal of Combinatorial Optimization 33:4 (2017), pp. 1226-1256, DOI: 10.1007/s10878-016-0031-y
  • "Capacitated Network Design Games with Weighted Players", joint work with André Chassein and Sven O. Krumke, Networks 68:2 (2016), pp. 141-158, DOI: 10.1002/net.21689
  • "The Online Knapsack Problem with Incremental Capacity", joined work with Morten Tiedemann and Stephan Westphal, Mathematical Methods of Operations Research 83:2 (2016), pp. 207-242, DOI: 10.1007/s00186-015-0526-9.
  • "Budget-Constrained Minimum Cost Flows", joint work with Michael Holzhauser and Sven O. Krumke, Journal of Combinatorial Optimization 31:4 (2016), pp. 1720-1745, DOI: 10.1007/s10878-015-9865-y.
  • "Convex Generalized Flows", joint work with Michael Holzhauser and Sven O. Krumke, Discrete Applied Mathematics 190-191 (2015), pp. 86-99, DOI: 10.1016/j.dam.2015.03.021.
  • "Packing Items Into Several Bins Facilitates Approximating the Separable Assignment Problem", joint work with Marco Bender and Stephan Westphal, Information Processing Letters 115:6-8 (2015), pp. 570-575, DOI: 10.1016/j.ipl.2015.02.001.
  • "The Generalized Assignment Problem with Minimum Quantities", joint work with Sven O. Krumke, European Journal of Operational Research 228:1 (2013), pp. 46–55, DOI: 10.1016/j.ejor.2013.01.027.
  • "Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities", joint work with Stephan Westphal, Networks 62:2 (2013), pp. 125-131, DOI: 10.1002/net.21502.
  • "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)

  

Articles in Refereed Conference Proceedings

  • "Regionalized Assortment Planning for Multiple Chain Stores", joint work with Hans Corsten, Michael Hopf, and Benedikt Kasper. In: Operations Research Proceedings 2016.
  • "Modelling and Optimising Fuel Consumption in Traffic Networks", joint work with Andrea Raith and James Tidswell, In: Proceedings of the 38th Australasian Transport Research Forum (ATRF 2016).
  • "Time Relaxed Itinerary-Based Route Development for Airline Networks", joint work with Katrin Kölker, Carolin Mannweiler, and Klaus Lütjens, In: Proceedings of the 9th Triennial Symposium on Transportation Analysis (TRISTAN 2016).
  • "Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation", joint work with Isaac Hamling, Michael O'Sullivan, and Cameron Walker, In: Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC 2015).
  • "Optimization of Transformation Processes of Drainage Systems in Rural Areas", joint work with Inka Kaufmann Alves, Theo G. Schmitt, and Silja Worreschk, In: Proceedings of the 13th International Conference on Urban Drainage (ICUD 2014).
  • "An Optimization and Decision Support Tool for Long-Term Strategies in the Transformation of Urban Water Infrastructure", joint work with Frank Herold, Inka Kaufmann Alves, Theo G. Schmitt, and Silja Worreschk, In: Proceedings of the 11th International Conference on Hydroinformatics (HIC 2014).
  • "Being Negative Makes Life NP-hard (for Product Sellers)", joint work with Sven O. Krumke and Florian D. Schwahn, In: Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Alfredo Ferro, Fabrizio Luccio, and Peter Widmayer (eds.), LNCS vol. 8496, pp. 277-288, Springer.
  • "A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items", joint work with Marco Bender and Stephan Westphal, In: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Krishnendu Chatterjee and Jirí Sgall (eds.), LNCS vol. 8087 (2013), pp. 135-145, Springer.
  • "Interval Scheduling on Related Machines: Complexity and Online Algorithms", joint work with Sven O. Krumke and Stephan Westphal, In: Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011).
  • "Approximating the Traveling Tournament Problem with Maximum Tour Length 2", joint work with Stephan Westphal, In: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Part II, Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park (eds.), LNCS vol. 6507 (2010), pp. 303-314, Springer.

  • "Strong Implementation of Social Choice Functions in Dominant Strategies", joint work with Sven O. Krumke, In: Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC 2010).
  • "A Combinatorial Algorithm for Strong Implementation of Social Choice Functions", joint work with Stephan Westphal, In: Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC 2010).

  • "Truthful Mechanisms for Selfish Routing and Two-Parameter Agents", joint work with Sven O. Krumke, In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT 2009), Marios Mavronicolas and Vicky G. Papadopoulou (eds.), LNCS vol. 5814 (2009), pp. 36-47, Springer.
  • "Complexity of Strong Implementability", joint work with Sven O. Krumke, In: Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC 2009), Evangelos Markakis and Ioannis Milis (eds.), EPTCS 4 (2009), pp. 1–12, DOI: 10.4204/EPTCS.4.1
  • "Generalized Truthful Mechanisms for Scheduling Verifiable Related Machines", In: Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009).
  • "A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints", joint work with Sven O. Krumke, In: Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA 2008), Evripidis Bampis and Martin Skutella (eds.), LNCS vol. 5426 (2009), pp. 105-118, Springer.

     

Other Publications

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