dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Frank Neumann Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann: Computational Complexity Analysis of Multi-Objective Genetic Programming CoRR abs/1203.4881: (2012)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarkus Wagner, Jareth Day, Frank Neumann: A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines CoRR abs/1204.4560: (2012)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo 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)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPer 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)
2011
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Trent Kroeger, Frank Neumann: Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence 2011: 291-300
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo 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
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Pietro Simone Oliveto, Günter Rudolph, Dirk Sudholt: On the effectiveness of crossover for migration in parallel evolutionary algorithms. GECCO 2011: 1587-1594
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo Kötzing, Frank Neumann, Reto Spöhel: PAC learning and genetic programming. GECCO 2011: 2091-2096
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2011: 1053-1080
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2011: 1213-1232
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner: Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI 2011: 1198-1203
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarkus 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
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Joachim Reichel, Martin Skutella: Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica 59(3): 323-342 (2011)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarkus Wagner, Frank Neumann: Computational Complexity Results for Genetic Programming and the Sorting Problem CoRR abs/1103.5797: (2011)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarkus Wagner, Jareth Day, Diora Jordan, Trent Kroeger, Frank Neumann: Evolving Pacing Strategies for Team Pursuit Track Cycling CoRR abs/1104.0775: (2011)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatya 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)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Christian Horoba, Frank Neumann: Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. 412(17): 1546-1556 (2011)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. 412(17): 1629-1644 (2011)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen: Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011)
2010
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo 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
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto: Ant colony optimization and the minimum cut problem. GECCO 2010: 1393-1400
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf Berghammer, Tobias Friedrich, Frank Neumann: Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO 2010: 495-502
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Dirk Sudholt, Carsten Witt: A few ants are enough: ACO with iteration-best update. GECCO 2010: 63-70
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2010: 2557-2576
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2010: 2683-2710
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSüntje Böttcher, Benjamin Doerr, Frank Neumann: Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) 2010: 1-10
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin 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
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan 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
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Madeleine Theile: How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. PPSN (1) 2010: 667-676
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdam Ghandar, Zbigniew Michalewicz, Frank Neumann: Evolving Fuzzy Rules: Evaluation of a New Approach. SEAL 2010: 250-259
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Frank Neumann, Ingo Wegener: Editorial. Algorithmica 57(1): 119-120 (2010)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Frank Neumann: In Memoriam: Ingo Wegener. Algorithmica 58(3): 541-542 (2010)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGreg 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)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo 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)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evolutionary Computation 18(3): 333-334 (2010)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias 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)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Frank Neumann: When to use bit-wise neutrality. Natural Computing 9(1): 283-294 (2010)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Ant Colony Optimization and the minimum spanning tree problem. Theor. Comput. Sci. 411(25): 2406-2413 (2010)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. 411(6): 854-864 (2010)
2009
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSurender 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
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Horoba, Frank Neumann: Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. FOGA 2009: 79-86
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefan Kratsch, Frank Neumann: Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO 2009: 293-300
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Christian Horoba, Frank Neumann: Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile: Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Pietro Simone Oliveto, Carsten Witt: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO 2009: 835-842
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2009: 3157-3184
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro 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
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Dirk Sudholt, Carsten Witt: Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Innovations in Swarm Intelligence 2009: 91-120
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica 54(2): 243-255 (2009)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias 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)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimo 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)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Dirk Sudholt, Carsten Witt: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3(1): 35-68 (2009)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Nils Hebbinghaus, Frank Neumann: Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009)
2008
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Dirk Sudholt, Carsten Witt: Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference 2008: 132-143
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Horoba, Frank Neumann: Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. GECCO 2008: 641-648
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Joachim Reichel, Martin Skutella: Computing minimum cuts by randomized search heuristics. GECCO 2008: 779-786
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdda Happ, Daniel Johannsen, Christian Klein, Frank Neumann: Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO 2008: 953-960
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2008: 2417-2444
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian Diedrich, Frank Neumann: Using fast matrix multiplication in bio-inspired computation for complex optimization problems. IEEE Congress on Evolutionary Computation 2008: 3827-3832
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Frank Neumann: When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann: Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. PPSN 2008: 1051-1060
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimo Brockhoff, Tobias Friedrich, Frank Neumann: Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Christian Horoba, Frank Neumann: Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Joachim Reichel: Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. PPSN 2008: 72-81
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian Diedrich, Britta Kehden, Frank Neumann: Multi-objective Problems in Terms of Relational Algebra. RelMiCS 2008: 84-98
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers & OR 35(9): 2750-2759 (2008)
2007
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt: On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Jansen, Frank Neumann: Computational complexity and evolutionary computation. GECCO (Companion) 2007: 3225-3250
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann: A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. LION 2007: 153-166
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Dirk Sudholt, Carsten Witt: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS 2007: 61-75
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTobias 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)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evolutionary Computation 15(4): 401-410 (2007)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Ingo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)
2006
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBritta Kehden, Frank Neumann: A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP 2006: 147-158
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC 2006: 618-627
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Marco Laumanns: Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. LATIN 2006: 745-756
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenjamin Doerr, Nils Hebbinghaus, Frank Neumann: Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN 2006: 978-987
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms 2006
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNils Hebbinghaus, Benjamin Doerr, Frank Neumann: Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electronic Colloquium on Computational Complexity (ECCC) 13(083): (2006)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electronic Colloquium on Computational Complexity (ECCC) 13(084): (2006)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Carsten Witt: Ant Colony Optimization and the Minimum Spanning Tree Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(143): (2006)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3): 305-319 (2006)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann: Combinatorial optimization and the analysis of randomized search heuristics. University of Kiel 2006: 1-143
2005
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf Berghammer, Frank Neumann: RelView - An OBDD-Based Computer Algebra System for Relations. CASC 2005: 40-51
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. GECCO 2005: 763-769
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBritta Kehden, Frank Neumann, Rudolf Berghammer: Relational Implementation of Simple Parallel Evolutionary Algorithms. RelMiCS 2005: 161-172
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann, Ingo Wegener: Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) 2004: 713-724
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Neumann: Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. PPSN 2004: 81-90
1999
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl 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

1Surender Baswana [57]
2Rudolf Berghammer [5] [7] [76]
3Somenath Biswas [57]
4Süntje Böttcher [72]
5Karl Bringmann [87]
6Dimo Brockhoff [28] [35] [46]
7Jareth Day [83] [97]
8Florian Diedrich [32] [38]
9Benjamin Doerr [12] [14] [19] [25] [29] [53] [57] [65] [66] [71] [72] [79] [80] [86]
10Greg Durrett [64] [92]
11Anton V. Eremeev [53] [79]
12Tobias Friedrich [20] [23] [24] [27] [28] [30] [34] [35] [37] [44] [46] [47] [54] [57] [58] [60] [61] [74] [76] [81] [82] [87] [88] [94]
13Adam Ghandar (Adam Mostafa Ghandar) [36] [68]
14Michael Gnewuch [25]
15Edda Happ [40]
16Jun He [20] [24] [27] [47] [61]
17Nils Hebbinghaus [12] [14] [19] [20] [23] [24] [25] [27] [28] [30] [44] [46] [47] [58] [61]
18Sebastian Hoffmann [86]
19Christian Horoba [34] [42] [53] [54] [56] [67] [81]
20Thomas Jansen [26] [39] [51] [62] [73] [89]
21Daniel Johannsen [40] [71] [86]
22Diora Jordan [83]
23Karl Jug [1]
24Britta Kehden [5] [17] [32]
25Christian Klein [28] [40] [46]
26Christian Kölle [1]
27Timo Kötzing [63] [71] [77] [78] [90] [93] [96]
28Stefan Kratsch [55] [70]
29Trent Kroeger [83] [94]
30Jens Kroeske [36]
31Piyush P. Kurur [57]
32Marco Laumanns [4] [15]
33Per Kristian Lehre [50] [70] [77] [95]
34Markus Mainberger [86]
35Zbigniew Michalewicz [36] [68]
36Una-May O'Reilly [64] [92]
37Pietro Simone Oliveto [50] [52] [70] [77] [91]
38Joachim Reichel [33] [41] [85]
39Heiko Röglin (Heiko Roeglin) [78] [96]
40Jonathan E. Rowe [95]
41Günter Rudolph [91]
42Martin Skutella [41] [85]
43Reto Spöhel [90]
44Dirk Sudholt [21] [29] [43] [45] [49] [63] [75] [80] [91] [93]
45Ching Hoo Tang [86]
46Madeleine Theile [53] [69] [71] [79]
47Christian Thyssen [79]
48Ekaterina Vladislavleva (Katya Vladislavleva) [82]
49Markus Wagner [63] [82] [83] [84] [87] [93] [97]
50Ingo Wegener [3] [6] [9] [18] [66]
51Joachim Weickert [86]
52Carsten Witt [10] [11] [13] [16] [20] [21] [22] [24] [27] [29] [43] [45] [47] [48] [49] [52] [59] [61] [75] [78] [80] [96]
53Xin Yao [95]
54Eckart Zitzler [28] [46]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page