Computer-Aided Program Development Institute of Computer Science Faculty of Engineering, Christian-Albrechts-University of Kiel

Frank Neumann

Postal Address: Christian-Albrechts-Universität zu Kiel Institut für Informatik und Praktische Mathematik Olshausenstraße 40 D-24098 Kiel Office Address: Christian-Albrechts-Platz 4 / Room 701 D-24118 Kiel Phone: ++49-431 880-72 62 Fax: ++49-431 880-76 13 E-mail: fne@informatik.uni-kiel.de

I moved to the MPI, Saarbrücken.
Visit my homepage there.

Fields of Research

• combinatorial optimization
• evolutionary algorithms
• relational algebra

Biography

• October 31st, 1976 born in Oberhausen, Germany
• 1996 German "Abitur"
• 1997 - 1999 Studies of Computer Science, University of Dortmund
• 1999 - 2002 Studies of Computer Science, Christian-Albrechts-University of Kiel
• 2002 Diploma (with distinction) in Computer Science at the Christian-Albrechts-University of Kiel
• since 2002 Research Assistant at the Institute of Computer Science and Applied Mathematics of the Christian-Albrechts-University of Kiel
• 2006 Phd (Dr. Ing.) in Computer Science

Organization

• Co-chair (with Benjamin Doerr and Ingo Wegener) of the track "Formal Theory" at GECCO 2007.
• Organizer (with Benjamin Doerr) of the Minisymposium ``Evolutionary Algorithms'' at the Max-Planck-Institut für Informatik, Saarbrücken, Germany, May 2006.

Publications

2006:

• Neumann, F., Witt, C. (2006): Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
  Accepted for ISAAC 2006
  Electronic Colloquium on Computational Complexity (ECCC), Report No. 84, 2006.
  Available: [ECCC Report TR06-084]

• Doerr, B., Hebbinghaus, N., Neumann F. (2006): Speeding up Evolutionary Algorithms by Restricted Mutation Operators.
  In: Proc. of Parallel Problem Solving from Nature - PPSN IX (to appear)
  Electronic Colloquium on Computational Complexity (ECCC), Report No. 83, 2006.
  Available: [ECCC Report TR06-083]

• Neumann F. (2006): Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem. Accepted for Bio-inspired Metaheuristcs for Combinatorial Optimization Problems, Special Issue of Computers and Operations Research. Conference version appeared in Proc. of CEC 2004.

• Neumann F. (2006): Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-Objective Minimum Spanning Tree Problem. Accepted for Special Issue on Evolutionary Multi-Objective Optimization of the European Journal on Operational Research. Conference version appeared in Proc. of PPSN VIII.
  

• Neumann F., Wegener I. (2006): Minimum Spanning Trees Made Easier Via Multi-Objective Optimization. Natural Computing, Volume 5, Number 3, Springer Netherlands, pages 305 - 319. Conference version appeared in Proc. of GECCO 2005.
  Available: [Final Version]

• Kehden, B., Neumann F. (2006): A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. In: Gottlieb and Raidl (Eds.): EvoCop 2006, LNCS 3906, Springer, Berlin, Germany, pages 147 - 158. (Best Paper Award)
  Available: [Final Version]

• Neumann F., Laumanns M. (2006): Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization. In: Correa et al. (Eds.): LATIN 2006, LNCS 3887, Springer, Berlin, Germany, pages 745 - 756.
  Available: [Final Version]

• Kehden B., Neumann F., Berghammer R. (2006): Relational Implementation of Simple Parallel Evolutionary Algorithms. In: Proc. of the 8th International Conference on Relational Methods in Computer Science (RelMiCS 8), LNCS 3929, Springer, Berlin, Germany, pages 161 - 172.
  Available: [Final Version]

2005:

• Berghammer R., Neumann F. (2005): RELVIEW - An OBDD-based Computer Algebra System For Relations. In: Gansha et al. (Eds.): Proc. of The 8th International Workshop on Computer Algebra in Scientific Computing - CASC 2005, LNCS 3718, Springer, Berlin, Germany, pages 40 -51.
  Available: [Final Version]

• Neumann F., Wegener I. (2005): Minimum Spanning Trees Made Easier Via Multi-Objective Optimization. In: Beyer et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2005, Volume 1, ACM Press, New York, USA, pages 763 - 770. (Best Paper Award)
  Available: [Final Version, Technical Report CI 192/05 (SFB 531, University of Dortmund)]

• Neumann F., Laumanns M. (2005): Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization. Electronic Colloquium on Computational Complexity (ECCC), Report No. 29, 2005.
  Available: [ECCC Report TR05-029]

2004:

• Neumann F. (2004): Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. In: Yao et al. (Eds.): Parallel Problem Solving from Nature - PPSN VIII, LNCS 3242, Springer, Berlin, Germany, pages 80 - 89.
  Available: [Final Version]

• Neumann F., Wegener I. (2004): Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. In: Deb et al. (Eds.): Genetic and Evolutionary Computation Conference - GECCO 2004, LNCS 3102, Springer, Berlin, Germany, pages 713 - 724.
  Available: [Final version, Technical Report CI 165/04 (SFB 531, University of Dortmund)]

• Neumann F. (2004): Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem. In: Proc. of the Congress on Evolutionary Computation 2004 (CEC 2004), volume 1, IEEE Press, pages 904 - 910.
  Available: [Preliminary version] (PostScript)

2003:

• Neumann, F., Simon, F. (2003): Specific Evolutionary Algorithms for Permutation Problems. In: WSEAS Transactions on Systems 2(4), pages 900-908, WSEAS Press.

Talks

2006:

• Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
  Held at Minisymposium Evolutionary Algorithms, Max-Planck-Institut für Informatik, 3 - 4 May 2006, Saarbrücken, Germany.

• Introduction to Evolutionary Algorithms.
  Held at Minisymposium Evolutionary Algorithms, Max-Planck-Institut für Informatik, 3 - 4 May 2006, Saarbrücken, Germany.

• A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.
  Held (with Britta Kehden) at 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2006, 10 - 12 April, Budapest, Hungary.

• Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization.
  Held at Latin American Theoretical Informatics Symposium, LATIN 2006, 20 - 24 March, Valdivia, Chile.

2005:

• Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem.
  Held at Discrete Math Meeting, Max-Planck-Institut für Informatik, 17 November 2005, Saarbrücken, Germany.

• Randomized Search Heuristics and the Minimum Spanning Tree Problem.
  Held at Mittagsseminar, Max-Planck-Institut für Informatik, 16 November 2005, Saarbrücken, Germany.

• RELVIEW - An OBDD-based Computer Algebra System For Relations.
  Held at The 8th International Workshop on Computer Algebra in Scientific Computing - CASC 2005, 12 - 16 September 2005, Kalamata, Greece.

• Minimum Spanning Trees Made Easier Via Multi-Objective Optimization.
  Held (with Ingo Wegener) at The Genetic and Evolutionary Computation Conference 2005 - GECCO 2005, 25 - 29 June 2005, Washington D.C., USA.

• (NP-hard) Spanning Tree Problems Made Easier Via Multi-Objective Optimization.
  Held at CI-Colloquium, Sonderforschungsbereich Computational Intelligence (SFB 531), 30 May 2005, University of Dortmund, Germany.

• (Multi-Objective) Evolutionary Algorithms and the Minimum Spanning Tree Problem.
  Held at Mini-Colloquium "Analysis of Randomized Search Heuristics: Hard Results for Soft Algorithms", 10 - 11 May 2005, ETH Zürich, Switzerland.

2004:

• Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem.
  Held at The 8th International Conference on Parallel Problem Solving from Nature - PPSN VIII, 18 - 22 September 2004, Birmingham, UK.

• Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem.
  Held at The Genetic and Evolutionary Computation Conference 2004 - GECCO 2004, 26 - 30 June 2004, Seattle, Washington, USA.

• Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem.
  Held at The Congress on Evolutionary Computation 2004 - CEC 2004, 19 - 23 June 2004, Portland, Oregon, USA.

• Evolutionäre Algorithmen und das Eulerkreisproblem.
  Held at Kolloquium Programmiersprachen und Grundlagen der Programmierung, 17 - 19 March 2004, Freiburg, Germany.

2003:

• Specific Evolutionary Algorithms for Permutation Problems.
  Held at 4th WSEAS International Conference on Evolutionary Computation, 29 - 31 May 2003, Athens, Greece.