Your search returned the following 19 documents:

19. Crossover can provably be useful in evolutionary computation
    Benjamin Doerr, Edda Happ, and Christian Klein
    Theoretical Computer Science 425: 17-33, 2012
    
18. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
    Benjamin Doerr, Edda Happ, and Christian Klein
    Evolutionary Computation 19 (4): 673-691, 2011
    
17. On the Effects of Adding Objectives to Plateau Functions
    Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
    IEEE Transactions on Evolutionary Computation 13 (3): 591-603, 2009
    
16. Comparing local and global mutations on bit-strings.
    Benjamin Doerr, Thomas Jansen, and Christian Klein
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 929-936
    
15. Crossover Can Provably be Useful in Evolutionary Computation
    Benjamin Doerr, Edda Happ, and Christian Klein
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 539-546. Note: Best paper award
    
14. Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
    Edda Happ, Daniel Johannsen, Christian Klein, and Frank Neumann
    In: Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, 953-960
    [PDF: Download: HappJohannsenKleinNeumann_2008_RigorousAnalysesOfFitness-ProportionalSelectionForOptimizingLinearFunctions.pdf]
    
13. A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
    Benjamin Doerr, Edda Happ, and Christian Klein
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 1890-1895
    
12. Do Additional Objectives Make a Problem Harder?
    Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, and Eckart Zitzler
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 765-772
    
11. Faster Evolutionary Algorithms by Superior Graph Representation
    Benjamin Doerr, Christian Klein, and Tobias Storch
    In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), Honolulu, USA, 2007, 245-250
    [PDF: Download: foci2007.pdf]
    
10. Unbiased Matrix Rounding
    Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
    Electronic Notes in Discrete Mathematics 28: 41-46, 2007
    
9. Controlled Perturbation for Delaunay Triangulations
   Stefan Funke, Christian Klein, Kurt Mehlhorn, and Susanne Schmitt
   Algorithms for Complex Shapes with certified topology and numerics, Instituut voor Wiskunde en Informatica, ACS-TR-121103-03, Technical Report
   [PDF: Download: acstr12110303.pdf]
   
8. Controlled Randomized Rounding
   Benjamin Doerr and Christian Klein
   Electronic Notes in Discrete Mathematics 25: 39-40, 2006
   
7. Hole Detection or: "How Much Geometry Hides in Connectivity?"
   Stefan Funke and Christian Klein
   In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, Sedona, Arizona, USA, 2006, 377-385
   [PDF: Download: paper.pdf]
   
6. Unbiased Matrix Rounding
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 102-112
   [PDF: Download: 2006SWATofficial_rounding.pdf]
   
5. Unbiased Rounding of Rational Matrices
   Benjamin Doerr and Christian Klein
   In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, Kolkata, India, 2006, 200-211
   
   
4. Controlled Perturbation for Delaunay Triangulations
   Stefan Funke, Christian Klein, Kurt Mehlhorn, and Susanne Schmitt
   In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 1047-1056
   
   
3. Rounding of Sequences and Matrices, with Applications
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 96-109
   [PDF: Download: public.pdf] [PDF: Download: final.pdf]
   
2. A Fast Root Checking Algorithm
   Christian Klein
   Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363109-02, Technical Report
   [PS: Download: ECG-TR-363109-02.ps.gz]
   
1. Controlled Perturbation for Voronoi Diagrams
   Christian Klein
   Master's thesis, Universität des Saarlandes, 2004
   [PS: Download: diplom.ps]