Frank Neumann

Stefan Kratsch, Frank Neumann: Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Algorithmica 65(4): 754-771 (2013)

Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile: More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. 471: 12-26 (2013)

Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen: Evolutionary Algorithms and Dynamic Programming. CoRR abs/1301.4096 (2013)

Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 6(1): 1-21 (2012)

Per Kristian Lehre, Frank Neumann, Jonathan E. Rowe, Xin Yao: Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation". Theor. Comput. Sci. 425: 2-3 (2012)

Rudolf Berghammer, Tobias Friedrich, Frank Neumann: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. 456: 2-17 (2012)

Andrew M. Sutton, Frank Neumann: A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI 2012

Kalyan Veeramachaneni, Markus Wagner, Una-May O'Reilly, Frank Neumann: Optimizing energy output and layout costs for large wind farms using particle swarm optimization. IEEE Congress on Evolutionary Computation 2012: 1-7

Joseph Yuen, Sophia Gao, Markus Wagner, Frank Neumann: An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives. IEEE Congress on Evolutionary Computation 2012: 1-8

Andrew M. Sutton, Jareth Day, Frank Neumann: A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO 2012: 433-440

Frank Neumann: Computational complexity analysis of multi-objective genetic programming. GECCO 2012: 799-806

Frank Neumann, Carsten Witt: Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) 2012: 1035-1058

Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly: The max problem revisited: the importance of mutation in genetic programming. GECCO 2012: 1333-1340

Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann: Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. LION 2012: 115-129

Andrew M. Sutton, Frank Neumann: A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) 2012: 52-61

Tommaso Urli, Markus Wagner, Frank Neumann: Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics. PPSN (1) 2012: 102-112

Markus Wagner, Frank Neumann: Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations. PPSN (1) 2012: 133-142

Frank Neumann: Computational Complexity Analysis of Multi-Objective Genetic Programming. CoRR abs/1203.4881 (2012)

Markus Wagner, Jareth Day, Frank Neumann: A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines. CoRR abs/1204.4560 (2012)

Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile: More Effective Crossover Operators for the All-Pairs Shortest Path Problem. CoRR abs/1207.0369 (2012)

Andrew M. Sutton, Frank Neumann: A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. CoRR abs/1207.0578 (2012)

Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Frank Neumann: A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. CoRR abs/1208.2318 (2012)

Frank Neumann, Joachim Reichel, Martin Skutella: Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica 59(3): 323-342 (2011)

Tobias Friedrich, Christian Horoba, Frank Neumann: Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. 412(17): 1546-1556 (2011)

Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. 412(17): 1629-1644 (2011)

Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen: Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011)

Tobias Friedrich, Trent Kroeger, Frank Neumann: Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence 2011: 291-300

Greg Durrett, Frank Neumann, Una-May O'Reilly: Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. FOGA 2011: 69-80

Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner: Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA 2011: 209-218

Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2011: 1053-1080

Tobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2011: 1213-1232

Frank Neumann, Pietro Simone Oliveto, Günter Rudolph, Dirk Sudholt: On the effectiveness of crossover for migration in parallel evolutionary algorithms. GECCO 2011: 1587-1594

Timo Kötzing, Frank Neumann, Reto Spöhel: PAC learning and genetic programming. GECCO 2011: 2091-2096

Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner: Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI 2011: 1198-1203

Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr: Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM 2011: 26-37

Markus Wagner, Frank Neumann: Computational Complexity Results for Genetic Programming and the Sorting Problem. CoRR abs/1103.5797 (2011)

Markus Wagner, Jareth Day, Claire Diora Jordan, Trent Kroeger, Frank Neumann: Evolving Pacing Strategies for Team Pursuit Track Cycling. CoRR abs/1104.0775 (2011)

Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner: Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation. CoRR abs/1109.1922 (2011)

Benjamin Doerr, Frank Neumann, Ingo Wegener: Editorial. Algorithmica 57(1): 119-120 (2010)

Benjamin Doerr, Frank Neumann: In Memoriam: Ingo Wegener. Algorithmica 58(3): 541-542 (2010)

Thomas Jansen, Frank Neumann: Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evolutionary Computation 18(3): 333-334 (2010)

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evolutionary Computation 18(4): 617-633 (2010)

Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. Natural Computing 9(1): 283-294 (2010)

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. 411(6): 854-864 (2010)

Frank Neumann, Carsten Witt: Ant Colony Optimization and the minimum spanning tree problem. Theor. Comput. Sci. 411(25): 2406-2413 (2010)

Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt: Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference 2010: 324-335

Frank Neumann, Dirk Sudholt, Carsten Witt: A few ants are enough: ACO with iteration-best update. GECCO 2010: 63-70

Rudolf Berghammer, Tobias Friedrich, Frank Neumann: Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO 2010: 495-502

Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto: Ant colony optimization and the minimum cut problem. GECCO 2010: 1393-1400

Tobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2010: 2557-2576

Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2010: 2683-2710

Süntje Böttcher, Benjamin Doerr, Frank Neumann: Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) 2010: 1-10

Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile: More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) 2010: 184-193

Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto: Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. PPSN (1) 2010: 204-213

Frank Neumann, Madeleine Theile: How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. PPSN (1) 2010: 667-676

Adam Ghandar, Zbigniew Michalewicz, Frank Neumann: Evolving Fuzzy Rules: Evaluation of a New Approach. SEAL 2010: 250-259

Christian Horoba, Frank Neumann: Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization. Advances in Multi-Objective Nature Inspired Computing 2010: 23-44

Greg Durrett, Frank Neumann, Una-May O'Reilly: Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics. CoRR abs/1007.4636 (2010)

Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner: Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions. CoRR abs/1007.4707 (2010)

Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica 54(2): 243-255 (2009)

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 17(1): 3-19 (2009)

Frank Neumann, Dirk Sudholt, Carsten Witt: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3(1): 35-68 (2009)

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009)

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evolutionary Computation 13(3): 591-603 (2009)

Pietro Simone Oliveto, Per Kristian Lehre, Frank Neumann: Theoretical analysis of rank-based mutation - combining exploration and exploitation. IEEE Congress on Evolutionary Computation 2009: 1455-1462

Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66

Christian Horoba, Frank Neumann: Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. FOGA 2009: 79-86

Stefan Kratsch, Frank Neumann: Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO 2009: 293-300

Tobias Friedrich, Christian Horoba, Frank Neumann: Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578

Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile: Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778

Frank Neumann, Pietro Simone Oliveto, Carsten Witt: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO 2009: 835-842

Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2009: 3157-3184

Frank Neumann, Dirk Sudholt, Carsten Witt: Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Innovations in Swarm Intelligence 2009: 91-120

Frank Neumann: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers & OR 35(9): 2750-2759 (2008)

Florian Diedrich, Britta Kehden, Frank Neumann: Multi-objective Problems in Terms of Relational Algebra. RelMiCS 2008: 84-98

Frank Neumann, Dirk Sudholt, Carsten Witt: Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference 2008: 132-143

Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003

Florian Diedrich, Frank Neumann: Using fast matrix multiplication in bio-inspired computation for complex optimization problems. IEEE Congress on Evolutionary Computation 2008: 3827-3832

Christian Horoba, Frank Neumann: Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. GECCO 2008: 641-648

Frank Neumann, Joachim Reichel, Martin Skutella: Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786

Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960

Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2008: 2417-2444

Frank Neumann, Joachim Reichel: Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. PPSN 2008: 72-81

Dimo Brockhoff, Tobias Friedrich, Frank Neumann: Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660

Tobias Friedrich, Christian Horoba, Frank Neumann: Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680

Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann: Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. PPSN 2008: 1051-1060

Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evolutionary Computation 15(4): 401-410 (2007)

Frank Neumann, Ingo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)

Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann: A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629

Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225

Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250

Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166

Frank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electronic Colloquium on Computational Complexity (ECCC) 14(027) (2007)

Frank Neumann: Combinatorial optimization and the analysis of randomized search heuristics. University of Kiel 2006, pp. 1-143

Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3): 305-319 (2006)

Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006

Britta Kehden, Frank Neumann: A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP 2006: 147-158

Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627

Frank Neumann, Marco Laumanns: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. LATIN 2006: 745-756

Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987

Nils Hebbinghaus, Benjamin Doerr, Frank Neumann: Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electronic Colloquium on Computational Complexity (ECCC) 13(083) (2006)

Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084) (2006)

Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(143) (2006)

Britta Kehden, Frank Neumann, Rudolf Berghammer: Relational Implementation of Simple Parallel Evolutionary Algorithms. RelMiCS 2005: 161-172

Rudolf Berghammer, Frank Neumann: RelView - An OBDD-Based Computer Algebra System for Relations. CASC 2005: 40-51

Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. GECCO 2005: 763-769

Frank Neumann, Marco Laumanns: Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization. Electronic Colloquium on Computational Complexity (ECCC)(029) (2005)

Frank Neumann, Ingo Wegener: Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) 2004: 713-724

Frank Neumann: Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. PPSN 2004: 81-90

Karl Jug, Christian Kölle, Frank Neumann: Treatment of reactions in solutions with isodensity surfaces. Journal of Computational Chemistry 20(3): 301-304 (1999)