Rechnergestützte Programmentwicklung

Rechnergestützte Programmentwicklung
Institut für Informatik
Technische Fakultät, Christian-Albrechts-Universität zu Kiel

Frank Neumann

Postanschrift:
Christian-Albrechts-Universität zu Kiel
Institut für Informatik und Praktische Mathematik
Olshausenstraße 40
D-24098 Kiel

Besucheradresse:
Christian-Albrechts-Platz 4 / Zimmer 701
D-24118 Kiel

Telefon: ++49-431 880-72 62
Telefax: ++49-431 880-76 13
E-Mail: fne@informatik.uni-kiel.de

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

Arbeitsgebiete

Evolutionäre Algorithmen
Kombinatorische Optimierung
Relationenalgebra

Kurzbiographie

Geboren am 31. Oktober 1976 in Oberhausen, Deutschland
1996 Abitur
1997 - 1999 Studium der Ingenieur-Informatik an der Universität Dortmund
1999 - 2002 Studium der Ingenieur-Informatik an der Christian-Albrechts-Universität zu Kiel
2002 Diplom (mit Auszeichnung) im Studiengang Informatik (Dipl. Ing.) an der Christian-Albrechts-Universität zu Kiel
seit 2002 Wiss. Angestellter am Institut für Informatik und Praktische Mathematik an der Christian-Albrechts-Universität zu Kiel
2006 Promotion (Dr. Ing.) in Informatik

Preise

Preis für das beste Diplom in der Ingenieur-Informatik des akademischen Jahres 2002/2003 (verliehen vom Förderverein der Technischen Fakultät der Christian-Albrechts-Universität zu Kiel)
Professor Dr. Werner Petersen-Preis der Technik 2002 (verliehen vom VDE, VDI und der Professor Dr. Werner Petersen-Stiftung)
Preis für eine herausragende Diplomarbeit in Studienjahr 2001/2002 (verliehen vom Institut für Informatik und Praktische Mathematik der Christian-Albrechts-Universität zu Kiel)

Organisation

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.

Veröffentlichungen

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.

Vorträge