Decoration
max planck institut
informatik
mpii logo Minerva of the Max Planck Society

Homepage

Neumann, Frank

Frank Neumann

I moved to the School of Computer Science, University of Adelaide, Australia.

Publications

    Book

  1. Cover
    F. Neumann, C. Witt (2010): Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity.
    Natural Computing Series, Springer, ISBN 978-3-642-16543-6.
    Further Information , Original publication at Springer (including online access)
    Amazon.com, Author-created final version (free download)

    Editorial Work

  2. M. Keijzer, G. Antoniol, C. Bates Congdon, K. Deb, B. Doerr, N. Hansen, J. H. Holmes, G. S. Hornby, D. Howard, J. Kennedy, S. Kumar, F. G. Lobo, J. Francis Miller, J. Moore, F. Neumann, M. Pelikan, J. Pollack, K. Sastry, K. Stanley, A. Stoica, E. Talbi, I. Wegener (2008):
    GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, ACM Press, New York, 1786 pages.

  3. D. Thierens, H.-G. Beyer, J. Bongard, J. Branke, J. A. Clark, D. Cliff, C. B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J. F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K. O. Stanley, T. Stützle, R. A. Watson, I. Wegener (2007):
    GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, ACM Press, New York, 2269 pages.

    4. Book Chapters

  4. Sabine Helwig, Frank Neumann, Rolf Wanka (2010): Particle swarm optimization with velocity adaptation.
    In: B. K. Panigrahi, Y. Shi, M.-H. Lim (Eds): Handbook of swarm intelligence - concepts, principles and applications, Springer (to appear).

  5. C. Horoba, F. Neumann (2010): Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization.
    In: C. A. Coello Coello, C. Dhaenens, L. Jourdan (Eds.): Advances in multi-objective nature inspired computing, Studies in Computational Intelligence (SCI) 272, Springer, pages 23-44.
    Available: Final Version (pdf)

  6. F. Neumann, D. Sudholt, C. Witt (2009): Computational complexity of ant colony optimization and its hybridization with local search.
    In: L.C. Jain, S. Dehuri, CP Lim (Eds.): Swarm Intelligence for Knowledge-Based Systems, Studies in Computational Intelligence (SCI) 248, Springer, pages 91-120 .
    Available: [Final Version]

  7. F. Neumann, I. Wegener (2007): Can single-objective optimization profit from multiobjective optimization?
    In: Knowles, Corne, and Deb (Eds.): Multiobjective Problem Solving from Nature - From Concepts to Applications, Springer, pages 115-130.
    Available: [Final Version]

    8. Journal Papers

  8. T. Friedrich, C. Horoba, F. Neumann (2010): Illustration of fairness in evolutionary multi-objective optimization.
    Theoretical Computer Science (to appear).

  9. F. Neumann, J. Reichel, M. Skutella (2010): Computing minimum cuts by randomized search heuristics.
    Algorithmica (to appear).
    Available: [Final Version]

  10. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt (2010): Approximating covering problems by randomized search heuristics using multi-objective models.
    Evolutionary Computation (to appear).

  11. F. Neumann, C. Witt (2010): Ant colony optimization and the minimum spanning tree problem.
    Theoretical Computer Science, Volume 411, Issue 25, pages 2406-2413.
    Available: [Final Version]

  12. T. Friedrich, F. Neumann (2010): When to use bit-wise neutrality.
    Natural Computing, Volume 9, Issue 1, pages 283-294.
    Available: [Final Version]

  13. T. Friedrich, N. Hebbinghaus, F. Neumann (2010): Plateaus can be harder in multi-objective optimization.
    Theoretical Computer Science, Volume 411, Issue 6, pages 854-864 .
    Available: [Final Version]

  14. D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, E. Zitzler (2009): On the effects of adding objectives to plateau functions.
    IEEE Transactions on Evolutionary Computation, Volume 13 , Issue 3, pages 591-603.
    Available: [Final Version]

  15. T. Friedrich, N. Hebbinghaus, F. Neumann (2009): Comparison of simple diversity mechanisms on plateau functions.
    Theoretical Computer Science, Volume 420, Issue 26, pages 2455-2462.
    Available: [Final Version]

  16. F. Neumann, C. Witt (2009): Runtime analysis of a simple ant colony optimization algorithm.
    Algorithmica, Volume 54, Issue 2, pages 243-255.
    Available: [Final Version]

  17. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt (2009): Analyses of simple hybrid algorithms for the vertex cover problem.
    Evolutionary Computation, Volume 17, Issue 1, pages 3-19.

  18. F. Neumann, D. Sudholt, C. Witt (2009): Analysis of different MMAS ACO algorithms on unimodal functions and plateaus.
    Swarm Intelligence, Volume 3, Issue 1, pages 35-68.
    Available: [Final Version]

  19. F. Neumann (2008): Expected runtimes of evolutionary algorithms for the Eulerian cycle problem.
    Computers and Operations Research, Volume 35, Issue 9, pages 2750-2759. Part Special Issue: Bio-inspired Methods in Combinatorial Optimization.
    Available: [Final Version]

  20. B. Doerr, N. Hebbinghaus, F. Neumann (2007): Speeding up evolutionary algorithms through unsymmetric mutation operators.
    Evolutionary Computation, Volume 15, Issue 4, pages 401-410.
    Available: [Final Version]

  21. F. Neumann, I. Wegener (2007): Randomized local Search, evolutionary algorithms, and the minimum spanning tree problem.
    Theoretical Computer Science, Volume 378, Issue 1, pages 32-40.
    Available: [Final Version]

  22. F. Neumann (2007): Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem.
    European Journal of Operational Research, Volume 181, Issue 3, pages 1620-1629.
    Available: [Final Version]

  23. F. Neumann, I. Wegener (2006): Minimum spanning trees made easier via multi-objective optimization.
    Natural Computing, Volume 5, Number 3, Springer Netherlands, pages 305-319.
    Available: [Final Version]

  24. F. Neumann, F. Simon (2003): Specific evolutionary algorithms for permutation problems.
    In: WSEAS Transactions on Systems 2(4), pages 900-908, WSEAS Press.

    25. Conference Papers

  25. M. Wagner, K. Veeramachaneni, F. Neumann, U.-M. O'Reilly (2011): Optimizing the layout of 1000 wind turbines.
    In: European Wind Energy Association Annual Event, EWEA 2011 (to appear).

  26. G. Durrett, F. Neumann, U.-M. O'Reilly (2011): Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics.
    In: Foundations of Genetic Algorithms XI, FOGA 2011 (to appear).

  27. T. Kötzing, F. Neumann, D. Sudholt, M. Wagner (2011): Simple {Max-Min} ant systems and the optimization of linear pseudo-Boolean functions.
    In: Foundations of Genetic Algorithms XI, FOGA 2011 (to appear).

  28. A. Ghandar, Z. Michalewicz, F. Neumann (2010): Evolving fuzzy rules: evaluation of a new approach.
    In: Eighth International Conference on Simulated Evolution And Learning, SEAL 2010 (to appear).

  29. F. Neumann, M. Theile (2010): How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem.
    In: Parallel Problem Solving from Nature XI, PPSN 2010 (to appear).

  30. S. Böttcher, B. Doerr, F. Neumann (2010): Optimal fixed and adaptive mutation rates for the LeadingOnes problem.
    In: Parallel Problem Solving from Nature XI, PPSN 2010 (to appear).

  31. B. Doerr, D. Johannsen, T. Kötzing, F. Neumann, M. Theile (2010): More effective crossover operators for the all-pairs-shortest path problem.
    In: Parallel Problem Solving from Nature XI, PPSN 2010 (to appear).

  32. S. Kratsch, P. K. Lehre, F. Neumann and P. S. Oliveto (2010): Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation.
    In: Parallel Problem Solving from Nature XI, PPSN 2010 (to appear).

  33. T. Kötzing, F. Neumann, H. Röglin, C. Witt (2010): Theoretical properties of two ACO approaches for the traveling salesman problem.
    In: Seventh International Conference on Ant Colony Optimization and Swarm Intelligence, ANTS 2010, LNCS, Springer, 324-335. (Best Paper Award)

  34. R. Berghammer, T. Friedrich, F. Neumann (2010): Set-based multi-objective optimization, indicators, and deteriorative cycles.
    In: Genetic and Evolutionary Computation Conference, GECCO 2010, ACM Press, 495-502.

  35. F. Neumann, D. Sudholt, C. Witt (2010): A few ants are enough: ACO with iteration-best update.
    In: Genetic and Evolutionary Computation Conference, GECCO 2010, ACM Press, 63-70. (Nominated for Best Paper Award)

  36. T. Kötzing, P. K. Lehre, P. S. Oliveto, F. Neumann (2010): Ant colony optimization and the minimum cut problem.
    In: Genetic and Evolutionary Computation Conference, GECCO 2010, ACM Press, 1393-1400.

  37. S. Helwig, F. Neumann, R. Wanka (2009): Particle swarm optimization with velocity adaptation.
    In: International Conference on Adaptive and Intelligent Systems, ICAIS 2009, IEEE Press, 146-151. (Best Paper Award)
    Preliminary version (pdf)

  38. S. Kratsch, F. Neumann (2009): Fixed-parameter evolutionary algorithms and the vertex cover problem.
    In: Genetic and Evolutionary Computation Conference, GECCO 2009, ACM Press, 293-300. (Best Paper Award)
    Preliminary version (pdf)

  39. T. Friedrich, C. Horoba, F. Neumann (2009): Multiplicative approximations and the hypervolume indicator.
    In: Genetic and Evolutionary Computation Conference, GECCO 2009, ACM Press 571--578. (Best Paper Award)
    Preliminary version (pdf)

  40. B. Doerr, A. Eremeev, C. Horoba, F. Neumann, M. Theile (2009): Evolutionary algorithms and dynamic programming.
    In: Genetic and Evolutionary Computation Conference, GECCO 2009, ACM Press, 771-777.
    Preliminary version (pdf)

  41. F. Neumann, P. S. Oliveto, C. Witt (2009): Theoretical analysis of fitness-proportional selection: landscapes and efficiency.
    In: Genetic and Evolutionary Computation Conference, GECCO 2009, ACM Press, 835-842.
    Preliminary version (pdf)

  42. P. S. Oliveto, P. K. Lehre, F. Neumann (2009): Theoretical analysis of rank-based mutation - combining exploration and exploitation.
    In: IEEE Congress on Evolutionary Computation 2009, CEC 2009, IEEE Press, 1455-1462. (Nominated for Best Student Paper Award (P. S. Oliveto))
    Preliminary version (pdf)

  43. C. Horoba, F. Neumann (2009): Additive approximations of Pareto-optimal sets by evolutionary multi-objective algorithms.
    In: Foundations of Genetic Algorithms 2009, FOGA 2009 (to appear).
    Preliminary version (pdf)

  44. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P. P. Kurur, F. Neumann (2009): Computing single source shortest paths using single-objective fitness functions.
    In: Foundations of Genetic Algorithms 2009, FOGA 2009 (to appear).
    Preliminary version (pdf)

  45. F. Neumann, J. Reichel (2008): Approximating minimum multicuts by evolutionary multi-objective algorithms.
    In: Parallel Problem Solving from Nature X, PPSN 2008, LNCS 5199, Springer, 72-81. (Best Paper Award)
    Preliminary version (pdf)

  46. D. Brockhoff, T. Friedrich, F. Neumann (2008): Analyzing hypervolume indicator based algorithms.
    In: Parallel Problem Solving from Nature X, PPSN 2008, LNCS 5199, Springer, 651-660.
    Preliminary version (pdf)

  47. J. Kroeske, A. Ghandar, Z. Michalewicz, F. Neumann (2008): Learning fuzzy rules with evolutionary algorithms - an analytic approach.
    In: Parallel Problem Solving from Nature X, PPSN 2008, LNCS 5199, Springer, 1051-1060.
    Preliminary version (pdf)

  48. T. Friedrich, C. Horoba, F. Neumann (2008): Runtime analyses for using fairness in evolutionary multi-objective optimization.
    In: Parallel Problem Solving from Nature X, PPSN 2008, LNCS 5199, Springer, 671-680.
    Preliminary version (pdf)

  49. F. Neumann, D. Sudholt, C. Witt (2008): Rigorous analyses for the combination of ant colony optimization and local search.
    In: Sixth International Conference on Ant Colony Optimization and Swarm Intelligence, ANTS 2008, Springer, 132-143.
    Preliminary version (pdf)

  50. E. Happ, D. Johannsen, C. Klein, F. Neumann (2008): Rigorous analyses of fitness-proportional selection for optimizing linear functions.
    In: Genetic and Evolutionary Computation Conference, GECCO 2008, ACM Press, 953-960. (Nominated for Best Paper Award)
    Preliminary version (pdf)

  51. C. Horoba, F. Neumann (2008): Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization.
    In: Genetic and Evolutionary Computation Conference, GECCO 2008, ACM Press, 641-680. (Nominated for Best Paper Award)
    Preliminary version (pdf)

  52. F. Neumann, J. Reichel, M. Skutella (2008): Computing minimum cuts by randomized search heuristics.
    In: Genetic and Evolutionary Computation Conference, GECCO 2008, ACM Press, 779-786. (Nominated for Best Paper Award)
    Preliminary version (pdf)

  53. F. Diedrich, F. Neumann (2008): Using fast matrix multiplication in bio-inspired computation for complex optimization problems.
    In: IEEE Congress on Evolutionary Computation 2008, CEC 2008, IEEE Press, 3828-3833.

  54. T. Friedrich, F. Neumann (2008): When to use bit-wise neutrality.
    In: IEEE Congress on Evolutionary Computation 2008, CEC 2008, IEEE Press, 997-1003.

  55. F. Diedrich, B. Kehden, F. Neumann (2008): Multi-objective problems in terms of relational algebra.
    In: 10th International Conference on Relational Methods in Computer Science, RelMiCS 2008, LNCS 4988 Springer, 84-98.

  56. F. Neumann, C. Witt (2008): Ant colony optimization and the minimum spanning tree problem.
    In: Learning and Intelligent OptimizatioN II, LION 2008, Springer, 153-166.
    Electronic Colloquium on Computational Complexity (ECCC), Report No. 143, 2006.
    Available: [ECCC Report TR06-143]

  57. B. Doerr, M. Gnewuch, N. Hebbinghaus, F. Neumann (2007): A rigorous view on neutrality.
    In: IEEE Congress on Evolutionary Computation 2007, CEC 2007, IEEE press, 2591-2597.

  58. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt (2007): On improving approximate solutions by evolutionary algorithms.
    In: IEEE Congress on Evolutionary Computation 2007, CEC 2007, IEEE press, 2614-2621.

  59. T. Friedrich, N. Hebbinghaus, F. Neumann (2007): Plateaus can be harder in multi-objective optimization.
    In: IEEE Congress on Evolutionary Computation 2007, CEC 2007, IEEE press, 2622-2629.

  60. F. Neumann, D. Sudholt, C. Witt (2007): Comparing variants of MMAS ACO algorithms on Pseudo-Boolean functions.
    In: Engineering Stochastic Local Search Algorithms, SLS 2007, LNCS 4638, Springer, 61-75.
    Available: [Technical Report CI 230/07]

  61. T. Friedrich, N. Hebbinghaus, F. Neumann (2007): Rigorous analyses of simple diversity mechanisms.
    In: Genetic and Evolutionary Computation Conference, GECCO 2007, ACM Press, 1219-1225. (Nominated for Best Paper Award)

  62. D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, E. Zitzler (2007): Do additional objectives make a problem harder?
    In: Genetic and Evolutionary Computation Conference, GECCO 2007, ACM Press, 765-772.

  63. T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, C. Witt (2007):
    Approximating covering problems by randomized search heuristics using multi-objective models.
    In: Genetic and Evolutionary Computation Conference, GECCO 2007, ACM Press, 797-804.
    Electronic Colloquium on Computational Complexity (ECCC), Report No. 27, 2007.
    Available: [ECCC Report TR07-027]

  64. B. Doerr, F. Neumann, D. Sudholt, C. Witt (2007): On the runtime analysis of the 1-ANT ACO algorithm.
    In: Genetic and Evolutionary Computation Conference, GECCO 2007, ACM Press, 33-40. (Best Paper Award)
    Available: [Technical Report CI 223/07]

  65. F. Neumann, C. Witt (2006): Runtime analysis of a simple Ant Colony Optimization algorithm.
    In: 17th International Symposium on Algorithms and Computation, ISAAC 2006, LNCS 4288, Springer, 618-627
    Electronic Colloquium on Computational Complexity (ECCC), Report No. 84, 2006.
    Available: [ECCC Report TR06-084]

  66. B. Doerr, N. Hebbinghaus, F. Neumann (2006): Speeding up evolutionary algorithms through restricted mutation operators.
    In: Parallel Problem Solving from Nature IX, PPSN 2006, LNCS 4193, Springer, 978-987
    Electronic Colloquium on Computational Complexity (ECCC), Report No. 83, 2006.
    Available: [ECCC Report TR06-083]

  67. B. Kehden, F. Neumann (2006): A relation-algebraic view on evolutionary algorithms for some graph problems.
    In: 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCop 2006, LNCS 3906, Springer, 147 - 158. (Best Paper Award)
    Available: [Final Version]

  68. F. Neumann, M. Laumanns (2006): Speeding up approximation algorithms for NP-hard spanning forest problems by multi-objective optimization.
    In: 7th Latin American Theoretical Informatics, LATIN 2006, LNCS 3887, Springer, 745 - 756.
    Electronic Colloquium on Computational Complexity (ECCC), Report No. 29, 2005.
    Available: [Final Version, ECCC Report TR05-029]

  69. B. Kehden, F. Neumann, R. Berghammer (2006): Relational implementation of simple parallel evolutionary algorithms.
    In: 8th International Conference on Relational Methods in Computer Science, RelMiCS 2005, LNCS 3929, Springer, 161 - 172.
    Available: [Final Version]

  70. R. Berghammer, F. Neumann (2005): RELVIEW - An OBDD-based Computer Algebra system for relations.
    In: 8th International Workshop on Computer Algebra in Scientific Computing, CASC 2005, LNCS 3718, Springer, 40 -51.
    Available: [Final Version]

  71. F. Neumann, I. Wegener (2005): Minimum spanning trees made easier via multi-objective optimization.
    In: Genetic and Evolutionary Computation Conference, GECCO 2005, ACM Press, 763 - 770. (Best Paper Award)
    Available: [Final Version, Technical Report CI 192/05 (SFB 531, University of Dortmund)]

  72. F. Neumann (2004): Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem.
    In: Parallel Problem Solving from Nature VIII, PPSN 2004, LNCS 3242, Springer, 80 - 89.
    Available: [Final Version]

  73. F. Neumann, I. Wegener (2004): Randomized local search, evolutionary algorithms, and the minimum spanning tree problem.
    In: Genetic and Evolutionary Computation Conference, GECCO 2004, LNCS 3102, Springer, 713 - 724.
    Available: [Final version, Technical Report CI 165/04 (SFB 531, University of Dortmund)]

  74. F. Neumann (2004): Expected runtimes of evolutionary algorithms for the Eulerian cycle problem.
    In: IEEE Congress on Evolutionary Computation 2004, CEC 2004, volume 1, IEEE Press, 904 - 910.

Search MPII (type ? for help)