Responsive image

Zeitschriftenbeiträge (peer-reviewed)

2021

Tidswell, J.; Downward, A.; Thielen, C.; Raith, A. (2021): Minimising emissions in traffic assignment with non-monotonic arc costs. Transportation Research Part B: Methodological 153, S.70-90.
Volltext

Giudici, A.; Lu, T.; Thielen, C.; Zuidwijk, R. (2021): An analysis of the stability of hinterland container transport cooperation, Transportation Science. Transportation Science (online first) 2021.
Volltext

Boeckmann, J.; Thielen, C. (2021): A (B+1)-approximation for network flow interdiction with unit costs, Discrete Applied Mathematics. Discrete Applied Mathematics (online first) 2021 (304).
Volltext

Pferschy, U.; Schauer, J.; Thielen, C. (2021): Approximating the product knapsack problem. Optimization Letters (Online first) 15 (6).
Volltext

Herzel, A.; Ruzika, S.; Thielen, C. (2021): Approximation methods for multiobjective optimization problems: A survey. INFORMS Journal on Computing 2021.
Volltext

2020

Riga, K.; Jahr, K.; Thielen, C.; Borrmann, A. (2020): Mixed integer programming for dynamic tower crane and storage area optimization on construction sites. Automation in Construction 2020 (120).
Volltext

Bazgan, C.; Herzel, A.; Ruzika, S.; Thielen, C.; Vanderpooten, D. (2020): One-exact approximate Pareto sets. Journal of Global Optimization (2020) 2020.
Volltext

Abel, Z.; Bosboom, J.; Coulombe, M.; Demaine, E.; Hamilton, L.; Hesterberg, A.; Kopinsky, J.; Lynch, J.; Rudoy, M.; Thielen, C. (2020): Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theoretical Computer Science 2020 (839), S.41-102.
Volltext

Bazgan, C.; Herzel, A.; Ruzika, S.; Thielen, C.; Vanderpooten, D. (2020): An approximation algorithm for a general class of parametric optimization problems. Journal of Combinatorial Optimization 2020.
Volltext

2018

Krumke, S.; Thielen, C.; Weinschenk, P.; Westphal, S. (2018): Full Implementation of social choice functions in dominant strategies. International Journal of Game Theory 2018/2019 (48), S.337-361.
Volltext

Thielen, C. (2018): Duty rostering for physicians at a department of orthopedics and trauma surgery. Operations Research for Health Care 2018 (19), S.80-91.
Volltext

Herzel, A.; Hopf, M.; Thielen, C. (2018): Multistage interval scheduling games. Journal of Scheduling 2018 (22), S.359-377.
Volltext

2017

Corsten, H.; Hopf, M.; Kasper, B.; Thielen, C. (2017): Assortment Planning for Multiple Chain Stores. OR Spectrum 40 (4), S. 875-912.
Volltext

Holzhauser, M.; Krumke, S.; Thielen, C. (2017): On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows. Information Processing Letters 126, S.24-29.
Volltext

Hopf, M.; Thielen, C.; Wendt, O. (2017): Competitive Algorithms for Multistage Online Scheduling. European Journal of Operational Research 260 (2), S.468-481.
Volltext

Holzhauser, M.; Krumke, S.; Thielen, C. (2017): A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem. European Journal of Operational Research 259 (3), S.864-872.
Volltext

Giudici, A.; Halffmann, P.; Ruzika, S.; Thielen, C. (2017): Approximation Schemes for the Parametric Knapsack Problem. Information Processing Letters 120, S.11-15.
Volltext

Bender, M.; Thielen, C.; Westphal, S. (2017): Online Interval Scheduling with a Bounded Number of Failures. Journal of Scheduling 20, S.443-457.
Volltext

Halffmann, P.; Ruzika, S.; Thielen, C.; Willems, D. (2017): A General Approximation Method for Bicriteria Minimization Problems. Theoretical Computer Science 695, S.1-15.
Volltext

2016

Chassein, A.; Krumke, S.; Thielen, C. (2016): Capacitated Network Design Games with Weighted Players. Networks 68 (2), S.141-158.
Volltext

Holzhauser, M.; Krumke, S.; Thielen, C. (2016): Maximum Flows in Generalized Processing Networks. Journal of Combinatorial Optimization 33 (4), S.1226-1256.
Volltext

Holzhauser, M.; Krumke, S.; Thielen, C. (2016): Budget-Constrained Minimum Cost Flows. Journal of Combinatorial Optimization 31 (4), S.1720-1745.
Volltext

Thielen, C.; Tiedemann, M.; Westphal, S. (2016): The Online Knapsack Problem with Incremental Capacity. Mathematical Methods of Operations Research 83 (2), S.207-242.
Volltext

2015

Holzhauser, M.; Krumke, S.; Thielen, C. (2015): Convex Generalized Flows. Discrete Applied Mathematics 190-191, S.86-99.
Volltext

Bender, M.; Thielen, C.; Westphal, S. (2015): Packing Items Into Several Bins Facilitates Approximating the Separable Assignment Problem. Information Processing Letters 115 (6-8), S.570-575.
Volltext

2013

Krumke, S.; Thielen, C. (2013): The Generalized Assignment Problem with Minimum Quantities. European Journal of Operational Research 228 (1), S.46-55.
Volltext

Thielen, C.; Westphal, S. (2013): Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities. Networks 62 (2), S.125-131.
Volltext

2012

Thielen, C.; Westphal, S. (2012): Approximation Algorithms for TTP(2). Mathematical Methods of Operations Research 76 (1), S.1-20.
Volltext

2011

Krumke, S.; Thielen, C.; Westphal, S. (2011): Interval Scheduling on Related Machines. Computers and Operations Research 38 (12), S.1836-1844.
Volltext

Krumke, S.; Thielen, C. (2011): Minimum Cost Flows with Minimum Quantities. Information Processing Letters 111 (11), S.533-537.
Volltext

Krumke, S.; Thielen, C.; Zeck, C. (2011): 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), S.53-75.
Volltext

Thielen, C.; Westphal, S. (2011): Complexity of the Traveling Tournament Problem. Theoretical Computer Science 412 (4-5), S.345-351.
Volltext

2010

Thielen, C.; Krumke, S. (2010): Truthful mechanisms for selfish routing and two-parameter agents. Theory of Computing Systems 49 (1), S.196–223.
Volltext


Beiträge zu wissenschaftlicher Konferenz/Tagung (peer-reviewed)

2020

Boeckmann, J.; Thielen, C. (2020): An approximation algorithm for network flow interdiction with unit costs and two capacities. Proceeding of the 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) 5, S.157-169.

2019

Bazgan, C.; Herzel, A.; Ruzika, S.; Thielen, C.; Vanderpooten, D. (2019): An FPTAS for a General Class of Parametric Optimization Problems. Konferenzbeitrag für Proceedings of the 25th International Computing and Combinatorics Conference (COCOON) 2019 (11653), S. 25-37.
Volltext

Giudici, A.; Lu, T.; Thielen, C.; Zuidwijk, R. (2019): Sending a reliable cost-efficient flow through a stochastic timevarying network. Proceedings of the 10th Triennial Symposium on Transportation Analysis (TRISTAN) 2019, S.1-4.

2018

Schwahn, F.; Thielen, C. (2018): The Complexity of Escaping Labyrinths and Enchanted Forests. Konferenzbeitrag zu Proceedings of the 9th International Conference on Fun with Algorithms (FUN) 2018 (100), S.1-13.
Volltext

2017

Corsten, H.; Hopf, M.; Kasper, B.; Thielen, C. (2017): Regionalized assortment planning for multiple chain stores. in A. Fink, A. Fügenschuh, M. Geiger (Eds.), Selected Papers of the Annual International Conference of the German Operations Research Society (GOR) 2017, S.451-457.
Volltext

2016

Raith, A.; Thielen, C.; Tidswell, J. (2016): Modelling and optimising fuel consumption in traffic assignment problems. Proceedings of the 38th Australasian Transport Research Forum (ATRF) 2016, S.1-13.
Volltext

Kölker, K.; Mannweiler, C.; Thielen, C.; Lütjens, K. (2016): Time Relaxed Itinerary-Based Route Development for Airline Networks. Konferenzbeitrag für Proceedings of the 9th Triennial Symposium on Transportation Analysis (TRISTAN) 2016, S.1-4.

2015

Hamling, I.; O'Sullivan, M.; Thielen, C.; Walker, C. (2015): Improving resource efficiency in Internet cafés by virtualization and optimal user allocation. Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC) 2015, S.26-34.
Volltext

2014

Worreschk, S.; Kaufmann Alves, I.; Schmitt, T.; Thielen, C. (2014): Optimization of Transformation Processes of Drainage Systems in Rural Areas. Konferenzbeitrag für Proceedings of the 13th International Conference on Urban Drainage (ICUD) 2014, S.1-8.

Schmitt, T.; Worreschk, S.; Kaufmann Alves, I.; Herold, F.; Thielen, C. (2014): An Optimization and Decision Support Tool for Long-Term Strategies in the Transformation of Urban Water Infrastructure. Konferenzbeitrag für Proceedings of the 11th International Conference on Hydroinformatics (HIC) 2014, S.1-8.

Krumke, S.; Schwahn, F.; Thielen, C. (2014): Being Negative Makes Life NP-hard (for Product Sellers). Konferenzbeitrag für Proceedings of the 7th International Conference on Fun with Algorithms (FUN) 2014 (8496), S.277-288.
Volltext

2013

Bender, M.; Thielen, C.; Westphal, S. (2013): A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2013 (8087), S.135-145.
Volltext

2011

Krumke, S.; Thielen, C.; Westphal, S. (2011): 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, S.236-238.

2010

Thielen, C.; Westphal, S. (2010): Approximating the Traveling Tournament Problem with Maximum Tour Length 2. Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC) 2010 (6507), S.303-314.

Thielen, C.; Krumke, S. (2010): Strong implementation of social choice function in dominant strategies. Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010, S.319–330.

Thielen, C.; Westphal, S. (2010): A combinatorial algorithm for strong implementation of social choice functions. Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC) 2010, S.331-341.

2009

Thielen, C.; Krumke, S. (2009): Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. Konferenzbeitrag für Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT) 2009 (5814), S.36-47.

Thielen, C.; Krumke, S. (2009): Complexity of Strong Implementability. Konferenzbeitrag für Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC) 2009 (4), S. 1-12.
Volltext

Thielen, C. (2009): Generalized truthful mechanisms for scheduling verifiable related machines. Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) 2009, S.198-200.

2008

Thielen, C.; Krumke, S. (2008): A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. Konferenzbeitrag für Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA) 2008 (5426), S.105-118.
Volltext