Clemens Thielen

68 papers B 3Misc 4Journal 56Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Tractable but Hard to Approximate: The Bi-Objective Minimum s-t-Cut Problem With Binary Capacities.
Networks
Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen
2025 J jnl
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem.
Networks
Cristina Bazgan, Johannes Kager, Clemens Thielen, Daniel Vanderpooten
2025 J jnl
A survey of exact and approximation algorithms for linear-parametric optimization problems.
J. Glob. Optim.
Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann
2025 J jnl
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems.
INFORMS J. Comput.
Stephan Helfrich, Stefan Ruzika, Clemens Thielen
2024 J jnl
A (B+1)-approximation for network flow interdiction with unit costs.
Discret. Appl. Math.
Jan Boeckmann, Clemens Thielen
2024 J jnl
Approximating multiobjective optimization problems: How exact can you be?
Math. Methods Oper. Res.
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2024 J jnl
Operational Research: methods and applications.
J. Oper. Res. Soc.
Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao
2024 J jnl
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory.
Math. Methods Oper. Res.
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen
2023 J jnl
Approximating Multiobjective Optimization Problems: How exact can you be?
CoRR
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2023 J jnl
Approximating biobjective minimization problems using general ordering cones.
J. Glob. Optim.
Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen
2023 J jnl
Approximating single- and multi-objective nonlinear sum and product knapsack problems.
Discret. Optim.
Jan Boeckmann, Clemens Thielen, Ulrich Pferschy
2023 — conf
Complexity of the Temporal Shortest Path Interdiction Problem.
SAND
Jan Boeckmann, Clemens Thielen, Alina Wittmann
2023 J jnl
Integrated Planning in Hospitals: A Review.
CoRR
Sebastian Rachuba, Melanie Reuter-Oppermann, Clemens Thielen
2023 J jnl
New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application.
Oper. Res. Forum
Jan Boeckmann, Clemens Thielen
2023 J jnl
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory.
CoRR
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen
2022 J jnl
An approximation algorithm for a general class of multi-parametric optimization problems.
J. Comb. Optim.
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen
2022 J jnl
An approximation algorithm for a general class of parametric optimization problems.
J. Comb. Optim.
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2022 J jnl
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
Theory Comput. Syst.
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2021 J jnl
An Analysis of the Stability of Hinterland Container Transport Cooperation.
Transp. Sci.
Alberto Giudici, Tao Lu, Clemens Thielen, Rob A. Zuidwijk
2021 J jnl
An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems.
CoRR
Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen
2021 J jnl
Approximating Biobjective Minimization Problems Using General Ordering Cones.
CoRR
Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen
2021 J jnl
Approximating the product knapsack problem.
Optim. Lett.
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2021 J jnl
Approximation Methods for Multiobjective Optimization Problems: A Survey.
INFORMS J. Comput.
Arne Herzel, Stefan Ruzika, Clemens Thielen
2021 J jnl
Enforcing fuel-optimal traffic patterns.
EURO J. Transp. Logist.
Sophia Boesen, Andrea Raith, Clemens Thielen, James Tidswell
2021 J jnl
One-exact approximate Pareto sets.
J. Glob. Optim.
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2020 J jnl
Special issue on: Computational discrete optimization.
EURO J. Comput. Optim.
Arie M. C. A. Koster, Clemens Thielen
2020 J jnl
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci.
Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
2019 Misc conf
An FPTAS for a General Class of Parametric Optimization Problems.
COCOON
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2019 J jnl
Full implementation of social choice functions in dominant strategies.
Int. J. Game Theory
Sven O. Krumke, Clemens Thielen, Philipp Weinschenk, Stephan Westphal
2019 J jnl
Multistage interval scheduling games.
J. Sched.
Arne Herzel, Michael Hopf, Clemens Thielen
2019 J jnl
One-Exact Approximate Pareto Sets.
CoRR
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2019 J jnl
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
CoRR
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
2019 J jnl
The Product Knapsack Problem: Approximation and Complexity.
CoRR
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2018 J jnl
Assortment planning for multiple chain stores.
OR Spectr.
Hans Corsten, Michael Hopf, Benedikt Kasper, Clemens Thielen
2018 Misc conf
The Complexity of Escaping Labyrinths and Enchanted Forests.
FUN
Florian D. Schwahn, Clemens Thielen
2017 J jnl
A General Approximation Method for Bicriteria Minimization Problems.
CoRR
Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems
2017 J jnl
A general approximation method for bicriteria minimization problems.
Theor. Comput. Sci.
Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems
2017 J jnl
A network simplex method for the budget-constrained minimum cost flow problem.
Eur. J. Oper. Res.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017 J jnl
Approximation schemes for the parametric knapsack problem.
Inf. Process. Lett.
Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen
2017 J jnl
Competitive algorithms for multistage online scheduling.
Eur. J. Oper. Res.
Michael Hopf, Clemens Thielen, Oliver Wendt
2017 J jnl
Maximum flows in generalized processing networks.
J. Comb. Optim.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017 J jnl
On the complexity and approximability of budget-constrained minimum cost flows.
Inf. Process. Lett.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017 J jnl
Online interval scheduling with a bounded number of failures.
J. Sched.
Marco Bender, Clemens Thielen, Stephan Westphal
2016 J jnl
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem.
CoRR
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016 J jnl
Budget-constrained minimum cost flows.
J. Comb. Optim.
Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen
2016 J jnl
Capacitated network design games with weighted players.
Networks
André B. Chassein, Sven O. Krumke, Clemens Thielen
2016 J jnl
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows.
CoRR
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016 — conf
Regionalized Assortment Planning for Multiple Chain Stores.
OR
Hans Corsten, Michael Hopf, Benedikt Kasper, Clemens Thielen
2016 J jnl
The online knapsack problem with incremental capacity.
Math. Methods Oper. Res.
Clemens Thielen, Morten Tiedemann, Stephan Westphal
2015 J jnl
Convex generalized flows.
Discret. Appl. Math.
Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen
2015 Misc conf
Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation.
UCC
Isaac Hamling, Michael J. O'Sullivan, Cameron G. Walker, Clemens Thielen
2015 J jnl
Packing items into several bins facilitates approximating the separable assignment problem.
Inf. Process. Lett.
Marco Bender, Clemens Thielen, Stephan Westphal
2014 Misc conf
Being Negative Makes Life NP-hard (for Product Sellers).
FUN
Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen
2013 B conf
A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items.
MFCS
Marco Bender, Clemens Thielen, Stephan Westphal
2013 J jnl
Complexity and approximability of the maximum flow problem with minimum quantities.
Networks
Clemens Thielen, Stephan Westphal
2013 J jnl
The generalized assignment problem with minimum quantities.
Eur. J. Oper. Res.
Sven Oliver Krumke, Clemens Thielen
2012 J jnl
Approximation algorithms for TTP(2).
Math. Methods Oper. Res.
Clemens Thielen, Stephan Westphal
2012 J jnl
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537].
Inf. Process. Lett.
Sven Oliver Krumke, Clemens Thielen
2011 J jnl
Complexity of the traveling tournament problem.
Theor. Comput. Sci.
Clemens Thielen, Stephan Westphal
2011 J jnl
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization.
Math. Methods Oper. Res.
Sven Oliver Krumke, Clemens Thielen, Christiane Zeck
2011 J jnl
Interval scheduling on related machines.
Comput. Oper. Res.
Sven Oliver Krumke, Clemens Thielen, Stephan Westphal
2011 J jnl
Minimum cost flows with minimum quantities.
Inf. Process. Lett.
Sven Oliver Krumke, Clemens Thielen
2011 J jnl
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.
Theory Comput. Syst.
Clemens Thielen, Sven Oliver Krumke
2010 — conf
Approximating the Traveling Tournament Problem with Maximum Tour Length 2.
ISAAC (2)
Clemens Thielen, Stephan Westphal
2010 — —
Approximation and Complexity in Algorithmic Mechanism Design.
Clemens Thielen
2009 — conf
Complexity of Strong Implementability
ACAC
Clemens Thielen, Sven Oliver Krumke
2009 B conf
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.
SAGT
Clemens Thielen, Sven Oliver Krumke
2008 B conf
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.
WAOA
Clemens Thielen, Sven Oliver Krumke