default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Klein 0001
Person information
- affiliation: Max Planck Institut Informatik, Saarbrücken, Germany
Other persons with the same name
- Christian Klein 0002
![[0000-0002-6936-7412]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6936-7412")
— Institut de Mathémathiques de Bourgogne, Université de Bourgogne, Dijon, France (and 1 more) - Christian Klein 0003 — University of Hohenheim, Germany
- Christian Klein 0004 — German Research Center for Environmental Health
- Christian Klein 0005 — University of Maryland, College Park, MD, USA
- Christian Klein 0006 — Universität Regensburg
- Christian Klein 0007 — University of Koblenz-Landau, Germany
- Christian Klein 0008 — DLR, German Aerospace Center in the Helmholtz-Association, Göttingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[b1]Christian Klein:
Matrix rounding, evolutionary algorithms, and hole detection. Saarland University, 2014- 2012
- [j5]Benjamin Doerr, Edda Happ, Christian Klein:
Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425: 17-33 (2012) - 2011
- [j4]Benjamin Doerr, Edda Happ, Christian Klein:
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem. Evol. Comput. 19(4): 673-691 (2011)
2000 – 2009
- 2009
- [j3]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evol. Comput. 13(3): 591-603 (2009) - 2008
- [c11]Benjamin Doerr, Edda Happ, Christian Klein:
Crossover can provably be useful in evolutionary computation. GECCO 2008: 539-546 - [c10]Benjamin Doerr, Thomas Jansen, Christian Klein:
Comparing global and local mutations on bit strings. GECCO 2008: 929-936 - [c9]Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann:
Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960 - 2007
- [j2]Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. Electron. Notes Discret. Math. 28: 41-46 (2007) - [c8]Benjamin Doerr, Edda Happ, Christian Klein:
A tight analysis of the (1 + 1)-EA for the single source shortest path problem. IEEE Congress on Evolutionary Computation 2007: 1890-1895 - [c7]Benjamin Doerr, Christian Klein, Tobias Storch:
Faster Evolutionary Algorithms by Superior Graph Representation. FOCI 2007: 245-250 - [c6]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
Do additional objectives make a problem harder? GECCO 2007: 765-772 - 2006
- [j1]Benjamin Doerr, Christian Klein:
Controlled Randomized Rounding. Electron. Notes Discret. Math. 25: 39-40 (2006) - [c5]Stefan Funke, Christian Klein:
Hole detection or: "how much geometry hides in connectivity?". SCG 2006: 377-385 - [c4]Benjamin Doerr, Christian Klein:
Unbiased Rounding of Rational Matrices. FSTTCS 2006: 200-211 - [c3]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. SWAT 2006: 102-112 - [i1]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. CoRR abs/cs/0604068 (2006) - 2005
- [c2]Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt:
Controlled perturbation for Delaunay triangulations. SODA 2005: 1047-1056 - [c1]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109
Coauthor Index
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 2024-12-10 21:47 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:
