Tobias Storch

Address: Department of Computer Science II, University of Dortmund, D-44221 Dortmund, Germany Office: Otto-Hahn-Str. 14, Room 3.09 E-Mail: tobias.storchuni-dortmund.de PGP: public key Fingerprint: C48F BDF9 CE99 DBB2 B9A4 8369 4703 80AA 7C50 CE3F Phone: +49-231-755-4762 Fax: +49-231-755-2047

Publications

• Benjamin Doerr, Christian Klein, and Tobias Storch (2007)
  Faster Evolutionary Algorithms by Superior Graph Representation
  Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence - FOCI 2007
  IEEE, USA, pages 245-250.

  A preliminary version is available for download: PDF (0.1MB)

• Jens Jägersküpper and Tobias Storch (2007)
  When the Plus Strategy Outperforms the Comma Strategy - and When Not
  Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence - FOCI 2007
  IEEE, USA, pages 25-32.

  A preliminary version is available as Technical Report CI 219/06 for download: PDF (0.2MB)

• Tobias Storch (2007)
  Design und Analyse randomisierter Suchheuristiken - Populationen und Cliquen
  PhD Thesis
  University of Dortmund, Germany.
  The final version is available for download: PDF (0.7 MB), PDF gzipped (0.6MB), PS (1.4MB), PS gzipped (0.4MB)
• Jens Jägersküpper and Tobias Storch (2006)
  How Comma Selection Helps with the Escape from Local Optima
  Runarsson et al. (Eds.): International Conference on Parallel Problem Solving From Nature IX - PPSN 2006
  LNCS 4193, Springer, Germany, pages 52-61.
  The final version is available for download: springerlink.com

  A preliminary version is available as Technical Report CI 210/06 for download: PDF (0.2MB)

• Tobias Storch (2006)
  Finding Large Cliques in Sparse Semi-Random Graphs by Simple Randomized Search Heuristics
  Technical Report CI 211/06
  Available for download: PDF (0.4MB)
• Tobias Storch (2006)
  How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs
  Keijzer et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2006
  Volume 1, ACM Press, USA, pages 567-574.
  The final version is available for download: acm.org

  A preliminary version is available as Technical Report CI 203/06 for download: PDF (0.2MB)

• Tobias Storch (2006)
  On the impact of objective function transformations on evolutionary and black-box algorithms
  Genetic Programming and Evolvable Machines, Volume 7, Issue 2, Springer, The Netherlands, pages 171-193.
  The final version is available for download: springerlink.com

  Tobias Storch (2005)
  On the Impact of Objective Function Transformations on Evolutionary and Black-Box Algorithms
  Beyer et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2005
  Volume 1, ACM Press, USA, pages 833-840. (Best Paper Award)
  The final version is available for download: acm.org

  A preliminary version is available as Technical Report CI 193/05 for download: PDF (0.3MB)

• Tobias Storch (2004)
  On the Choice of the Population Size
  Deb et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2004
  LNCS 3102, Springer, Germany, pages 748-760. (Best Paper Award)
  The final version is available for download: springerlink.com

  A preliminary version is available as Technical Report CI 166/04 for download: PDF (0.2MB)

• Tobias Storch and Ingo Wegener (2004)
  Real royal road functions for constant population size
  Theoretical Computer Science, Volume 320, Issue 1, Elsevier, The Netherlands, pages 123-134.
  The final version is available for download: sciencedirect.com

  Tobias Storch and Ingo Wegener (2003)
  Real Royal Road Functions for Constant Population Size
  Cantú-Paz et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2003
  LNCS 2724, Springer, Germany, pages 1406-1417.
  The final version is available for download: springerlink.com

  A preliminary version is available as Technical Report CI 167/04 for download: PDF (0.2MB)

• Tobias Storch (2003)
  Evolutionäre Algorithmen - Rekombination bei konstanter Populationsgröße
  Diploma Thesis
  University of Dortmund, Germany.
  The final version is available for download: PDF (3.0 MB), PDF gzipped (2.5MB), PS (2.1MB), PS gzipped (0.7MB)

Education

• December 2003 to present
  Ph.D. student at the Chair of Computer Science 2 (Complexity Theory and Efficient Algorithms) at the University of Dortmund
  My work is supported by the DFG, Deutsche Forschungsgemeinschaft (German Research Foundation).
• October 1998 to October 2003
  Studies of Computer Science at the University of Dortmund
• October 2003
  Diploma in Computer Science
• February 2003 to August 2003
  Preparation of the Diploma Thesis at the Chair of Computer Science 2 (Complexity Theory and Efficient Algorithms)
• October 2001 to Sepember 2002
  Participation in the two semester project VisionWorld at the Chair of Computer Science 7 (Graphical Systems)