Frank Neumann

	2009
50		Stefan Kratsch, Frank Neumann: Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO 2009: 293-300
49		Tobias Friedrich, Christian Horoba, Frank Neumann: Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578
48		Benjamin Doerr, Anton Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile: Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778
47		Frank Neumann, Pietro Simone Oliveto, Carsten Witt: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO 2009: 835-842
46		Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2009: 3157-3184
45		Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica 54(2): 243-255 (2009)
44		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)
43		Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009)
	2008
42		Frank Neumann, Dirk Sudholt, Carsten Witt: Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference 2008: 132-143
41		Christian Horoba, Frank Neumann: Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. GECCO 2008: 641-648
40		Frank Neumann, Joachim Reichel, Martin Skutella: Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786
39		Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960
38		Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2008: 2417-2444
37		Florian Diedrich, Frank Neumann: Using fast matrix multiplication in bio-inspired computation for complex optimization problems. IEEE Congress on Evolutionary Computation 2008: 3827-3832
36		Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003
35		Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann: Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. PPSN 2008: 1051-1060
34		Dimo Brockhoff, Tobias Friedrich, Frank Neumann: Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660
33		Tobias Friedrich, Christian Horoba, Frank Neumann: Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680
32		Frank Neumann, Joachim Reichel: Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. PPSN 2008: 72-81
31		Florian Diedrich, Britta Kehden, Frank Neumann: Multi-objective Problems in Terms of Relational Algebra. RelMiCS 2008: 84-98
30		Frank Neumann: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers & OR 35(9): 2750-2759 (2008)
	2007
29		Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225
28		Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
27		Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772
26		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
25		Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250
24		Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann: A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597
23		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
22		Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629
21		Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166
20		Frank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75
19		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)
18		Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evolutionary Computation 15(4): 401-410 (2007)
17		Frank Neumann, Ingo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)
	2006
16		Britta Kehden, Frank Neumann: A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP 2006: 147-158
15		Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627
14		Frank Neumann, Marco Laumanns: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. LATIN 2006: 745-756
13		Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987
12		Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006
11		Nils Hebbinghaus, Benjamin Doerr, Frank Neumann: Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electronic Colloquium on Computational Complexity (ECCC) 13(083): (2006)
10		Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084): (2006)
9		Frank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(143): (2006)
8		Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3): 305-319 (2006)
	2005
7		Rudolf Berghammer, Frank Neumann: RelView - An OBDD-Based Computer Algebra System for Relations. CASC 2005: 40-51
6		Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. GECCO 2005: 763-769
5		Britta Kehden, Frank Neumann, Rudolf Berghammer: Relational Implementation of Simple Parallel Evolutionary Algorithms. RelMiCS 2005: 161-172
4		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)
	2004
3		Frank Neumann, Ingo Wegener: Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) 2004: 713-724
2		Frank Neumann: Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. PPSN 2004: 81-90
	1999
1		Karl Jug, Christian Kölle, Frank Neumann: Treatment of reactions in solutions with isodensity surfaces. Journal of Computational Chemistry 20(3): 301-304 (1999)

Coauthor Index

1	Rudolf Berghammer	[5] [7]
2	Dimo Brockhoff	[27] [34]
3	Florian Diedrich	[31] [37]
4	Benjamin Doerr	[11] [13] [18] [24] [28] [48]
5	Anton Eremeev	[48]
6	Tobias Friedrich	[19] [22] [23] [26] [27] [29] [33] [34] [36] [43] [44] [49]
7	Adam Ghandar	[35]
8	Michael Gnewuch	[24]
9	Edda Happ	[39]
10	Jun He	[19] [23] [26] [44]
11	Nils Hebbinghaus	[11] [13] [18] [19] [22] [23] [24] [26] [27] [29] [43] [44]
12	Christian Horoba	[33] [41] [48] [49]
13	Thomas Jansen	[25] [38] [46]
14	Daniel Johannsen	[39]
15	Karl Jug	[1]
16	Britta Kehden	[5] [16] [31]
17	Christian Klein	[27] [39]
18	Christian Kölle	[1]
19	Stefan Kratsch	[50]
20	Jens Kroeske	[35]
21	Marco Laumanns	[4] [14]
22	Zbigniew Michalewicz	[35]
23	Pietro Simone Oliveto	[47]
24	Joachim Reichel	[32] [40]
25	Martin Skutella	[40]
26	Dirk Sudholt	[20] [28] [42]
27	Madeleine Theile	[48]
28	Ingo Wegener	[3] [6] [8] [17]
29	Carsten Witt	[9] [10] [12] [15] [19] [20] [21] [23] [26] [28] [42] [44] [45] [47]
30	Eckart Zitzler	[27]

Colors in the list of coauthors