default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClemens Thielen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j42]Cristina Bazgan, Johannes Kager, Clemens Thielen
, Daniel Vanderpooten:
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem. Networks 85(1): 76-90 (2025)- 2024
- [j41]Jan Boeckmann, Clemens Thielen:
A (B+1)-approximation for network flow interdiction with unit costs. Discret. Appl. Math. 354: 58-71 (2024) - [j40]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:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - [j39]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating multiobjective optimization problems: How exact can you be? Math. Methods Oper. Res. 100(1): 5-25 (2024) - [j38]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory. Math. Methods Oper. Res. 100(1): 27-63 (2024) - 2023
- [j37]Jan Boeckmann, Clemens Thielen, Ulrich Pferschy:
Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. 48(Part 1): 100771 (2023) - [j36]Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating biobjective minimization problems using general ordering cones. J. Glob. Optim. 86(2): 393-415 (2023) - [j35]Jan Boeckmann, Clemens Thielen:
New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application. Oper. Res. Forum 4(4): 86 (2023) - [c11]Jan Boeckmann, Clemens Thielen, Alina Wittmann:
Complexity of the Temporal Shortest Path Interdiction Problem. SAND 2023: 9:1-9:20 - [i11]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR abs/2305.15142 (2023) - [i10]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory. CoRR abs/2305.15173 (2023) - [i9]Sebastian Rachuba, Melanie Reuter-Oppermann, Clemens Thielen:
Integrated Planning in Hospitals: A Review. CoRR abs/2307.05258 (2023) - 2022
- [j34]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43(5): 1328-1358 (2022) - [j33]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An approximation algorithm for a general class of multi-parametric optimization problems. J. Comb. Optim. 44(3): 1459-1494 (2022) - [j32]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66(1): 395-415 (2022) - 2021
- [j31]Sophia Boesen, Andrea Raith, Clemens Thielen, James Tidswell:
Enforcing fuel-optimal traffic patterns. EURO J. Transp. Logist. 10: 100060 (2021) - [j30]Arne Herzel, Stefan Ruzika, Clemens Thielen:
Approximation Methods for Multiobjective Optimization Problems: A Survey. INFORMS J. Comput. 33(4): 1284-1299 (2021) - [j29]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-exact approximate Pareto sets. J. Glob. Optim. 80(1): 87-115 (2021) - [j28]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
Approximating the product knapsack problem. Optim. Lett. 15(8): 2529-2540 (2021) - [j27]Alberto Giudici, Tao Lu, Clemens Thielen, Rob A. Zuidwijk:
An Analysis of the Stability of Hinterland Container Transport Cooperation. Transp. Sci. 55(5): 1170-1186 (2021) - [i8]Arne Herzel, Stephan Helfrich, Stefan Ruzika, Clemens Thielen:
Approximating Biobjective Minimization Problems Using General Ordering Cones. CoRR abs/2109.10067 (2021) - [i7]Stephan Helfrich, Arne Herzel, Stefan Ruzika, Clemens Thielen:
An Approximation Algorithm for a General Class of Multi-Parametric Optimization Problems. CoRR abs/2109.10076 (2021) - 2020
- [j26]Arie M. C. A. Koster, Clemens Thielen:
Special issue on: Computational discrete optimization. EURO J. Comput. Optim. 8(3): 201-203 (2020) - [j25]Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. Theor. Comput. Sci. 839: 41-102 (2020)
2010 – 2019
- 2019
- [j24]Sven O. Krumke, Clemens Thielen, Philipp Weinschenk, Stephan Westphal:
Full implementation of social choice functions in dominant strategies. Int. J. Game Theory 48(1): 337-361 (2019) - [j23]Arne Herzel, Michael Hopf, Clemens Thielen:
Multistage interval scheduling games. J. Sched. 22(3): 359-377 (2019) - [c10]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An FPTAS for a General Class of Parametric Optimization Problems. COCOON 2019: 25-37 - [i6]Ulrich Pferschy, Joachim Schauer, Clemens Thielen:
The Product Knapsack Problem: Approximation and Complexity. CoRR abs/1901.00695 (2019) - [i5]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR abs/1908.01181 (2019) - [i4]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-Exact Approximate Pareto Sets. CoRR abs/1908.10561 (2019) - 2018
- [j22]Hans Corsten, Michael Hopf, Benedikt Kasper, Clemens Thielen:
Assortment planning for multiple chain stores. OR Spectr. 40(4): 875-912 (2018) - [c9]Florian D. Schwahn, Clemens Thielen:
The Complexity of Escaping Labyrinths and Enchanted Forests. FUN 2018: 30:1-30:13 - 2017
- [j21]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
A network simplex method for the budget-constrained minimum cost flow problem. Eur. J. Oper. Res. 259(3): 864-872 (2017) - [j20]Michael Hopf, Clemens Thielen, Oliver Wendt:
Competitive algorithms for multistage online scheduling. Eur. J. Oper. Res. 260(2): 468-481 (2017) - [j19]Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen:
Approximation schemes for the parametric knapsack problem. Inf. Process. Lett. 120: 11-15 (2017) - [j18]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
On the complexity and approximability of budget-constrained minimum cost flows. Inf. Process. Lett. 126: 24-29 (2017) - [j17]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
Maximum flows in generalized processing networks. J. Comb. Optim. 33(4): 1226-1256 (2017) - [j16]Marco Bender, Clemens Thielen, Stephan Westphal:
Online interval scheduling with a bounded number of failures. J. Sched. 20(5): 443-457 (2017) - [j15]Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems:
A general approximation method for bicriteria minimization problems. Theor. Comput. Sci. 695: 1-15 (2017) - [i3]Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David Willems:
A General Approximation Method for Bicriteria Minimization Problems. CoRR abs/1701.02989 (2017) - 2016
- [j14]Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Budget-constrained minimum cost flows. J. Comb. Optim. 31(4): 1720-1745 (2016) - [j13]Clemens Thielen, Morten Tiedemann, Stephan Westphal:
The online knapsack problem with incremental capacity. Math. Methods Oper. Res. 83(2): 207-242 (2016) - [j12]André B. Chassein, Sven O. Krumke, Clemens Thielen:
Capacitated network design games with weighted players. Networks 68(2): 141-158 (2016) - [c8]Hans Corsten, Michael Hopf, Benedikt Kasper, Clemens Thielen:
Regionalized Assortment Planning for Multiple Chain Stores. OR 2016: 451-457 - [i2]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows. CoRR abs/1607.02282 (2016) - [i1]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem. CoRR abs/1607.02284 (2016) - 2015
- [j11]Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Convex generalized flows. Discret. Appl. Math. 190-191: 86-99 (2015) - [j10]Marco Bender, Clemens Thielen, Stephan Westphal:
Packing items into several bins facilitates approximating the separable assignment problem. Inf. Process. Lett. 115(6-8): 570-575 (2015) - [c7]Isaac Hamling, Michael J. O'Sullivan, Cameron G. Walker, Clemens Thielen:
Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation. UCC 2015: 26-34 - 2014
- [c6]Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen:
Being Negative Makes Life NP-hard (for Product Sellers). FUN 2014: 277-288 - 2013
- [j9]Sven Oliver Krumke, Clemens Thielen:
The generalized assignment problem with minimum quantities. Eur. J. Oper. Res. 228(1): 46-55 (2013) - [j8]Clemens Thielen, Stephan Westphal:
Complexity and approximability of the maximum flow problem with minimum quantities. Networks 62(2): 125-131 (2013) - [c5]Marco Bender, Clemens Thielen, Stephan Westphal:
A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. MFCS 2013: 135-145 - 2012
- [j7]Sven Oliver Krumke, Clemens Thielen:
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. Inf. Process. Lett. 112(13): 523-524 (2012) - [j6]Clemens Thielen, Stephan Westphal:
Approximation algorithms for TTP(2). Math. Methods Oper. Res. 76(1): 1-20 (2012) - 2011
- [j5]Sven Oliver Krumke, Clemens Thielen, Stephan Westphal:
Interval scheduling on related machines. Comput. Oper. Res. 38(12): 1836-1844 (2011) - [j4]Sven Oliver Krumke, Clemens Thielen:
Minimum cost flows with minimum quantities. Inf. Process. Lett. 111(11): 533-537 (2011) - [j3]Sven Oliver Krumke, Clemens Thielen, Christiane Zeck:
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. Math. Methods Oper. Res. 74(1): 53-75 (2011) - [j2]Clemens Thielen, Sven Oliver Krumke:
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. Theory Comput. Syst. 49(1): 196-223 (2011) - [j1]Clemens Thielen, Stephan Westphal:
Complexity of the traveling tournament problem. Theor. Comput. Sci. 412(4-5): 345-351 (2011) - 2010
- [b1]Clemens Thielen:
Approximation and Complexity in Algorithmic Mechanism Design. University of Kaiserslautern, Germany, Verlag Dr. Hut 2010 - [c4]Clemens Thielen, Stephan Westphal:
Approximating the Traveling Tournament Problem with Maximum Tour Length 2. ISAAC (2) 2010: 303-314
2000 – 2009
- 2009
- [c3]Clemens Thielen, Sven Oliver Krumke:
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. SAGT 2009: 36-47 - [c2]Clemens Thielen, Sven Oliver Krumke:
Complexity of Strong Implementability. ACAC 2009: 1-12 - 2008
- [c1]Clemens Thielen, Sven Oliver Krumke:
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. WAOA 2008: 105-118
Coauthor Index
aka: Sven O. Krumke
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
