Prof. Dr. Clemens Thielen
 S. O. Krumke, C. Thielen, P. Weinschenk, S. Westphal, Full implementation of social choice functions in dominant strategies, International Journal of Game Theory 48 (1) (2019) 337–361.
 A. Herzel, M. Hopf, C. Thielen, Multistage interval scheduling games, Journal of Scheduling 22 (3) (2019) 359–377.
 C. Thielen, Duty rostering for physicians at a department of orthopedics and trauma surgery, Operations Research for Health Care 19 (2018) 80–91.
 H. Corsten, M. Hopf, B. Kasper, C. Thielen, Assortment planning for multiple chain stores, OR Spectrum 40 (4) (2017) 875–912.
 P. Halffmann, S. Ruzika, C. Thielen, D. Willems, A general approximation method for bicriteria minimization problems, Theoretical Computer Science 695 (2017) 1–15.
 M. Holzhauser, S. O. Krumke, C. Thielen, On the complexity and approximability of budget-constrained minimum cost flows, Information Processing Letters 126 (2017) 24–29.
 M. Bender, C. Thielen, S. Westphal, Online interval scheduling with a bounded number of failures, Journal of Scheduling 20 (2017) 443–457.
 M. Hopf, C. Thielen, O. Wendt, Competitive algorithms for multistage online scheduling, European Journal of Operational Research 260 (2) (2017) 468–481.
 A. Giudici, P. Halffmann, S. Ruzika, C. Thielen, Approximation schemes for the parametric knapsack problem, Information Processing Letters 120 (2017) 11–15.
 M. Holzhauser, S. O. Krumke, C. Thielen, A network simplex method for the budget-constrained minimum cost flow problem, European Journal of Operational Research 259 (3) (2017) 864–872.
 M. Holzhauser, S. O. Krumke, C. Thielen, Maximum flows in generalized processing networks, Journal of Combinatorial Optimization 33 (4) (2017) 1226–1256.
 A. Chassein, S. O. Krumke, C. Thielen, Capacitated network design games with weighted players, Networks 68 (2) (2016) 141–158.
 C. Thielen, M. Tiedemann, S. Westphal, The online knapsack problem with incremental capacity, Mathematical Methods of Operations Research 83 (2) (2016) 207–242.
 M. Holzhauser, S. O. Krumke, C. Thielen, Budget-constrained minimum cost flows, Journal of Combinatorial Optimization 31 (4) (2016) 1720–1745.
 M. Holzhauser, S. O. Krumke, C. Thielen, Convex generalized flows, Discrete Applied Mathematics 190-191 (2015) 86–99.
 M. Bender, C. Thielen, S. Westphal, Packing items into several bins facilitates approximating the separable assignment problem, Information Processing Letters 115 (6–8) (2015) 570–575.
 S. O. Krumke, C. Thielen, The generalized assignment problem with minimum quantities, European Journal of Operational Research 228 (1) (2013) 46–55.
 C. Thielen, S. Westphal, Complexity and approximability of the maximum flow problem with minimum quantities, Networks 62 (2) (2013) 125–131.
 C. Thielen, S. Westphal, Approximation algorithms for TTP(2), Mathematical Methods of Operations Research 76 (1) (2012) 1–20.
 S. O. Krumke, C. Thielen, C. Zeck, Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization, Mathematical Methods of Operations Research 74 (1) (2011) 53–75.
 S. O. Krumke, C. Thielen, S. Westphal, Interval scheduling on related machines, Computers and Operations Research 38 (12) (2011) 1836–1844.
 S. O. Krumke, C. Thielen, Minimum cost flows with minimum quantities, Information Processing Letters 111 (11) (2011) 533–537.
 C. Thielen, S. Westphal, Complexity of the traveling tournament problem, Theoretical Computer Science 412 (4-5) (2011) 345–351.
 C. Thielen, S. O. Krumke, Truthful mechanisms for selfish routing and two-parameter agents, Theory of Computing Systems 49 (1) (2011) 196–223.
Articles in Refereed Conference Proceedings
 C. Bazgan, A. Herzel, S. Ruzika, C. Thielen, D. Vanderpooten, An FPTAS for a general class of parametric optimization problems, in: Proceedings of the 25th International Computing and Combinatorics Conference (COCOON), Vol. 11653 of LNCS, 2019, pp. 25–37.
 A. Giudici, T. Lu, C. Thielen, R. Zuidwijk, Sending a reliable cost-efficient flow through a stochastic timevarying network, in: Proceedings of the 10th Triennial Symposium on Transportation Analysis (TRISTAN), 2019, pp. 1–4.
 F. D. Schwahn, C. Thielen, The complexity of escaping labyrinths and enchanted forests, in: Proceedings of the 9th International Conference on Fun with Algorithms (FUN), Vol. 100 of LIPIcs, 2018, pp. 30:1–13.
 H. Corsten, M. Hopf, B. Kasper, C. Thielen, Regionalized assortment planning for multiple chain stores, in: A. Fink, A. Fügenschuh, M. Geiger (Eds.), Operations Research Proceedings 2016 – Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Springer, 2018, pp. 451–457. doi:10.1007/978-3-319-55702-1_60.
 A. Raith, C. Thielen, J. Tidswell, Modelling and optimising fuel consumption in traffic assignment problems, in: Proceedings of the 38th Australasian Transport Research Forum (ATRF), 2016, pp. 1–13.
 K. Kölker, C. Mannweiler, C. Thielen, K. Lütjens, Time relaxed itinerary-based route development for airline networks, in: Proceedings of the 9th Triennial Symposium on Transportation Analysis (TRISTAN), 2016, pp. 1–4.
 I. Hamling, M. O’Sullivan, C. Thielen, C. Walker, Improving resource efficiency in Internet cafés by virtualization and optimal user allocation, in: Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), 2015, pp. 1–9.
 S. Worreschk, I. Kaufmann Alves, T. G. Schmitt, C. Thielen, Optimization of transformation processes of
drainage systems in rural areas, in: Proceedings of the 13th International Conference on Urban Drainage (ICUD), 2014, pp. 1–8.
 T. G. Schmitt, S. Worreschk, I. Kaufmann Alves, F. Herold, C. Thielen, An optimization and decision support tool for long-term strategies in the transformation of urban water infrastructure, in: Proceedings of the 11th International Conference on Hydroinformatics (HIC), 2014, pp. 1–8.