Frank Neumann

2008
22	EE	Florian Diedrich, Britta Kehden, Frank Neumann: Multi-objective Problems in Terms of Relational Algebra. RelMiCS 2008: 84-98
21	EE	Frank Neumann: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers & OR 35(9): 2750-2759 (2008)
2007
20	EE	Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225
19	EE	Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
18	EE	Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772
17	EE	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
16	EE	Thomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250
15	EE	Frank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75
14	EE	Frank Neumann, Ingo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)
2006
13	EE	Britta Kehden, Frank Neumann: A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP 2006: 147-158
12	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627
11	EE	Frank Neumann, Marco Laumanns: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. LATIN 2006: 745-756
10	EE	Benjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987
9	EE	Frank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006
8	EE	Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3): 305-319 (2006)
2005
7	EE	Rudolf Berghammer, Frank Neumann: RelView - An OBDD-Based Computer Algebra System for Relations. CASC 2005: 40-51
6	EE	Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. GECCO 2005: 763-769
5	EE	Britta Kehden, Frank Neumann, Rudolf Berghammer: Relational Implementation of Simple Parallel Evolutionary Algorithms. RelMiCS 2005: 161-172
4	EE	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	EE	Frank Neumann, Ingo Wegener: Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) 2004: 713-724
2	EE	Frank Neumann: Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. PPSN 2004: 81-90
1999
1	EE	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	[18]
3	Florian Diedrich	[22]
4	Benjamin Doerr	[10] [19]
5	Tobias Friedrich	[17] [18] [20]
6	Jun He	[17]
7	Nils Hebbinghaus	[10] [17] [18] [20]
8	Thomas Jansen	[16]
9	Karl Jug	[1]
10	Britta Kehden	[5] [13] [22]
11	Christian Klein	[18]
12	Christian Kölle	[1]
13	Marco Laumanns	[4] [11]
14	Dirk Sudholt	[15] [19]
15	Ingo Wegener	[3] [6] [8] [14]
16	Carsten Witt	[9] [12] [15] [17] [19]
17	Eckart Zitzler	[18]

Colors in the list of coauthors