Your search returned the following 20 documents:

20. Average update times for fully-dynamic all-pairs shortest paths
    Tobias Friedrich and Nils Hebbinghaus
    Discrete Applied Mathematics 159 (16): 1751-1758, 2011
    
19. Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation 18 (4): 617 - 633, 2010
    
18. Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    Evolutionary Computation, 17 (1): 3-19, 2009
    
17. Comparison of Simple Diversity Mechanisms on Plateau Functions
    Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
    Theoretical Computer Science 410 (26): 2455-2462, 2009
    
16. Discrepancy in generalized arithmetic progressions
    Javier Cilleruelo and Nils Hebbinghaus
    European Journal of Combinatorics 30 (7): 1607-1611, 2009
    
15. 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
    
14. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
    Tobias Friedrich and Nils Hebbinghaus
    In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 693-704
    
13. A Rigorous View On Neutrality
    Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, and Frank Neumann
    In: IEEE Congress on Evolutionary Computation 2007, Singapore, 2007, 2591-2597
    
12. Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
    Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
    In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 797-804
    
11. Discrepancy of Sums of two Arithmetic Progressions
    Nils Hebbinghaus
    Cornell University (ArXiv), ArXiv, math.NT/0703108, ArXiv
    [PDF: Download: Sums2APs_final.pdf]
    
10. 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
    
9. On Improving Approximate Solutions by Evolutionary Algorithms
   Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, and Carsten Witt
   In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2614-2621
   
8. Plateaus Can Be Harder in Multi-Objective Optimization
   Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
   In: IEEE Congress on Evolutionary Computation 2007, Singapore, Singapore, 2007, 2622-2629
   
7. Rigorous Analyses of Simple Diversity Mechanisms
   Tobias Friedrich, Nils Hebbinghaus, and Frank Neumann
   In: Genetic and Evolutionary Computation Conference 2007, London, UK, 2007, 1219-1225. Note: nominated for best paper award
   
6. Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
   Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
   Evolutionary Computation 15 (4): 401-410, 2007
   
5. Discrepancy of Products of Hypergraphs
   Benjamin Doerr and Nils Hebbinghaus
   In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Berlin, Germany, 2005, 323-328
   
4. Discrepancy of Symmetric Products of Hypergraphs
   Benjamin Doerr, Michael Gnewuch, and Nils Hebbinghaus
   The Electronic Journal of Combinatorics 13: 1-12, 2006
   [PDF: Download: v13i1r40.pdf]
   
3. Improved Bounds and Schemes for the Declustering Problem
   Benjamin Doerr, Nils Hebbinghaus, and Sören Werth
   Theoretical Computer Science 359 (1-3): 123-132, 2006
   
   
2. Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
   Benjamin Doerr, Nils Hebbinghaus, and Frank Neumann
   In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, 2006, 978-987
   
   
1. The Local C(G,T) Theorem
   David Bundy, Nils Hebbinghaus, and Bernd Stellmacher
   Journal of Algebra 300 (2): 741-789, 2006