Clemens Thielen

According to our database1, Clemens Thielen authored at least 45 papers between 2008 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
An Analysis of the Stability of Hinterland Container Transport Cooperation.
Transp. Sci., 2021

Approximating the product knapsack problem.
Optim. Lett., 2021

One-exact approximate Pareto sets.
J. Glob. Optim., 2021

Approximation Methods for Multiobjective Optimization Problems: A Survey.
INFORMS J. Comput., 2021

Enforcing fuel-optimal traffic patterns.
EURO J. Transp. Logist., 2021

An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems.
CoRR, 2021

Approximating Biobjective Minimization Problems Using General Ordering Cones.
CoRR, 2021

2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci., 2020

Special issue on: Computational discrete optimization.
EURO J. Comput. Optim., 2020

2019
Multistage interval scheduling games.
J. Sched., 2019

Full implementation of social choice functions in dominant strategies.
Int. J. Game Theory, 2019

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
CoRR, 2019

The Product Knapsack Problem: Approximation and Complexity.
CoRR, 2019

An FPTAS for a General Class of Parametric Optimization Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Assortment planning for multiple chain stores.
OR Spectr., 2018

The Complexity of Escaping Labyrinths and Enchanted Forests.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
A general approximation method for bicriteria minimization problems.
Theor. Comput. Sci., 2017

Online interval scheduling with a bounded number of failures.
J. Sched., 2017

Maximum flows in generalized processing networks.
J. Comb. Optim., 2017

On the complexity and approximability of budget-constrained minimum cost flows.
Inf. Process. Lett., 2017

Approximation schemes for the parametric knapsack problem.
Inf. Process. Lett., 2017

Competitive algorithms for multistage online scheduling.
Eur. J. Oper. Res., 2017

A network simplex method for the budget-constrained minimum cost flow problem.
Eur. J. Oper. Res., 2017

2016
Capacitated network design games with weighted players.
Networks, 2016

The online knapsack problem with incremental capacity.
Math. Methods Oper. Res., 2016

Budget-constrained minimum cost flows.
J. Comb. Optim., 2016

Regionalized Assortment Planning for Multiple Chain Stores.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015
Packing items into several bins facilitates approximating the separable assignment problem.
Inf. Process. Lett., 2015

Convex generalized flows.
Discret. Appl. Math., 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, 2015

2014
Being Negative Makes Life NP-hard (for Product Sellers).
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Complexity and approximability of the maximum flow problem with minimum quantities.
Networks, 2013

The generalized assignment problem with minimum quantities.
Eur. J. Oper. Res., 2013

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Approximation algorithms for TTP(2).
Math. Methods Oper. Res., 2012

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

2011
Complexity of the traveling tournament problem.
Theor. Comput. Sci., 2011

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.
Theory Comput. Syst., 2011

Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization.
Math. Methods Oper. Res., 2011

Minimum cost flows with minimum quantities.
Inf. Process. Lett., 2011

Interval scheduling on related machines.
Comput. Oper. Res., 2011

2010
Approximation and Complexity in Algorithmic Mechanism Design.
PhD thesis, 2010

Approximating the Traveling Tournament Problem with Maximum Tour Length 2.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Complexity of Strong Implementability
Proceedings of the Proceedings Fourth Athens Colloquium on Algorithms and Complexity, 2009

2008
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008


  Loading...