Search the dblp DataBase

Publications of Author

1. Christian Klein, Benjamin B. Bederson
   Benefits of animated scrolling. [Citation Graph (0, 0)][DBLP]
   CHI Extended Abstracts, 2005, pp:1965-1968 [Conf]
   
2. Stefan Funke, Christian Klein
   Hole detection or: "how much geometry hides in connectivity?". [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2006, pp:377-385 [Conf]
   
3. Benjamin Doerr, Christian Klein
   Unbiased Rounding of Rational Matrices. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2006, pp:200-211 [Conf]
   
4. Thomas Nowey, Hannes Federrath, Christian Klein, Klaus Plößl
   Ansätze zur Evaluierung von Sicherheitsinvestitionen. [Citation Graph (0, 0)][DBLP]
   Sicherheit, 2005, pp:15-26 [Conf]
   
5. Stefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt
   Controlled perturbation for Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:1047-1056 [Conf]
   
6. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
   Unbiased Matrix Rounding. [Citation Graph (0, 0)][DBLP]
   SWAT, 2006, pp:102-112 [Conf]
   
7. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
   Rounding of Sequences and Matrices, with Applications. [Citation Graph (0, 0)][DBLP]
   WAOA, 2005, pp:96-109 [Conf]
   
8. Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
   Do additional objectives make a problem harder? [Citation Graph (0, 0)][DBLP]
   GECCO, 2007, pp:765-772 [Conf]
   
9. Benjamin Doerr, Christian Klein, Tobias Storch
   Faster Evolutionary Algorithms by Superior Graph Representation. [Citation Graph (0, 0)][DBLP]
   FOCI, 2007, pp:245-250 [Conf]
   
10. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Unbiased Matrix Rounding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
11. 
    Rigorous analyses of fitness-proportional selection for optimizing linear functions. [Citation Graph (, )][DBLP]
    
    
12. 
    Comparing global and local mutations on bit strings. [Citation Graph (, )][DBLP]
    
    
13. 
    Crossover can provably be useful in evolutionary computation. [Citation Graph (, )][DBLP]
    
    
14. 
    A tight analysis of the (1 + 1)-EA for the single source shortest path problem. [Citation Graph (, )][DBLP]
    
    
15. 
    The Classification of Candlestick Charts: Laying the Foundation for Further Empirical Research. [Citation Graph (, )][DBLP]