A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. - Clemens Thielen; Sven Oliver Krumke (WAOA, 2008)

Complexity of Strong Implementability - Clemens Thielen; Sven Oliver Krumke (ACAC, 2009)

Approximating the Traveling Tournament Problem with Maximum Tour Length 2. - Clemens Thielen; Stephan Westphal (ISAAC (2), 2010)

Approximation and Complexity in Algorithmic Mechanism Design. - Clemens Thielen (Verlag Dr. Hut, 2010)

Interval scheduling on related machines. - Sven Oliver Krumke; Clemens Thielen; Stephan Westphal (Comput. Oper. Res., 2011)

Minimum cost flows with minimum quantities. - Sven Oliver Krumke; Clemens Thielen (Inf. Process. Lett., 2011)

Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. - Sven Oliver Krumke; Clemens Thielen; Christiane Zeck (Math. Methods Oper. Res., 2011)

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. - Clemens Thielen; Sven Oliver Krumke (Theory Comput. Syst., 2011)

Complexity of the traveling tournament problem. - Clemens Thielen; Stephan Westphal (Theor. Comput. Sci., 2011)

Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. - Sven Oliver Krumke; Clemens Thielen (Inf. Process. Lett., 2012)

Approximation algorithms for TTP(2). - Clemens Thielen; Stephan Westphal (Math. Methods Oper. Res., 2012)

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. - Marco Bender; Clemens Thielen; Stephan Westphal (MFCS, 2013)

The generalized assignment problem with minimum quantities. - Sven Oliver Krumke; Clemens Thielen (Eur. J. Oper. Res., 2013)

Complexity and approximability of the maximum flow problem with minimum quantities. - Clemens Thielen; Stephan Westphal (Networks, 2013)

Being Negative Makes Life NP-hard (for Product Sellers). - Sven Oliver Krumke; Florian D. Schwahn; Clemens Thielen (FUN, 2014)

Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation. - Isaac Hamling; Michael J. O'Sullivan; Cameron G. Walker; Clemens Thielen (UCC, 2015)

Convex generalized flows. - Michael Holzhauser; Sven Oliver Krumke; Clemens Thielen (Discret. Appl. Math., 2015)

Packing items into several bins facilitates approximating the separable assignment problem. - Marco Bender; Clemens Thielen; Stephan Westphal (Inf. Process. Lett., 2015)

Regionalized Assortment Planning for Multiple Chain Stores. - Hans Corsten; Michael Hopf; Benedikt Kasper; Clemens Thielen (OR, 2016)

Budget-constrained minimum cost flows. - Michael Holzhauser; Sven Oliver Krumke; Clemens Thielen (J. Comb. Optim., 2016)

The online knapsack problem with incremental capacity. - Clemens Thielen; Morten Tiedemann; Stephan Westphal (Math. Methods Oper. Res., 2016)

Capacitated network design games with weighted players. - André B. Chassein; Sven O. Krumke; Clemens Thielen (Networks, 2016)

A network simplex method for the budget-constrained minimum cost flow problem. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (Eur. J. Oper. Res., 2017)

Competitive algorithms for multistage online scheduling. - Michael Hopf; Clemens Thielen; Oliver Wendt (Eur. J. Oper. Res., 2017)

Approximation schemes for the parametric knapsack problem. - Alberto Giudici; Pascal Halffmann; Stefan Ruzika; Clemens Thielen (Inf. Process. Lett., 2017)

On the complexity and approximability of budget-constrained minimum cost flows. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (Inf. Process. Lett., 2017)

Maximum flows in generalized processing networks. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (J. Comb. Optim., 2017)

Online interval scheduling with a bounded number of failures. - Marco Bender; Clemens Thielen; Stephan Westphal (J. Sched., 2017)

A general approximation method for bicriteria minimization problems. - Pascal Halffmann; Stefan Ruzika; Clemens Thielen; David Willems (Theor. Comput. Sci., 2017)

The Complexity of Escaping Labyrinths and Enchanted Forests. - Florian D. Schwahn; Clemens Thielen (FUN, 2018)

Assortment planning for multiple chain stores. - Hans Corsten; Michael Hopf; Benedikt Kasper; Clemens Thielen (OR Spectr., 2018)

An FPTAS for a General Class of Parametric Optimization Problems. - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (COCOON, 2019)

The Product Knapsack Problem: Approximation and Complexity. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (CoRR, 2019)

Full implementation of social choice functions in dominant strategies. - Sven O. Krumke; Clemens Thielen; Philipp Weinschenk; Stephan Westphal (Int. J. Game Theory, 2019)

Multistage interval scheduling games. - Arne Herzel; Michael Hopf; Clemens Thielen (J. Sched., 2019)

Special issue on: Computational discrete optimization. - Arie M. C. A. Koster; Clemens Thielen (EURO J. Comput. Optim., 2020)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. - Zachary Abel; Jeffrey Bosboom; Michael J. Coulombe; Erik D. Demaine; Linus Hamilton; Adam Hesterberg; Justin Kopinsky; Jayson Lynch; Mikhail Rudoy; Clemens Thielen (Theor. Comput. Sci., 2020)

Enforcing fuel-optimal traffic patterns. - Sophia Boesen; Andrea Raith; Clemens Thielen; James Tidswell (EURO J. Transp. Logist., 2021)

Approximation Methods for Multiobjective Optimization Problems: A Survey. - Arne Herzel; Stefan Ruzika; Clemens Thielen (INFORMS J. Comput., 2021)

One-exact approximate Pareto sets. - Arne Herzel; Cristina Bazgan; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (J. Glob. Optim., 2021)

Approximating the product knapsack problem. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (Optim. Lett., 2021)

An Analysis of the Stability of Hinterland Container Transport Cooperation. - Alberto Giudici; Tao Lu 003; Clemens Thielen; Rob A. Zuidwijk (Transp. Sci., 2021)

An approximation algorithm for a general class of parametric optimization problems. - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (J. Comb. Optim., 2022)

An approximation algorithm for a general class of multi-parametric optimization problems. - Stephan Helfrich; Arne Herzel; Stefan Ruzika; Clemens Thielen (J. Comb. Optim., 2022)

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. - Cristina Bazgan; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (Theory Comput. Syst., 2022)

Complexity of the Temporal Shortest Path Interdiction Problem. - Jan Boeckmann; Clemens Thielen; Alina Wittmann (SAND, 2023)

Integrated Planning in Hospitals: A Review. - Sebastian Rachuba; Melanie Reuter-Oppermann; Clemens Thielen (CoRR, 2023)

Approximating single- and multi-objective nonlinear sum and product knapsack problems. - Jan Boeckmann; Clemens Thielen; Ulrich Pferschy (Discret. Optim., 2023)

Approximating biobjective minimization problems using general ordering cones. - Arne Herzel; Stephan Helfrich; Stefan Ruzika; Clemens Thielen (J. Glob. Optim., 2023)

New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application. - Jan Boeckmann; Clemens Thielen (Oper. Res. Forum, 2023)

A (B+1)-approximation for network flow interdiction with unit costs. - Jan Boeckmann; Clemens Thielen (Discret. Appl. Math., 2024)

Operational Research: methods and applications. - Fotios Petropoulos; Gilbert Laporte; Emel Aktas; Sibel A. Alumur; Claudia Archetti; Hayriye Ayhan; Maria Battarra; Julia A. Bennell; Jean-Marie Bourjolly; John E. Boylan; Michèle Breton; David Canca; et al. (J. Oper. Res. Soc., 2024)

Approximating multiobjective optimization problems: How exact can you be? - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (Math. Methods Oper. Res., 2024)

Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. - Stephan Helfrich; Arne Herzel; Stefan Ruzika; Clemens Thielen (Math. Methods Oper. Res., 2024)

A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem. - Cristina Bazgan; Johannes Kager; Clemens Thielen; Daniel Vanderpooten (Networks, 2025)