Personal information

Activities

Employment (3)

Technical University of Munich: Munich, DE

2024-08-01 to present | Professor of Optimization and Sustainable Decision Making (TUM Campus Straubing for Biotechnology and Sustainability)
Employment
Source: Self-asserted source
Clemens Thielen

Weihenstephan-Triesdorf University of Applied Sciences: Straubing, Bavaria, DE

2019-10-01 to 2024-07-31 | Professor of Complex Networks (TUM Campus Straubing for Biotechnology and Sustainability)
Employment
Source: Self-asserted source
Clemens Thielen

University of Kaiserslautern: Kaiserslautern, Rheinland-Pfalz, DE

2013-07-09 to 2019-08-31 | Assistant Professor (Juniorprofessor) (Department of Mathematics)
Employment
Source: Self-asserted source
Clemens Thielen

Works (28)

A general approximation method for bicriteria minimization problems

Theoretical Computer Science
2017 | Journal article
EID:

2-s2.0-85024497877

Contributors: Halffmann, P.; Ruzika, S.; Thielen, C.; Willems, D.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

A network simplex method for the budget-constrained minimum cost flow problem

European Journal of Operational Research
2017 | Journal article
EID:

2-s2.0-85007079356

Contributors: Holzhauser, M.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Approximation schemes for the parametric knapsack problem

Information Processing Letters
2017 | Journal article
EID:

2-s2.0-85007008859

Contributors: Giudici, A.; Halffmann, P.; Ruzika, S.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Assortment planning for multiple chain stores

OR Spectrum
2017 | Journal article
EID:

2-s2.0-85034633282

Contributors: Corsten, H.; Hopf, M.; Kasper, B.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Competitive algorithms for multistage online scheduling

European Journal of Operational Research
2017 | Journal article
EID:

2-s2.0-85009822951

Contributors: Hopf, M.; Thielen, C.; Wendt, O.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Maximum flows in generalized processing networks

Journal of Combinatorial Optimization
2017 | Journal article
EID:

2-s2.0-85028266499

Contributors: Holzhauser, M.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

On the complexity and approximability of budget-constrained minimum cost flows

Information Processing Letters
2017 | Journal article
EID:

2-s2.0-85020919970

Contributors: Holzhauser, M.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Online interval scheduling with a bounded number of failures

Journal of Scheduling
2017 | Journal article
EID:

2-s2.0-85010807237

Contributors: Bender, M.; Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Budget-constrained minimum cost flows

Journal of Combinatorial Optimization
2016 | Journal article
EID:

2-s2.0-84925679424

Contributors: Holzhauser, M.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Capacitated network design games with weighted players

Networks
2016 | Journal article
EID:

2-s2.0-84980340099

Contributors: Chassein, A.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

The online knapsack problem with incremental capacity

Mathematical Methods of Operations Research
2016 | Journal article
EID:

2-s2.0-84952650585

Contributors: Thielen, C.; Tiedemann, M.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Convex generalized flows

Discrete Applied Mathematics
2015 | Journal article
EID:

2-s2.0-84930474267

Contributors: Holzhauser, M.; Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation

Proceedings - 2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing, UCC 2015
2015 | Conference paper
EID:

2-s2.0-84965017924

Contributors: Hamling, I.; O'Sullivan, M.; Walker, C.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Packing items into several bins facilitates approximating the separable assignment problem

Information Processing Letters
2015 | Journal article
EID:

2-s2.0-84939937002

Contributors: Bender, M.; Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Being negative makes life NP-hard (for product sellers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
EID:

2-s2.0-84903713269

Contributors: Krumke, S.O.; Schwahn, F.D.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
EID:

2-s2.0-84885227974

Contributors: Bender, M.; Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Complexity and approximability of the maximum flow problem with minimum quantities

Networks
2013 | Journal article
EID:

2-s2.0-84882453738

Contributors: Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

The generalized assignment problem with minimum quantities

European Journal of Operational Research
2013 | Journal article
EID:

2-s2.0-84875232248

Contributors: Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Approximation algorithms for TTP(2)

Mathematical Methods of Operations Research
2012 | Journal article
EID:

2-s2.0-84860185593

Contributors: Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Erratum: Minimum cost flows with minimum quantities (Information Processing Letters (2011) 111: 11 (533-537))

Information Processing Letters
2012 | Journal article
EID:

2-s2.0-84859483640

Contributors: Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Complexity of the traveling tournament problem

Theoretical Computer Science
2011 | Journal article
EID:

2-s2.0-78650827038

Contributors: Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization

Mathematical Methods of Operations Research
2011 | Journal article
EID:

2-s2.0-80054963090

Contributors: Krumke, S.O.; Thielen, C.; Zeck, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Interval scheduling on related machines

Computers and Operations Research
2011 | Journal article
EID:

2-s2.0-79955064614

Contributors: Krumke, S.O.; Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Minimum cost flows with minimum quantities

Information Processing Letters
2011 | Journal article
EID:

2-s2.0-79952705006

Contributors: Krumke, S.O.; Thielen, C.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents

Theory of Computing Systems
2011 | Journal article
EID:

2-s2.0-79955871397

Contributors: Thielen, C.; Krumke, S.O.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Approximating the traveling tournament problem with maximum tour length 2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2010 | Book
EID:

2-s2.0-78650884686

Contributors: Thielen, C.; Westphal, S.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

A general scheme for designing monotone algorithms for scheduling problems with precedence constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2009 | Book
EID:

2-s2.0-60349095937

Contributors: Thielen, C.; Krumke, S.O.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Truthful mechanisms for selfish routing and two-parameter agents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2009 | Book
EID:

2-s2.0-71549173431

Contributors: Thielen, C.; Krumke, S.O.
Source: Self-asserted source
Clemens Thielen via Scopus - Elsevier

Peer review (17 reviews for 14 publications/grants)

Review activity for 4OR (1)
Review activity for Annals of operation research. (1)
Review activity for Computers & operations research. (1)
Review activity for European journal of operational research. (2)
Review activity for Information processing letters. (1)
Review activity for Journal of combinatorial optimization. (1)
Review activity for Journal of computer and system sciences. (1)
Review activity for Mathematical methods of operations research. (2)
Review activity for Operational research. (1)
Review activity for Operations research for health care. (2)
Review activity for Operations research letters. (1)
Review activity for OR-Spektrum. (1)
Review activity for Theoretical computer science. (1)
Review activity for Top. (1)