default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLennart Schäpermeier
Person information
- affiliation: University of Münster, Germany
- affiliation (former): TU Dresden, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c12]Anna V. Kononova
, Niki van Stein, Olaf Mersmann, Thomas Bäck, Thomas Bartz-Beielstein, Tobias Glasmachers, Michael Hellwig, Sebastian Krey, Jakub Kudela, Boris Naujoks, Leonard Papenmeier, Elena Raponi, Quentin Renau, Jeroen Rook, Lennart Schäpermeier, Diederick Vermetten, Daniela Zaharie:
Benchmarking that Matters: Rethinking Benchmarking in Continuous Optimisation for Practical Impact. EvoApplications 2026: 327-344- [i12]Lennart Schäpermeier, Pascal Kerschke:
BONO-Bench: A Comprehensive Test Suite for Bi-objective Numerical Optimization with Traceable Pareto Sets. CoRR abs/2601.16970 (2026) - [i11]Mehwish Nasim, Sanjeevan Selvaganapathy, Neel Ganapathi Sabhahit, Marie Griesbach, Pranav Bhandari, Janina Lütke Stockdiek, Lennart Schäpermeier, Usman Naseem, Christian Grimme:
Do LLMs Use Cultural Knowledge Without Being Told? A Multilingual Evaluation of Implicit Pragmatic Adaptation. CoRR abs/2604.17718 (2026) - 2025
- [j3]Angel E. Rodriguez-Fernandez, Lennart Schäpermeier, Carlos Hernández, Pascal Kerschke, Heike Trautmann, Oliver Schütze:
Finding ϵ-Locally Optimal Solutions for Multiobjective Multimodal Optimization. IEEE Trans. Evol. Comput. 29(5): 2019-2031 (2025) - [c11]Angel E. Rodriguez-Fernandez, Lennart Schäpermeier, Carlos Ignacio Hernández Castellanos, Pascal Kerschke, Heike Trautmann, Oliver Schütze:
Hot off the Press: Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization. GECCO Companion 2025: 61-62 - [c10]Lennart Schäpermeier:
Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems. GECCO 2025: 1199-1207 - [i10]Lennart Schäpermeier:
Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems. CoRR abs/2504.11440 (2025) - [i9]Anna V. Kononova, Niki van Stein, Olaf Mersmann, Thomas Bäck, Thomas Bartz-Beielstein, Tobias Glasmachers, Michael Hellwig, Sebastian Krey, Jakub Kudela, Boris Naujoks, Leonard Papenmeier, Elena Raponi, Quentin Renau, Jeroen Rook, Lennart Schäpermeier, Diederick Vermetten, Daniela Zaharie:
Benchmarking that Matters: Rethinking Benchmarking for Practical Impact. CoRR abs/2511.12264 (2025) - [i8]Theresa Eimer, Lennart Schäpermeier, André Biedenkapp, Alexander Tornede, Lars Kotthoff, Pieter Leyman, Matthias Feurer, Katharina Eggensperger, Kaitlin Maile, Tanja Tornede, Anna Kozak, Ke Xue, Marcel Wever, Mitra Baratchi, Damir Pulatov, Heike Trautmann, Haniye Kashgarani, Marius Lindauer:
Best Practices For Empirical Meta-Algorithmic Research: Guidelines from the COSEAL Research Network. CoRR abs/2512.16491 (2025) - 2024
- [c9]Jonathan Heins, Lennart Schäpermeier, Pascal Kerschke, Darrell Whitley:
Dancing to the State of the Art? - How Candidate Lists Influence LKH for Solving the Traveling Salesperson Problem. PPSN (1) 2024: 100-115 - [c8]Lennart Schäpermeier, Pascal Kerschke:
Reinvestigating the R2 Indicator: Achieving Pareto Compliance by Integration. PPSN (4) 2024: 202-216 - [i7]Lennart Schäpermeier, Pascal Kerschke:
Reinvestigating the R2 Indicator: Achieving Pareto Compliance by Integration. CoRR abs/2407.01504 (2024) - [i6]Jonathan Heins, Lennart Schäpermeier, Pascal Kerschke, Darrell Whitley:
Dancing to the State of the Art? How Candidate Lists Influence LKH for Solving the Traveling Salesperson Problem. CoRR abs/2407.03927 (2024) - 2023
- [j2]Pelin Aspar, Vera Steinhoff, Lennart Schäpermeier, Pascal Kerschke, Heike Trautmann, Christian Grimme:
The objective that freed me: a multi-objective local search approach for continuous single-objective optimization. Nat. Comput. 22(2): 271-285 (2023) - [c7]Lennart Schäpermeier, Pascal Kerschke, Christian Grimme, Heike Trautmann:
Peak-A-Boo! Generating Multi-objective Multiple Peaks Benchmark Problems with Precise Pareto Sets. EMO 2023: 291-304 - [c6]Raphael Patrick Prager, Konstantin Dietrich, Lennart Schneider, Lennart Schäpermeier, Bernd Bischl, Pascal Kerschke, Heike Trautmann, Olaf Mersmann:
Neural Networks as Black-Box Benchmark Functions Optimized for Exploratory Landscape Features. FOGA 2023: 129-139 - [i5]Anne Auger, Peter A. N. Bosman, Pascal Kerschke, Darrell Whitley, Lennart Schäpermeier:
Challenges in Benchmarking Optimization Heuristics (Dagstuhl Seminar 23251). Dagstuhl Reports 13(6): 55-80 (2023) - 2022
- [j1]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
Plotting Impossible? Surveying Visualization Methods for Continuous Multi-Objective Benchmark Problems. IEEE Trans. Evol. Comput. 26(6): 1306-1320 (2022) - [c5]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
MOLE: digging tunnels through multimodal multi-objective landscapes. GECCO 2022: 592-600 - [c4]Jonathan Heins, Jeroen Rook, Lennart Schäpermeier, Pascal Kerschke, Jakob Bossek, Heike Trautmann:
BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems. PPSN (1) 2022: 192-206 - [c3]Lennart Schneider, Lennart Schäpermeier, Raphael Patrick Prager, Bernd Bischl, Heike Trautmann, Pascal Kerschke:
HPO ˟ ELA: Investigating Hyperparameter Optimization Landscapes by Means of Exploratory Landscape Analysis. PPSN (1) 2022: 575-589 - [i4]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
MOLE: Digging Tunnels Through Multimodal Multi-Objective Landscapes. CoRR abs/2204.10848 (2022) - [i3]Lennart Schneider, Lennart Schäpermeier, Raphael Patrick Prager, Bernd Bischl, Heike Trautmann, Pascal Kerschke:
HPO X ELA: Investigating Hyperparameter Optimization Landscapes by Means of Exploratory Landscape Analysis. CoRR abs/2208.00220 (2022) - 2021
- [c2]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
To Boldly Show What No One Has Seen Before: A Dashboard for Visualizing Multi-objective Landscapes. EMO 2021: 632-644 - 2020
- [c1]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
One PLOT to Show Them All: Visualization of Efficient Sets in Multi-objective Landscapes. PPSN (2) 2020: 154-167 - [i2]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
One PLOT to Show Them All: Visualization of Efficient Sets in Multi-Objective Landscapes. CoRR abs/2006.11547 (2020) - [i1]Lennart Schäpermeier, Christian Grimme, Pascal Kerschke:
To Boldly Show What No One Has Seen Before: A Dashboard for Visualizing Multi-objective Landscapes. CoRR abs/2011.14395 (2020)
Coauthor Index
aka: Carlos Ignacio Hernández Castellanos
aka: Carlos Hernández 0004
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 2026-07-04 01:03 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
