Frank Neumann

Q: What Schools Are Affiliated With Frank Neumann

Frank Neumann is affiliated with the following schools: Kiel University, Stanford University, Carnegie Mellon University, University of Adelaide

Frank Neumann's AcademicInfluence.com Rankings

Frank Neumann

Computer Science

#9741

World Rank

#10219

Historical Rank

Machine Learning

#4348

World Rank

#4398

Historical Rank

Artificial Intelligence

#4700

World Rank

#4763

Historical Rank

Database

#6704

World Rank

#6940

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Frank Neumann's Degrees

PhD Computer Science Stanford University
Bachelors Computer Science Carnegie Mellon University

Similar Degrees You Can Earn

Why Is Frank Neumann Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Frank Neumann's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (2004) (285)
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity (2010) (270)
Automated Algorithm Selection: Survey and Perspectives (2018) (233)
Minimum spanning trees made easier via multi-objective optimization (2005) (173)
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models (2007) (155)
Runtime Analysis of a Simple Ant Colony Optimization Algorithm (2006) (153)
Bioinspired Computation in Combinatorial Optimization (2010) (149)
Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem (2010) (146)
Do additional objectives make a problem harder? (2007) (117)
Theory of Evolutionary Computation: Recent Developments in Discrete Optimization (2020) (111)
A comprehensive benchmark set and heuristics for the traveling thief problem (2014) (98)
Analyzing Hypervolume Indicator Based Algorithms (2008) (98)
Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem (2004) (97)
Bioinspired computation in combinatorial optimization: algorithms and their computational complexity (2012) (96)
Ant Colony Optimization and the minimum spanning tree problem (2006) (95)
A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines (2012) (94)
Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation (2011) (90)
On the Effects of Adding Objectives to Plateau Functions (2009) (85)
Analysis of different MMAS ACO algorithms on unimodal functions and plateaus (2009) (85)
Approximation-Guided Evolutionary Multi-Objective Optimization (2011) (84)
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem (2004) (83)
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (2012) (83)
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem (2009) (80)
A fast approximation-guided evolutionary multi-objective algorithm (2013) (78)
Multiplicative approximations and the hypervolume indicator (2009) (71)
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting (2011) (69)
Theoretical analysis of fitness-proportional selection: landscapes and efficiency (2009) (69)
RelView - An OBDD-Based Computer Algebra System for Relations (2005) (65)
Computing single source shortest paths using single-objective fitness (2009) (58)
Robust Fitting in Computer Vision: Easy or Hard? (2018) (57)
Optimizing the Layout of 1000 Wind Turbines (2011) (56)
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms (2015) (55)
Rigorous analyses of fitness-proportional selection for optimizing linear functions (2008) (54)
On the runtime analysis of the 1-ANT ACO algorithm (2007) (54)
More Effective Crossover Operators for the All-Pairs Shortest Path Problem (2010) (52)
Theoretical analysis of two ACO approaches for the traveling salesman problem (2012) (49)
Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness (2012) (48)
Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators (2007) (48)
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search (2008) (48)
Weighted preferences in evolutionary multi-objective optimization (2011) (48)
Computing Minimum Cuts by Randomized Search Heuristics (2008) (48)
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization (2008) (46)
A few ants are enough: ACO with iteration-best update (2010) (46)
On the effectiveness of crossover for migration in parallel evolutionary algorithms (2011) (46)
Optimizing energy output and layout costs for large wind farms using particle swarm optimization (2012) (45)
Guaranteed Outlier Removal with Mixed Integer Linear Programs (2016) (44)
Fast and effective multi-objective optimisation of wind turbine placement (2013) (44)
Feature-Based Diversity Optimization for Problem Instance Classification (2015) (44)
Rigorous analyses of simple diversity mechanisms (2007) (43)
Theoretical analysis of rank-based mutation - combining exploration and exploitation (2009) (43)
Discrepancy-based evolutionary diversity optimization (2018) (42)
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics (2010) (41)
Pareto Optimization for Subset Selection with Dynamic Cost Constraints (2018) (40)
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem (2009) (39)
Can Single-Objective Optimization Profit from Multiobjective Optimization? (2008) (37)
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms (2008) (35)
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem (2012) (35)
Evolutionary algorithms and dynamic programming (2009) (35)
Combinatorial Optimization and Computational Complexity (2010) (34)
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling (2015) (33)
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation (2010) (33)
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem (2013) (33)
Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem (2014) (33)
Analyzing the Effects of Instance Features and Algorithm Parameters for Max–Min Ant System and the Traveling Salesperson Problem (2015) (32)
Part E: Evolutionary Computation (2015) (31)
Evolutionary computation for multicomponent problems: opportunities and future directions (2016) (31)
Evolutionary diversity optimization using multi-objective indicators (2018) (31)
Fast and Effective Optimisation of Arrays of Submerged Wave Energy Converters (2016) (31)
Runtime analysis of the 1-ANT ant colony optimizer (2011) (30)
Efficient optimization of many objectives by approximation-guided evolution (2015) (30)
Simple max-min ant systems and the optimization of linear pseudo-boolean functions (2010) (29)
Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms (2015) (29)
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints (2018) (29)
Evolving diverse TSP instances by means of novel and creative mutation operators (2019) (28)
Exact Approaches for the Travelling Thief Problem (2017) (27)
The max problem revisited: the importance of mutation in genetic programming (2012) (27)
Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search (2009) (27)
Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem (2018) (26)
Proceedings of the Genetic and Evolutionary Computation Conference 2016 (2016) (26)
Optimising Spatial and Tonal Data for PDE-based Inpainting (2015) (26)
How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem (2010) (26)
A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling (2012) (26)
Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators (2006) (25)
Fast Building Block Assembly by Majority Vote Crossover (2016) (25)
On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem (2018) (25)
Ant colony optimization and the minimum cut problem (2010) (24)
Evolutionary Image Transition Using Random Walks (2017) (24)
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem (2010) (24)
Computational complexity analysis of multi-objective genetic programming (2012) (24)
Plateaus can be harder in multi-objective optimization (2007) (22)
Evolving diverse sets of tours for the travelling salesperson problem (2020) (22)
GECCO 2007: Genetic and Evolutionary Computation Conference (2007) (21)
Optimization of Chance-Constrained Submodular Functions (2019) (20)
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints (2018) (20)
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas (2017) (20)
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints (2019) (20)
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem (2016) (19)
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments (2018) (19)
Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax (2016) (19)
Population size matters: rigorous runtime results for maximizing the hypervolume indicator (2013) (19)
A Fully Polynomial Time Approximation Scheme for Packing While Traveling (2017) (19)
Evolutionary algorithms for the chance-constrained knapsack problem (2019) (18)
Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem (2014) (18)
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles (2012) (18)
A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms (2014) (18)
Runtime analysis for maximizing population diversity in single-objective optimization (2014) (18)
Comparison of simple diversity mechanisms on plateau functions (2009) (18)
Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations (2012) (17)
PAC learning and genetic programming (2011) (17)
Illustration of fairness in evolutionary multi-objective optimization (2011) (17)
Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms (2020) (17)
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions (2007) (16)
A rigorous view on neutrality (2007) (16)
Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms (2014) (16)
Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints (2017) (16)
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives (2020) (16)
Analysis of evolutionary diversity optimisation for permutation problems (2021) (16)
On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem (2016) (16)
Particle Swarm Optimization with Velocity Adaptation (2009) (16)
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems (2014) (15)
Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem (2020) (15)
Evolutionary image composition using feature covariance matrices (2017) (15)
Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas (2014) (14)
Thomason cohomology of categories (2012) (14)
Ruggedness Quantifying for Constrained Continuous Fitness Landscapes (2015) (14)
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization (2020) (14)
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point (2013) (14)
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints (2017) (14)
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem (2016) (13)
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation (2015) (13)
Entropy-based evolutionary diversity optimisation for the traveling salesperson problem (2021) (13)
Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions (2021) (13)
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms (2017) (13)
Rings of Generalized and Stable Invariants of Pseudoreflections and Pseudoreflection Groups (1996) (13)
Evolutionary diversity optimization and the minimum spanning tree problem (2020) (12)
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems (2006) (12)
Runtime analysis of randomized search heuristics for dynamic graph coloring (2019) (12)
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms (2009) (12)
The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation (2016) (12)
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem (2019) (12)
Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization (2010) (11)
A theorem of tits, normalizers of maximal tori and fibrewise Bousfield-Kan completions (1999) (11)
Speeding up evolutionary multi-objective optimisation through diversity-based parent selection (2017) (11)
On the Use of Repair Methods in Differential Evolution for Dynamic Constrained Optimization (2018) (11)
Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem (2013) (11)
Fast re-optimization via structural diversity (2019) (11)
What's Hot in Evolutionary Computation (2017) (11)
Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics (2012) (11)
The Packing While Traveling Problem (2015) (11)
The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation (2013) (10)
Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation (2018) (10)
On the cohomology of generalized homogeneous spaces (2001) (10)
Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights (2021) (10)
Set-based multi-objective optimization, indicators, and deteriorative cycles (2010) (9)
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem (2019) (9)
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation (2021) (9)
A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems (2018) (9)
Secondary theories for simplicial manifolds and classifying spaces (2009) (9)
Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach (2008) (9)
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights (2018) (9)
A fixed budget analysis of randomized search heuristics for the traveling salesperson problem (2014) (9)
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion (2016) (8)
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT (2012) (8)
Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings (2013) (8)
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms (2021) (8)
Computational Complexity Analysis of Genetic Programming - Initial Results and Future Directions (2011) (8)
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints (2020) (8)
Evolving Pacing Strategies for Team Pursuit Track Cycling (2011) (8)
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization (2008) (8)
Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem (2013) (8)
Etale homotopy types of moduli stacks of algebraic curves with symmetries (2003) (8)
Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412) (2016) (8)
Secondary Theories for etale groupoids (2012) (8)
Atiyah sequences, connections and characteristic forms for principal bundles over groupoids and stacks (2014) (8)
Stochastic Search Algorithms (2010) (7)
Randomized greedy algorithms for covering problems (2018) (7)
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint (2019) (7)
Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem (2018) (7)
André spectral sequences for Baues–Wirsching cohomology of categories (2011) (7)
Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints (2021) (7)
Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization (2006) (7)
Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem (2017) (7)
Genetic and Evolutionary Computation Conference 2008 : GECCO 2008 (2008) (7)
Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms (2020) (7)
Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem (2020) (6)
Ahura: A Heuristic-Based Racer for the Open Racing Car Simulator (2017) (6)
Evolutionary Image Transition and Painting Using Random Walks (2020) (6)
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem (2020) (6)
Minimum Spanning Trees Made Easier (2010) (6)
On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem (2015) (6)
EVOR: an online evolutionary algorithm for car racing games (2014) (6)
Quasi-random Agents for Image Transition and Animation (2017) (6)
On the influence of pheromone updates in ACO algorithms (2007) (6)
Combinatorial optimization and the analysis of randomized search heuristics (2007) (6)
Solving hard control problems in voting systems via integer programming (2014) (6)
On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints (2019) (6)
A Feature-based analysis on the impact of linear constraints for ε-constrained differential evolution (2014) (6)
On the Performance of Different Genetic Programming Approaches for the SORTING Problem (2015) (6)
Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints (2020) (5)
A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation (2015) (5)
Single- and multi-objective genetic programming: New runtime results for sorting (2014) (5)
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem (2020) (5)
On the use of quality diversity algorithms for the traveling thief problem (2021) (5)
Torsion in the cohomology of finite loop spaces and the Eilenberg–Moore spectral sequence (2000) (5)
Rings of Generalized and Stable Invariants and Classifying Spaces of Compact Lie Groups (1997) (5)
Evolutionary diversity optimisation for the traveling thief problem (2022) (5)
Evolving Sampling Strategies for One-Shot Optimization Tasks (2020) (5)
Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem (2019) (5)
On the cohomology of homogeneous spaces of finite loop spaces and the Eilenberg–Moore spectral sequence (1999) (5)
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs (2021) (5)
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits (2022) (5)
The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics (2020) (4)
User Preferences for Approximation-Guided Multi-objective Evolution (2014) (4)
The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms (2020) (4)
Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization (2017) (4)
An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives (2012) (4)
Feature-based algorithm selection for constrained continuous optimisation (2016) (4)
On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem (2019) (4)
Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover (2016) (4)
Exploring the feature space of TSP instances using quality diversity (2022) (4)
A Feature-Based Analysis on the Impact of Set of Constraints for e-Constrained Differential Evolution (2015) (4)
On improving approximate solutions by evolutionary algorithms (2007) (4)
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables (2021) (4)
A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems (2018) (4)
Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees (2019) (4)
Parameterized Complexity Analysis of Randomized Search Heuristics (2019) (4)
Spectral sequences for Hochschild cohomology and graded centers of derived categories (2016) (4)
Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation (2022) (3)
Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem (2019) (3)
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (2013) (3)
Multi-objective Problems in Terms of Relational Algebra (2008) (3)
On the Use of Colour-Based Segmentation in Evolutionary Image Composition (2018) (3)
Computational complexity and evolutionary computation (2007) (3)
Computational complexity and evolutionary computation (2011) (3)
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs (2022) (3)
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem (2021) (3)
When to use bit-wise neutrality (2008) (3)
Moduli stacks of vector bundles and Frobenius morphisms (2004) (3)
Speeding up Evolutionary Algorithms by Restricted Mutation Operators (2006) (3)
Foreword (2019) (3)
Automated Algorithm Selection and Configuration (2016) (3)
Coevolutionary Pareto diversity optimization (2022) (3)
Optimization methods in renewable energy systems design (2016) (3)
Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem (2015) (3)
The compact genetic algorithm struggles on Cliff functions (2022) (3)
Relational Implementation of Simple Parallel Evolutionary Algorithms (2005) (3)
A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous Optimisation (2016) (2)
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization (2010) (2)
Étale homotopy types of moduli stacks of polarised abelian schemes (2015) (2)
Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem (2022) (2)
The Lusternik-Schnirelmann category for a differentiable stack (2015) (2)
One-Shot Decision-Making with and without Surrogates (2019) (2)
A Feature-Based Analysis on the Impact of Set of Constraints for \varepsilon -Constrained Differential Evolution (2015) (2)
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints (2020) (2)
Using fast matrix multiplication in bio-inspired computation for complex optimization problems (2008) (2)
Monodromy groups and bilinear monodromy invariant combinations of generalized hypergeometric type integrals (1996) (2)
Theoretical analysis of two ACO approaches for the traveling salesman problem (2011) (2)
Equivariant cohomology for differentiable stacks (2019) (2)
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Benefits and Drawbacks for the Use of ε-Dominance in Evolutionary Multi-Objective Optimization (2008) (2)
Gabriel–Zisman Cohomology and Spectral Sequences (2020) (2)
Geometry of moduli stacks of (k,l)-stable vector bundles over algebraic curves (2016) (2)
Chern-Weil theory for principal bundles over Lie groupoids. (2020) (2)
Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem (2019) (2)
Computational Complexity Results for Genetic Programming and the Sorting Problem (2011) (2)
Evolutionary computation for digital art (2018) (2)
Foundations of search: a perspective from computer science (2012) (2)
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems (2021) (2)
On the Impact of Utility Functions in Interactive Evolutionary Multi-objective Optimization (2014) (2)
Velocity Adaptation in Particle Swarm Optimization (2011) (2)
Advanced Ore Mine Optimisation under Uncertainty Using Evolution (2021) (1)
Multi-objective Minimum Spanning Trees (2010) (1)
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings (2019) (1)
On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization (2019) (1)
Search environments, representation, and encoding (2012) (1)
Modelling and optimization of run-of-mine stockpile recovery (2021) (1)
Analysis of baseline evolutionary algorithms for the packing while travelling problem (2019) (1)
Computational complexity and evolutionary computation (2010) (1)
Niching-based evolutionary diversity optimization for the traveling salesperson problem (2022) (1)
Evolutionary computation for digital art (2019) (1)
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions (2020) (1)
Quasi-random Image Transition and Animation (2019) (1)
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem (2012) (1)
More effective randomized search heuristics for graph coloring through dynamic optimization (2020) (1)
Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits (2020) (1)
Analysis of Evolutionary Diversity Optimization for Permutation Problems (2021) (1)
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem (2021) (1)
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints (2020) (1)
Atiyah sequences, connections and Chern-Weil theory for algebraic and differentiable stacks (2013) (1)
Weighted preferences in evolutionary multi-objective optimization (2012) (1)
Robust Fitting in Computer Vision: Easy or Hard? (2019) (1)
COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Computing Minimum Cuts by Randomized Search Heuristics (2008) (1)
Novelty particle swarm optimisation for truss optimisation problems (2021) (1)
Theoretical Study of Optimizing Rugged Landscapes with the cGA (2022) (1)
Homotopy Theory and Arithmetic Geometry—Motivic and Diophantine Aspects: An Introduction (2021) (1)
Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions (2020) (1)
Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation (2020) (0)
Features of Easy and Hard Instances for Approximation Algorithms and the Traveling Salesperson Problem (2012) (0)
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Minimum Spanning Trees Made Easier Via Multi-Objective Optimization (2005) (0)
Limited Query Graph Connectivity Test (2023) (0)
Evolutionary submodular optimisation: tutorial (2022) (0)
Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions (2022) (0)
Human Interactive EEG-Based Evolutionary Image Animation (2020) (0)
3-Objective Pareto Optimization for Problems with Chance Constraints (2023) (0)
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem (2023) (0)
Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA (2022) (0)
Genetic algorithm based optimization of deep convolutional neural network ensemble for pedestrian moving direction recognition (2019) (0)
2 Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization (0)
Evolutionary submodular optimisation (2021) (0)
Report from Dagstuhl Seminar 16412 Automated Algorithm Selection and Configuration (2017) (0)
Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers (2021) (0)
Evolutionary Image Transition Based on Theoretical Insights of Random Processes (2016) (0)
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas (2016) (0)
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On Improving Approximate Solutions by Evolutionary Algorithms (2007) (0)
More Effective Evolutionary Algorithms for Graph Coloring Through Dynamic Optimization (2020) (0)
Analysis of Quality Diversity Algorithms for the Knapsack Problem (2022) (0)
Advanced mine optimisation under uncertainty using evolution (2021) (0)
Computational complexity and evolutionary computation (2009) (0)
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems (2023) (0)
Computational Complexity of Evolutionary Computation in Combinatorial Optimisation (2008) (0)
Parameterized analysis of bio-inspired computing (2017) (0)
A Hybrid Ant Colony Optimization Algorithm using MapReduce for Arc Routing Problem (2018) (0)
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler (2023) (0)
Parameterized complexity analysis of evolutionary algorithms (2014) (0)
What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms (2023) (0)
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem (2022) (0)
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints (2020) (0)
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Ant Colony Optimization and the Minimum Spanning Tree Problem (2006) (0)
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints (2018) (0)
Chapter 1 COMPUTATIONAL COMPLEXITY ANALYSIS OF GENETIC PROGRAMMING-INITIAL RESULTS AND FUTURE DIRECTIONS (2011) (0)
Evolutionary computation for digital art (2020) (0)
Foundations of evolutionary multi-objective optimization (2010) (0)
Minimum Spanning Trees (2010) (0)
Foundations of evolutionary multi-objective optimization (2011) (0)
Evolving Fuzzy Rules: Evaluation of a New Approach (2010) (0)
Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211) (2016) (0)
Exact Counting and Sampling of Optima for the Knapsack Problem (2021) (0)
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (2013) (0)
Analyzing Stochastic Search Algorithms (2010) (0)
Cleaning Strategies and Cost Modelling of Experimental Membrane-based Desalination Plants (2021) (0)
Evolving Solutions to Community-Structured Satisfiability Formulas (2019) (0)
Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation (2022) (0)
Parameterized Complexity Analysis of Evolutionary Algorithms (2015) (0)
Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems (2021) (0)
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits (2023) (0)
Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation" (2012) (0)
Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems (2020) (0)
An optimization strategy for the complex large-scale stockpile blending problem (2022) (0)
Introduction About EAs Topics in Theory Optimization Time Analysis General Limitations Conclusions (2008) (0)
Computational complexity and evolutionary computation (2008) (0)
Preludes to the Eilenberg-Moore and the Leray-Serre spectral sequences (2021) (0)
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily (2021) (0)
QUILLEN SPECTRAL SEQUENCES IN HOMOLOGY AND RATIONAL HOMOTOPY OF COFIBRATIONS (1996) (0)
Connections on Lie groupoids and Chern-Weil theory (2020) (0)
Atiyah sequences and connections on principal bundles over Lie groupoids and differentiable stacks (2020) (0)
On cellularization for simplicial presheaves and motivic homotopy (2007) (0)
Gabriel–Zisman Cohomology and Spectral Sequences (2020) (0)
ON THE EXTENSION OF FINITELY EUCLIDEAN MONOIDS (2012) (0)
Variations on the cohomology of loop spaces on generalized homogeneous spaces (2006) (0)
On the Number of Rational Points of Classifying Stacks for Chevalley Group Schemes (2019) (0)
Spectral sequences for Hochschild cohomology and graded centers of derived categories (2017) (0)
Elements of simplicial de Rham and Chern – Weil theory (2008) (0)
Elements of simplicial de Rham and Chern – Weil theory (2008) (0)
Étale homotopy types of moduli stacks of polarised abelian schemes (2016) (0)
Galois Covers, Grothendieck-Teichmüller Theory and Dessins d’Enfants - An Introduction (2020) (0)

This paper list is powered by the following services:

Other Resources About Frank Neumann

cs.adelaide.edu.au

What Schools Are Affiliated With Frank Neumann?

Frank Neumann is affiliated with the following schools:

Frank Neumann's Academic­Influence.com Rankings

Frank Neumann's Degrees

Similar Degrees You Can Earn

Why Is Frank Neumann Influential?

Frank Neumann's Published Works

Published Works

Other Resources About Frank Neumann

What Schools Are Affiliated With Frank Neumann?

Frank Neumann's AcademicInfluence.com Rankings