• Lower Bounds and Quality Guarantees for Online-Dispatching, 2004, PDF [663 kB]
  • Aspects of Online Routing and Scheduling,2007, PDF [796 kB]
Chapters in Books
Refereed Conference Proceedings
  • F. Merz, C. Schwindt, S. Westphal, J. Zimmermann A multi-round auction for staff to job assignment under myopic best response dynamics, IEEE International Conference on Industrial Engineering and Engineering Management, 2020,
  • J. Zillies, S. Westphal, D. Thakur, V. Kumar, G. Pappas, D. Scheidt A column generation approach for optimized routing and coordination of a UAV fleet, Proceedings of the 2016 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), October 2016,
  • M. Goerigk, R. Hoshino, K. Kawarabayashi, S. Westphal, Solving the Traveling Tournament Problem by Packing Three-Vertex Paths, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), PDF [424 kB], Quebec City, Quebec, July 2014
  • M. Bender, S. Westphal, Maximum Generalized Assignment with Convex Costs, Proceedings of 3rd International Symposium on Combinatorial Optimization (ISCO 2014), LNCS, Volume 8596, Pages 75-86, Springer,
  • M. Bender, C. Thielen, S. Westphal, A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items, Proceedings of Mathematical Foundations of Computer Science 2013 (MFCS 2013), LNCS, Volume 8087, Pages 135-145, Springer,
  • S.O. Krumke, C. Thielen, S. Westphal, Interval Scheduling on Related Machines: Complexity and Online Algorithms, Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011)
  • J. Frasch, S.O. Krumke, S. Westphal, MIP Formulations for Flowshop Scheduling with Limited Buffers, Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011),
  • C. Thielen, S. Westphal, Approximating the Traveling Tournament Problem with Maximum Tour Length 2, Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Part II, Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park (eds.), LNCS, Volume 6507 (2010), Pages 303-314, Springer,
  • S. Westphal, K. Noparlik, A 5.875-Approximation for the Traveling Tournament Problem, Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010)
  • C. Thielen, S. Westphal, A Combinatorial Algorithm for Strong Implementation of Social Choice Functions, Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC 2010)
  • K. Bauer, T. Fischer, S. O. Krumke, K. Gerhardt, S. Westphal and P. Merz, Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem, Evolutionary Computation in Combinatorial Optimization Published Lecture Notes in Computer Science, 2008, Volume 4972, Pages 158-169, Springer, PDF [190 kB]
  • S. Westphal, S. O. Krumke, Rob van Stee, Competitive Algorithms for Cottage Rental Journal Electronic Notes in Discrete Mathematics, Volume 25, 1 August 2006, Pages 187-188
  • S. Saliba, S. O. Krumke, S. Westphal, Online-Optimization of Large-Scale Vehicle Dispatching Problems Journal Electronic Notes in Discrete Mathematics, Volume 25, 1 August 2006, Pages 145-146
  • S. Westphal, S. O. Krumke, Improved Pruning in Column Generation of a Vehicle Routing ProblemProceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications,  2005, 705-722

Research Areas and Application

  • Combinatorial Optimization
  • Mixed Integer Programming
  • Online Optimization
  • Sports Scheduling
  • Vehicle Routing
  • Scheduling