Alternativer Text

Publikationen

Prof. Dr. Clemens Thielen

Forschungsartikel in wissenschaftlichen Zeitschriften

[1] Z. Abel, J. Bosboom, M. Coulombe, E. D. Demaine, L. Hamilton, A. Hesterberg, J. Kopinsky, J. Lynch, M. Rudoy, C. Thielen, Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible, Theoretical Computer Science (to appear).

[2] K. Riga, K. Jahr, C. Thielen, A. Borrmann, Mixed integer programming for dynamic tower crane and storage area optimization on construction sites, Automation in Construction (to appear).

[3] 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.

[4] A. Herzel, M. Hopf, C. Thielen, Multistage interval scheduling games, Journal of Scheduling 22 (3) (2019) 359–377.

[5] C. Thielen, Duty rostering for physicians at a department of orthopedics and trauma surgery, Operations Research for Health Care 19 (2018) 80–91.

[6] H. Corsten, M. Hopf, B. Kasper, C. Thielen, Assortment planning for multiple chain stores, OR Spectrum 40 (4) (2017) 875–912.

[7] P. Halffmann, S. Ruzika, C. Thielen, D. Willems, A general approximation method for bicriteria minimization problems, Theoretical Computer Science 695 (2017) 1–15.

[8] 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.

[9] M. Bender, C. Thielen, S. Westphal, Online interval scheduling with a bounded number of failures, Journal of Scheduling 20 (2017) 443–457.

[10] M. Hopf, C. Thielen, O. Wendt, Competitive algorithms for multistage online scheduling, European Journal of Operational Research 260 (2) (2017) 468–481.

[11] A. Giudici, P. Halffmann, S. Ruzika, C. Thielen, Approximation schemes for the parametric knapsack problem, Information Processing Letters 120 (2017) 11–15.

[12] 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.

[13] M. Holzhauser, S. O. Krumke, C. Thielen, Maximum flows in generalized processing networks, Journal of Combinatorial Optimization 33 (4) (2017) 1226–1256.

[14] A. Chassein, S. O. Krumke, C. Thielen, Capacitated network design games with weighted players, Networks 68 (2) (2016) 141–158.

[15] C. Thielen, M. Tiedemann, S. Westphal, The online knapsack problem with incremental capacity, Mathematical Methods of Operations Research 83 (2) (2016) 207–242.

[16] M. Holzhauser, S. O. Krumke, C. Thielen, Budget-constrained minimum cost flows, Journal of Combinatorial Optimization 31 (4) (2016) 1720–1745.

[17] M. Holzhauser, S. O. Krumke, C. Thielen, Convex generalized flows, Discrete Applied Mathematics 190-191 (2015) 86–99.

[18] 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.

[19] S. O. Krumke, C. Thielen, The generalized assignment problem with minimum quantities, European Journal of Operational Research 228 (1) (2013) 46–55.

[20] C. Thielen, S. Westphal, Complexity and approximability of the maximum flow problem with minimum quantities, Networks 62 (2) (2013) 125–131.

[21] C. Thielen, S. Westphal, Approximation algorithms for TTP(2), Mathematical Methods of Operations Research 76 (1) (2012) 1–20.

[22] 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.

[23] S. O. Krumke, C. Thielen, S. Westphal, Interval scheduling on related machines, Computers and Operations Research 38 (12) (2011) 1836–1844.

[24] S. O. Krumke, C. Thielen, Minimum cost flows with minimum quantities, Information Processing Letters 111 (11) (2011) 533–537.

[25] C. Thielen, S. Westphal, Complexity of the traveling tournament problem, Theoretical Computer Science 412 (4-5) (2011) 345–351.

[26] C. Thielen, S. O. Krumke, Truthful mechanisms for selfish routing and two-parameter agents, Theory of Computing Systems 49 (1) (2011) 196–223.

 

Forschungsartikel in referierten Tagungs- und Sammelbänden

[27] J. Boeckmann, C. Thielen, An approximation algorithm for network flow interdiction with unit costs and two capacities, to appear in: Proceeding of the 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW)

[28] 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.

[29] 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.

[30] 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.

[31] 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.

[32] 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.

[33] 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.

[34] 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.

[35] 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.

[36] 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.

[37] S. O. Krumke, F. D. Schwahn, C. Thielen, Being negative makes life NP-hard (for product sellers), in: Proceedings of the 7th International Conference on Fun with Algorithms (FUN), Vol. 8496 of LNCS, 2014, pp. 277–288.

[38] M. Bender, C. Thielen, S. Westphal, A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items, in: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), Vol. 8087 of LNCS, 2013, pp. 135–145.

[39] S. O. Krumke, C. Thielen, S. Westphal, Interval scheduling on related machines: Complexity and online algorithms, in: Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2011, pp. 236–238.

[40] C. Thielen, S. Westphal, Approximating the traveling tournament problem with maximum tour length 2, in: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC), Vol. 6507 of LNCS, 2010, pp. 303–314.

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

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

[43] C. Thielen, S. O. Krumke, Truthful mechanisms for selfish routing and two-parameter agents, in: Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), Vol. 5814 of LNCS, 2009, pp. 36–47.

[44] C. Thielen, S. O. Krumke, Complexity of strong implementability, in: Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC), Vol. 4 of EPTCS, 2009, pp. 1–12.

[45] C. Thielen, 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, pp. 198–200.

[46] C. Thielen, S. O. Krumke, A general scheme for designing monotone algorithms for scheduling problems with precedence constraints, in: Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA), Vol. 5426 of LNCS, 2008, pp. 105–118.

Jan Boeckmann, M.Sc.

Forschungsartikel in wissenschaftlichen Zeitschriften

 

Forschungsartikel in referierten Tagungs- und Sammelbänden

[1] J. Boeckmann, C. Thielen, An approximation algorithm for network flow interdiction with unit costs and two capacities, to appear in: Proceeding of the 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW)

Arne Herzel, M.Sc.

Forschungsartikel in wissenschaftlichen Zeitschriften

[1] A. Herzel, M. Hopf, C. Thielen, Multistage interval scheduling games, Journal of Scheduling 22 (3) (2019) 359–377.

 

Forschungsartikel in referierten Tagungs- und Sammelbänden

[2] 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.

Kontakt

Professur Komplexe Netzwerke

Essigberg 3
94315 Straubing

Leitung

Prof. Dr. Clemens Thielen

Tel.: +49 (0) 9421 187 175
E-Mail: clemens.thielen@hswt.de

Sekretariat

Alexandra Hering

Tel.: +49 (0) 9421 187 239
E-Mail: alexandra.hering@hswt.de