AG Optimierung

Juniorprof. Dr. Clemens Thielen

Anschrift

Paul-Ehrlich-Straße
Gebäude 14 , Raum 424
67663 Kaiserslautern

Postfach 3049
67653 Kaiserslautern

Kontakt

Tel.: +49 631 205 4590
Fax: +49 631 205 4737
E-Mail: thielen@mathematik.uni-kl.de


Forschungsinteressen

Meine Forschungsinteressen sind

  • Algorithmische Spieltheorie
  • Approximationsalgorithmen
  • Kombinatorische Optimierung
  • Netzwerkflüsse
  • Online-Algorithmen
  • Scheduling

Aktuelle Vorlesungen

Veröffentlichungen

  • Multistage Interval Scheduling Games
    A. Herzel, M. Hopf, C. Thielen,
    Journal of Scheduling (online first), pp. 1-19 (2018)

  • Duty Rostering for Physicians at a Department of Orthopedics and Trauma Surgery
    C. Thielen,
    Operations Research for Health Care (online first), pp. 1-12 (2018)

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

  • Assortment Planning for Multiple Chain Stores
    H. Corsten, M. Hopf, B. Kasper, C. Thielen,
    OR Spectrum (online first), pp. 1-38 (2017)

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

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

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

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

  • Maximum Flows in Generalized Processing Networks
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Journal of Combinatorial Optimization 33, pp. 1226-1256 (2017)

  • Competitive Algorithms for Multistage Online Scheduling
    M. Hopf, C. Thielen, O. Wendt,
    European Journal of Operational Research 260, pp. 468-481 (2017)

  • Capacitated Network Design Games with Weighted Players
    A. Chassein, S. O. Krumke, C. Thielen,
    Networks 68, pp. 141-158 (2016)

  • Budget-Constrained Minimum Cost Flows
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Journal of Combinatorial Optimization 31, pp. 1720-1745 (2016)

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

  • Convex Generalized Flows
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Discrete Applied Mathematics 190-191, pp. 86-99 (2015)

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

  • The Generalized Assignment Problem with Minimum Quantities
    S. O. Krumke, C. Thielen,
    European Journal of Operational Research 228, pp. 46-55 (2013)

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

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

  • Extensions to Online Delay Management on a Single Train Line: New Bounds for Delay Minimization and Profit Maximization
    S. O. Krumke, C. Thielen, C. Zeck,
    Mathematical Methods of Operations Research 74, pp. 53-75 (2011)

  • Interval Scheduling on Related Machines
    S. O. Krumke, C. Thielen, S. Westphal,
    Computers and Operations Research 38, pp. 1836-1844 (2011)

  • Minimum Cost Flows with Minimum Quantities
    S. O. Krumke, C. Thielen,
    Information Processing Letters 111, pp. 533-537 (2011)

  • Complexity of the Traveling Tournament Problem
    C. Thielen, S. Westphal,
    Theoretical Computer Science 412, pp. 345-351 (2011)

  • Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    C. Thielen, S. O. Krumke,
    Theory of Computing Systems 49, pp. 196-223 (2011)

  • The Complexity of Escaping Labyrinths and Enchanted Forests
    F. D. Schwahn, C. Thielen,
    Proceedings of the 9th International Conference on Fun with Algorithms (FUN), LIPIcs (100), pp. 30:1-13 (2018)

  • Regionalized Assortment Planning for Multiple Chain Stores
    H. Corsten, M. Hopf, B. Kasper, C. Thielen,
    Operations Research Proceedings 2016 - Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), pp. 451-457 (2018)

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

  • Modelling and Optimising Fuel Consumption in Traffic Assignment Problems
    A. Raith, C. Thielen, J. Tidswell,
    Proceedings of the 38th Australasian Transport Research Forum (ATRF), pp. 1-13 (2016)

  • Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation
    I. Hamling, M. O'Sullivan, C. Thielen, C. Walker,
    Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), pp. 1-9 (2015)

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

  • Optimization of Transformation Processes of Drainage Systems in Rural Areas
    S. Worreschk, I. Alves, T. G. Schmitt, C. Thielen,
    Proceedings of the 13th International Conference on Urban Drainage (ICUD), pp. 1-8 (2014)

  • Being Negative Makes Life NP-hard (for Product Sellers)
    S. O. Krumke, F. D. Schwahn, C. Thielen,
    Proceedings of the 7th International Conference on Fun with Algorithms (FUN), LNCS (8496), pp. 277-288 (2014)

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

  • Interval Scheduling on Related Machines: Complexity and Online Algorithms
    S. O. Krumke, C. Thielen, S. Westphal,
    Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), pp. 236-238 (2011)

  • A Combinatorial Algorithm for Strong Implementation of Social Choice Functions
    C. Thielen, S. Westphal,
    Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC), pp. 331-341 (2010)

  • Strong Implementation of Social Choice Function in Dominant Strategies
    C. Thielen, S. O. Krumke,
    Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC), pp. 319-330 (2010)

  • Strong Implementation of Social Choice Functions in Dominant Strategies
    S. O. Krumke, C. Thielen,
    Proceedings of the 3rd International Workshop on Computational Social Choice, pp. 319-330 (2010)

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

  • Generalized Truthful Mechanisms for Scheduling Verifiable Related Machines
    C. Thielen,
    Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), pp. 198-200 (2009)

  • Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    C. Thielen, S. O. Krumke,
    Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), LNCS (5814), pp. 36-47 (2009)

  • Complexity of Strong Implementability
    C. Thielen, S. O. Krumke,
    Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC), EPTCS (4), pp. 1-12 (2009)

  • A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
    C. Thielen, S. O. Krumke,
    Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA), LNCS (5426), pp. 105-118 (2008)

Zum Seitenanfang