Frank Neumann - RankMe

499 papers A* 18A 128B 29C 2Misc 2Journal 224Unranked 86

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Evolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra. CoRR Hendrik Richter, Frank Neumann
2025	—	`conf`	A Hybrid Multi-Agent Reinforcement Learning Framework for Decentralised Search-And-Interact Tasks Under Partial Observability. AI (2) Anh Viet Do, Eranda Galhenage, Aneta Neumann, Frank Neumann, Anton V. Uzunov, Claudia Szabo
2025	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. Algorithmica Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2025	A	`conf`	Evolutionary Multitasking for the Scenario-based Travelling Thief Problem. GECCO Thilina Pathirage Don, Aneta Neumann, Frank Neumann
2025	—	`conf`	Evolutionary computation for stochastic problems. GECCO Companion Frank Neumann, Aneta Neumann, Hemant K. Singh
2025	A	`conf`	Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators. GECCO Saba Sadeghi Ahouei, Aneta Neumann, Frank Neumann
2025	A	`conf`	Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms. GECCO Shuaiqun Pan, Yash J. Patel, Aneta Neumann, Frank Neumann, Thomas Bäck, Hao Wang
2025	J	`jnl`	Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms. CoRR Shuaiqun Pan, Yash J. Patel, Aneta Neumann, Frank Neumann, Thomas Bäck, Hao Wang
2025	—	`conf`	Feature-Based Evolutionary Diversity Optimization of Discriminating Instances for Chance-Constrained Optimization Problems. EvoCOP@EvoStar Saba Sadeghi Ahouei, Denis Antipov, Aneta Neumann, Frank Neumann
2025	J	`jnl`	Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems. CoRR Saba Sadeghi Ahouei, Denis Antipov, Aneta Neumann, Frank Neumann
2025	J	`jnl`	Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. Algorithmica Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif
2025	J	`jnl`	Hardening Active Directory Graphs via Evolutionary Diversity Optimization-based Policies. ACM Trans. Evol. Learn. Optim. Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung X. Nguyen, Mingyu Guo
2025	A	`conf`	On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem. GECCO Liam Wigney, Aneta Neumann, Yew-Soon Ong, Frank Neumann
2025	A	`conf`	Population Dynamics and Improved Runtime Guarantees for the (μ+1) EA on BinVal. FOGA Martin S. Krejca, Frank Neumann, Carsten Witt
2025	A	`conf`	Quality Diversity Genetic Programming for Learning Scheduling Heuristics. GECCO Meng Xu, Frank Neumann, Aneta Neumann, Yew Soon Ong
2025	J	`jnl`	Quality Diversity Genetic Programming for Learning Scheduling Heuristics. CoRR Meng Xu, Frank Neumann, Aneta Neumann, Yew Soon Ong
2025	A	`conf`	Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems. GECCO Johannes Lengler, Aneta Neumann, Frank Neumann
2025	J	`jnl`	Runtime Analysis of Single- and Multiobjective Evolutionary Algorithms for Chance-Constrained Optimization Problems with Normally Distributed Random Variables. Evol. Comput. Frank Neumann, Carsten Witt
2025	J	`jnl`	Runtime performance of evolutionary algorithms for the chance-constrained makespan scheduling problem. Theor. Comput. Sci. Feng Shi, Daoyu Huang, Xiankun Yan, Frank Neumann
2025	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. Algorithmica Frank Neumann, Dirk Sudholt, Carsten Witt
2025	A*	`conf`	Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem. IJCAI Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt
2025	A	`conf`	Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions. FOGA Kokila Kasuni Perera, Frank Neumann, Aneta Neumann
2025	J	`jnl`	Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions. CoRR Kokila Kasuni Perera, Frank Neumann, Aneta Neumann
2025	B	`conf`	Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem. CEC Thilina Pathirage Don, Aneta Neumann, Frank Neumann
2025	J	`jnl`	Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem. CoRR Thilina Pathirage Don, Aneta Neumann, Frank Neumann
2024	A	`conf`	A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. GECCO Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann
2024	J	`jnl`	A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. CoRR Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann
2024	A	`conf`	A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax. GECCO Denis Antipov, Aneta Neumann, Frank Neumann
2024	—	`conf`	Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. PPSN (3) Jonathan Gadea Harder, Aneta Neumann, Frank Neumann
2024	J	`jnl`	Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. CoRR Jonathan Gadea Harder, Aneta Neumann, Frank Neumann
2024	—	`conf`	Archive-Based Single-Objective Evolutionary Algorithms for Submodular Optimization. PPSN (3) Frank Neumann, Günter Rudolph
2024	J	`jnl`	Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization. CoRR Frank Neumann, Günter Rudolph
2024	A	`conf`	Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem. GECCO Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
2024	B	`conf`	Enhanced Genetic Programming Models with Multiple Equations for Accurate Semi-Autogenous Grinding Mill Throughput Prediction. CEC Zahra Ghasemi, Mehdi Neshat, Chris Aldrich, John Karageorgos, Max Zanin, Frank Neumann, Lei Chen
2024	J	`jnl`	Enhanced Genetic Programming Models with Multiple Equations for Accurate Semi-Autogenous Grinding Mill Throughput Prediction. CoRR Zahra Ghasemi, Mehdi Neshat, Chris Aldrich, John Karageorgos, Max Zanin, Frank Neumann, Lei Chen
2024	A	`conf`	Evolutionary Diversity Optimisation for Sparse Directed Communication Networks. GECCO Sharlotte Gounder, Frank Neumann, Aneta Neumann
2024	J	`jnl`	Evolutionary Multi-Objective Diversity Optimization. CoRR Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2024	—	`conf`	Evolutionary Multi-objective Diversity Optimization. PPSN (4) Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2024	—	`conf`	Evolutionary computation for stochastic problems. GECCO Companion Frank Neumann, Aneta Neumann, Hemant Kumar Singh
2024	A	`conf`	Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. GECCO Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann, Thomas Bäck, Frank Neumann
2024	J	`jnl`	Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. CoRR Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann, Thomas Bäck, Frank Neumann
2024	J	`jnl`	Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers. CoRR Jack Kearney, Frank Neumann, Andrew M. Sutton
2024	A	`conf`	Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. GECCO Marcus Schmidbauer, Andre Opris, Jakob Bossek, Frank Neumann, Dirk Sudholt
2024	J	`jnl`	Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization. CoRR Maria Laura Santoni, Elena Raponi, Aneta Neumann, Frank Neumann, Mike Preuss, Carola Doerr
2024	A*	`conf`	Limited Query Graph Connectivity Test. AAAI Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung X. Nguyen
2024	—	`conf`	Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. PPSN (3) Denis Antipov, Aneta Neumann, Frank Neumann
2024	J	`jnl`	Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. CoRR Denis Antipov, Aneta Neumann, Frank Neumann
2024	—	`conf`	Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits. PPSN (1) Kokila Kasuni Perera, Frank Neumann, Aneta Neumann
2024	J	`jnl`	On the Use of Quality Diversity Algorithms for the Travelling Thief Problem. ACM Trans. Evol. Learn. Optim. Adel Nikfarjam, Aneta Neumann, Frank Neumann
2024	A	`conf`	Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes. GECCO Adel Nikfarjam, Ty Stanford, Aneta Neumann, Dorothea Dumuid, Frank Neumann
2024	A	`conf`	Runtime Analyses of NSGA-III on Many-Objective Problems. GECCO Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt
2024	J	`jnl`	Runtime Analyses of NSGA-III on Many-Objective Problems. CoRR Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt
2024	—	`conf`	Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. PPSN (3) Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2024	J	`jnl`	Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2024	A	`conf`	Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. GECCO Xiankun Yan, Aneta Neumann, Frank Neumann
2024	J	`jnl`	Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. CoRR Xiankun Yan, Aneta Neumann, Frank Neumann
2024	—	`conf`	Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. PPSN (3) Frank Neumann, Carsten Witt
2024	J	`jnl`	Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. CoRR Frank Neumann, Carsten Witt
2024	J	`jnl`	Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. CoRR Xiankun Yan, Aneta Neumann, Frank Neumann
2024	—	`conf`	Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. PPSN (1) Xiankun Yan, Aneta Neumann, Frank Neumann
2024	A	`conf`	The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. GECCO Thilina Pathirage Don, Aneta Neumann, Frank Neumann
2024	J	`jnl`	Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem. CoRR Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt
2024	A	`conf`	Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. GECCO Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
2024	J	`jnl`	Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. CoRR Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
2024	A	`conf`	What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. GECCO Furong Ye, Frank Neumann, Jacob de Nobel, Aneta Neumann, Thomas Bäck
2023	A	`conf`	3-Objective Pareto Optimization for Problems with Chance Constraints. GECCO Frank Neumann, Carsten Witt
2023	J	`jnl`	3-Objective Pareto Optimization for Problems with Chance Constraints. CoRR Frank Neumann, Carsten Witt
2023	J	`jnl`	A Hybrid Intelligent Framework for Maximising SAG Mill Throughput: An Integration of Expert Knowledge, Machine Learning and Evolutionary Algorithms for Parameter Optimisation. CoRR Zahra Ghasemi, Mehdi Neshat, Chris Aldrich, John Karageorgos, Max Zanin, Frank Neumann, Lei Chen
2023	—	`conf`	A Study of Fitness Gains in Evolving Finite State Machines. AI (2) Gabor Zoltai, Yue Xie, Frank Neumann
2023	J	`jnl`	A Study of Fitness Gains in Evolving Finite State Machines. CoRR Gabor Zoltai, Yue Xie, Frank Neumann
2023	A	`conf`	Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	B	`conf`	Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. CEC Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, Thomas Bäck
2023	J	`jnl`	Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. CoRR Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, Thomas Bäck
2023	A*	`conf`	Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. IJCAI Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2023	J	`jnl`	Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. CoRR Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2023	A	`conf`	Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks. GECCO Aneta Neumann, Sharlotte Gounder, Xiankun Yan, Gregory Sherman, Benjamin Campbell, Mingyu Guo, Frank Neumann
2023	A	`conf`	Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. GECCO Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
2023	J	`jnl`	Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. CoRR Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
2023	J	`jnl`	Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. CoRR Kokila Perera, Aneta Neumann, Frank Neumann
2023	—	`conf`	Evolutionary computation for stochastic problems. GECCO Companion Frank Neumann, Aneta Neumann, Hemant K. Singh
2023	A	`conf`	Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. GECCO Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
2023	J	`jnl`	Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. CoRR Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
2023	A	`conf`	Fast Pareto Optimization Using Sliding Window Selection. ECAI Frank Neumann, Carsten Witt
2023	J	`jnl`	Fast Pareto Optimization Using Sliding Window Selection. CoRR Frank Neumann, Carsten Witt
2023	A	`conf`	Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. GECCO Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif
2023	A	`conf`	Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. FOGA Jack Kearney, Frank Neumann, Andrew M. Sutton
2023	B	`conf`	Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CEC Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
2023	J	`jnl`	Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CoRR Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
2023	J	`jnl`	Limited Query Graph Connectivity Test. CoRR Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
2023	A	`conf`	On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. GECCO Jakob Bossek, Aneta Neumann, Frank Neumann
2023	J	`jnl`	On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2023	A	`conf`	Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. ECAI Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, Frank Neumann
2023	J	`jnl`	Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. CoRR Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, Frank Neumann
2023	A	`conf`	Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. FOGA Denis Antipov, Aneta Neumann, Frank Neumann
2023	J	`jnl`	Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. CoRR Denis Antipov, Aneta Neumann, Frank Neumann
2023	A*	`conf`	Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. NeurIPS Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2023	J	`jnl`	Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. CoRR Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2023	A*	`conf`	Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. AAAI Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen
2023	J	`jnl`	What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. CoRR Furong Ye, Frank Neumann, Jacob de Nobel, Aneta Neumann, Thomas Bäck
2022	—	`conf`	An optimization strategy for the complex large-scale stockpile blending problem. GECCO Companion Yue Xie, Aneta Neumann, Frank Neumann
2022	J	`jnl`	Analysis of Evolutionary Diversity Optimization for Permutation Problems. ACM Trans. Evol. Learn. Optim. Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2022	—	`conf`	Analysis of Quality Diversity Algorithms for the Knapsack Problem. PPSN (2) Adel Nikfarjam, Anh Viet Do, Frank Neumann
2022	J	`jnl`	Analysis of Quality Diversity Algorithms for the Knapsack Problem. CoRR Adel Nikfarjam, Anh Viet Do, Frank Neumann
2022	J	`jnl`	Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. CoRR Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
2022	—	`conf`	Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. PPSN (1) Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
2022	J	`jnl`	Coevolutionary Pareto Diversity Optimization. CoRR Aneta Neumann, Denis Antipov, Frank Neumann
2022	A	`conf`	Coevolutionary Pareto diversity optimization. GECCO Aneta Neumann, Denis Antipov, Frank Neumann
2022	—	`conf`	Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation. PPSN (1) Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann
2022	J	`jnl`	Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation. CoRR Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann
2022	J	`jnl`	Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation. CoRR Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
2022	A	`conf`	Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. GECCO Diksha Goel, Max Hector Ward-Graham, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
2022	J	`jnl`	Editorial. Algorithmica Johannes Lengler, Frank Neumann
2022	—	`conf`	Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. PPSN (1) Aneta Neumann, Yue Xie, Frank Neumann
2022	J	`jnl`	Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. CoRR Aneta Neumann, Yue Xie, Frank Neumann
2022	J	`jnl`	Evolutionary Diversity Optimisation for The Traveling Thief Problem. CoRR Adel Nikfarjam, Aneta Neumann, Frank Neumann
2022	—	`conf`	Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. PPSN (2) Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann
2022	J	`jnl`	Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. CoRR Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann
2022	A	`conf`	Evolutionary diversity optimisation for the traveling thief problem. GECCO Adel Nikfarjam, Aneta Neumann, Frank Neumann
2022	—	`conf`	Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. GECCO Companion Jakob Bossek, Aneta Neumann, Frank Neumann
2022	—	`conf`	Evolutionary submodular optimisation: tutorial. GECCO Companion Aneta Neumann, Frank Neumann, Chao Qian
2022	J	`jnl`	Exploring the Feature Space of TSP Instances Using Quality Diversity. CoRR Jakob Bossek, Frank Neumann
2022	A	`conf`	Exploring the feature space of TSP instances using quality diversity. GECCO Jakob Bossek, Frank Neumann
2022	J	`jnl`	Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem. CoRR Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2022	A	`conf`	Niching-based evolutionary diversity optimization for the traveling salesperson problem. GECCO Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2022	B	`conf`	Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems. EvoCOP Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li
2022	A	`conf`	On the use of quality diversity algorithms for the traveling thief problem. GECCO Adel Nikfarjam, Aneta Neumann, Frank Neumann
2022	J	`jnl`	Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2022	A*	`conf`	Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. AAAI Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
2022	Misc	`conf`	Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers. SAC Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann
2022	—	`conf`	Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. PPSN (2) Feng Shi, Xiankun Yan, Frank Neumann
2022	A*	`conf`	Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. IJCAI Frank Neumann, Carsten Witt
2022	—	`conf`	Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. PPSN (2) Frank Neumann, Carsten Witt
2022	J	`jnl`	Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. CoRR Frank Neumann, Carsten Witt
2022	J	`jnl`	Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem. CoRR Feng Shi, Xiankun Yan, Frank Neumann
2022	J	`jnl`	Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. CoRR Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen
2022	J	`jnl`	Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Theor. Comput. Sci. Vahid Roostapour, Aneta Neumann, Frank Neumann
2022	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. CoRR Frank Neumann, Dirk Sudholt, Carsten Witt
2022	A	`conf`	The compact genetic algorithm struggles on Cliff functions. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2022	—	`conf`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. PPSN (2) Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2022	J	`jnl`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. CoRR Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2021	J	`jnl`	A General Method to Find Highly Coordinating Communities in Social Media through Inferred Interaction Links. CoRR Derek Weber, Frank Neumann
2021	J	`jnl`	A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. ACM Trans. Evol. Learn. Optim. Benjamin Doerr, Frank Neumann
2021	J	`jnl`	Advanced Ore Mine Optimisation under Uncertainty Using Evolution. CoRR William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
2021	—	`conf`	Advanced mine optimisation under uncertainty using evolution. GECCO Companion William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
2021	J	`jnl`	Amplifying influence through coordinated behaviour in social networks. Soc. Netw. Anal. Min. Derek Weber, Frank Neumann
2021	J	`jnl`	Analysis of Evolutionary Diversity Optimisation for Permutation Problems. CoRR Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2021	A	`conf`	Analysis of evolutionary diversity optimisation for permutation problems. GECCO Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. GECCO Jakob Bossek, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation. CoRR Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. FOGA Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. GECCO Aneta Neumann, Jakob Bossek, Frank Neumann
2021	J	`jnl`	Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. CoRR Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. GECCO Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A	`conf`	Evolutionary diversity optimization and the minimum spanning tree problem. GECCO Jakob Bossek, Frank Neumann
2021	—	`conf`	Evolutionary submodular optimisation. GECCO Companion Aneta Neumann, Frank Neumann, Chao Qian
2021	—	`conf`	Exact Counting and Sampling of Optima for the Knapsack Problem. LION Jakob Bossek, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Exact Counting and Sampling of Optima for the Knapsack Problem. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2021	A*	`conf`	Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. IJCAI Chao Bian, Chao Qian, Frank Neumann, Yang Yu
2021	J	`jnl`	Feature-Based Diversity Optimization for Problem Instance Classification. Evol. Comput. Wanru Gao, Samadhi Nallaperuma, Frank Neumann
2021	B	`conf`	Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CEC Yue Xie, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CoRR Yue Xie, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints. CoRR Yue Xie, Aneta Neumann, Frank Neumann
2021	A	`conf`	Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. GECCO Yue Xie, Aneta Neumann, Frank Neumann
2021	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. Algorithmica Frank Neumann, Mojgan Pourhassan, Carsten Witt
2021	Misc	`conf`	Modelling and optimization of run-of-mine stockpile recovery. SAC Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann
2021	—	`conf`	Novelty particle swarm optimisation for truss optimisation problems. GECCO Companion Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li
2021	J	`jnl`	Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems. CoRR Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li
2021	J	`jnl`	On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR Adel Nikfarjam, Aneta Neumann, Frank Neumann
2021	A*	`conf`	Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints. AAAI Anh Viet Do, Frank Neumann
2021	J	`jnl`	Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. CoRR Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
2021	J	`jnl`	Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers. CoRR Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann
2021	J	`jnl`	Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. CoRR Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2021	J	`jnl`	Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. CoRR Frank Neumann, Carsten Witt
2021	J	`jnl`	Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. Algorithmica Feng Shi, Frank Neumann, Jianxin Wang
2021	A	`conf`	Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. GECCO Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2021	A	`conf`	Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
2021	J	`jnl`	Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem. CoRR Feng Shi, Frank Neumann, Jianxin Wang
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	J	`jnl`	Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem. Theor. Comput. Sci. Feng Shi, Frank Neumann, Jianxin Wang
2020	J	`jnl`	A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization. CoRR Benjamin Doerr, Frank Neumann
2020	—	`ch.`	Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Theory of Evolutionary Computation Frank Neumann, Mojgan Pourhassan, Vahid Roostapour
2020	J	`jnl`	Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. Tobias Friedrich, Timo Kötzing, J. A. Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2020	J	`jnl`	Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems. CoRR Aneta Neumann, Jakob Bossek, Frank Neumann
2020	J	`jnl`	Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2020	J	`jnl`	Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation. Theor. Comput. Sci. Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2020	A	`conf`	Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. ECAI Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. CoRR Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. CoRR Jakob Bossek, Frank Neumann
2020	J	`jnl`	Evolutionary Image Transition and Painting Using Random Walks. CoRR Aneta Neumann, Bradley Alexander, Frank Neumann
2020	J	`jnl`	Evolutionary Image Transition and Painting Using Random Walks. Evol. Comput. Aneta Neumann, Bradley Alexander, Frank Neumann
2020	J	`jnl`	Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. CoRR Vahid Roostapour, Aneta Neumann, Frank Neumann
2020	—	`conf`	Evolutionary computation for digital art. GECCO Companion Aneta Neumann, Frank Neumann
2020	J	`jnl`	Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. CoRR Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann
2020	—	`conf`	Evolving Sampling Strategies for One-Shot Optimization Tasks. PPSN (1) Jakob Bossek, Carola Doerr, Pascal Kerschke, Aneta Neumann, Frank Neumann
2020	A	`conf`	Evolving diverse sets of tours for the travelling salesperson problem. GECCO Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann
2020	—	`conf`	Human Interactive EEG-Based Evolutionary Image Animation. SSCI Aneta Neumann, Frank Neumann
2020	J	`jnl`	Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint. CoRR Frank Neumann, Mojgan Pourhassan, Carsten Witt
2020	—	`conf`	Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms. PPSN (2) Anh Viet Do, Frank Neumann
2020	J	`jnl`	Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms. CoRR Anh Viet Do, Frank Neumann
2020	J	`jnl`	More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits. ECAI Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann
2020	J	`jnl`	Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits. CoRR Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann
2020	A	`conf`	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan
2020	J	`jnl`	Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms. CoRR Aneta Neumann, Frank Neumann
2020	—	`conf`	Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. PPSN (1) Aneta Neumann, Frank Neumann
2020	—	`conf`	Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. PPSN (1) Jakob Bossek, Aneta Neumann, Frank Neumann
2020	J	`jnl`	Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. CoRR Jakob Bossek, Aneta Neumann, Frank Neumann
2020	A*	`conf`	Optimization of Chance-Constrained Submodular Functions. AAAI Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2020	J	`jnl`	Parameterized Complexity Analysis of Randomized Search Heuristics. CoRR Frank Neumann, Andrew M. Sutton
2020	—	`ch.`	Parameterized Complexity Analysis of Randomized Search Heuristics. Theory of Evolutionary Computation Frank Neumann, Andrew M. Sutton
2020	J	`jnl`	Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints. CoRR Anh Viet Do, Frank Neumann
2020	J	`jnl`	Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions. Appl. Soft Comput. Behrooz Ghasemishabankareh, Xiaodong Li, Melih Ozlen, Frank Neumann
2020	J	`jnl`	Robust Fitting in Computer Vision: Easy or Hard? Int. J. Comput. Vis. Tat-Jun Chin, Zhipeng Cai, Frank Neumann
2020	J	`jnl`	Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. CoRR Vahid Roostapour, Jakob Bossek, Frank Neumann
2020	J	`jnl`	Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. CoRR Feng Shi, Frank Neumann, Jianxin Wang
2020	J	`jnl`	Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem. Theor. Comput. Sci. Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2020	A	`conf`	Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. GECCO Vahid Roostapour, Jakob Bossek, Frank Neumann
2020	J	`jnl`	Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR Yue Xie, Aneta Neumann, Frank Neumann
2020	A	`conf`	Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. GECCO Yue Xie, Aneta Neumann, Frank Neumann
2020	—	`conf`	The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms. ICONIP (5) Ragav Sachdeva, Frank Neumann, Markus Wagner
2020	J	`jnl`	The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms. CoRR Ragav Sachdeva, Frank Neumann, Markus Wagner
2020	J	`jnl`	The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. CoRR Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
2020	A	`conf`	The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. GECCO Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann
2020	—	`book`	Theory of Evolutionary Computation - Recent Developments in Discrete Optimization Theory of Evolutionary Computation Benjamin Doerr, Frank Neumann
2020	—	`conf`	Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation. SSCI Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann
2020	J	`jnl`	Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation. CoRR Maryam Hasani-Shoreh, Renato Hermoza Aragonés, Frank Neumann
2020	B	`conf`	Who's in the Gang? Revealing Coordinating Communities in Social Media. ASONAM Derek Weber, Frank Neumann
2020	J	`jnl`	Who's in the Gang? Revealing Coordinating Communities in Social Media. CoRR Derek Weber, Frank Neumann
2019	J	`jnl`	A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. CoRR Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann
2019	J	`jnl`	Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem. CoRR Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2019	A	`conf`	Analysis of baseline evolutionary algorithms for the packing while travelling problem. FOGA Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2019	J	`jnl`	Automated Algorithm Selection: Survey and Perspectives. Evol. Comput. Pascal Kerschke, Holger H. Hoos, Frank Neumann, Heike Trautmann
2019	J	`jnl`	Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann
2019	—	`ch.`	Evolutionary Computation for Multicomponent Problems: Opportunities and Future Directions. Optimization in Industry Mohammad Reza Bonyadi, Zbigniew Michalewicz, Markus Wagner, Frank Neumann
2019	A	`conf`	Evolutionary algorithms for the chance-constrained knapsack problem. GECCO Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann
2019	—	`conf`	Evolutionary computation for digital art. GECCO (Companion) Aneta Neumann, Frank Neumann
2019	A	`conf`	Evolutionary diversity optimization using multi-objective indicators. GECCO Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann
2019	A*	`conf`	Evolving Solutions to Community-Structured Satisfiability Formulas. AAAI Frank Neumann, Andrew M. Sutton
2019	A	`conf`	Evolving diverse TSP instances by means of novel and creative mutation operators. FOGA Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann
2019	J	`jnl`	Fast Re-Optimization via Structural Diversity. CoRR Benjamin Doerr, Carola Doerr, Frank Neumann
2019	A	`conf`	Fast re-optimization via structural diversity. GECCO Benjamin Doerr, Carola Doerr, Frank Neumann
2019	J	`jnl`	Foreword. Evol. Comput. Holger H. Hoos, Frank Neumann, Heike Trautmann
2019	A*	`conf`	Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
2019	A	`conf`	Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. GECCO Frank Neumann, Mojgan Pourhassan, Carsten Witt
2019	J	`jnl`	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan
2019	J	`jnl`	On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints. CoRR Maryam Hasani-Shoreh, Maria Yaneli Ameca-Alducin, Wilson Blaikie, Frank Neumann, Marc Schoenauer
2019	—	`conf`	On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization. ICONIP (1) Maryam Hasani-Shoreh, Frank Neumann
2019	J	`jnl`	On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization. CoRR Maryam Hasani-Shoreh, Frank Neumann
2019	A	`conf`	On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem. GECCO Jakob Bossek, Christian Grimme, Frank Neumann
2019	J	`jnl`	One-Shot Decision-Making with and without Surrogates. CoRR Jakob Bossek, Pascal Kerschke, Aneta Neumann, Frank Neumann, Carola Doerr
2019	J	`jnl`	Optimization of Chance-Constrained Submodular Functions. CoRR Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2019	J	`jnl`	Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. Evol. Comput. Mojgan Pourhassan, Feng Shi, Frank Neumann
2019	A*	`conf`	Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2019	J	`jnl`	Quasi-random Image Transition and Animation. Aust. J. Intell. Inf. Process. Syst. Aneta Neumann, Frank Neumann, Tobias Friedrich
2019	J	`jnl`	Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2019	C	`conf`	Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees. EMO Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2019	J	`jnl`	Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem. CoRR Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2019	A	`conf`	Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. FOGA Feng Shi, Frank Neumann, Jianxin Wang
2019	A	`conf`	Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2019	A	`conf`	Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. FOGA Frank Neumann, Andrew M. Sutton
2019	J	`jnl`	Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem. Evol. Comput. Mojgan Pourhassan, Frank Neumann
2018	B	`conf`	A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems. CEC Maria Yaneli Ameca-Alducin, Maryam Hasani-Shoreh, Wilson Blaikie, Frank Neumann, Efrén Mezura-Montes
2018	J	`jnl`	A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems. CoRR Maria Yaneli Ameca-Alducin, Maryam Hasani-Shoreh, Wilson Blaikie, Frank Neumann, Efrén Mezura-Montes
2018	—	`conf`	A Fully Polynomial Time Approximation Scheme for Packing While Traveling. ALGOCLOUD Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu
2018	—	`conf`	A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems. PPSN (1) Behrooz Ghasemishabankareh, Melih Ozlen, Frank Neumann, Xiaodong Li
2018	J	`jnl`	Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. CoRR Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
2018	J	`jnl`	Automated Algorithm Selection: Survey and Perspectives. CoRR Pascal Kerschke, Holger H. Hoos, Frank Neumann, Heike Trautmann
2018	J	`jnl`	Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation. CoRR Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2018	J	`jnl`	Discrepancy-based Evolutionary Diversity Optimization. CoRR Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner
2018	A	`conf`	Discrepancy-based evolutionary diversity optimization. GECCO Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner
2018	J	`jnl`	Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem. CoRR Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann
2018	J	`jnl`	Evolutionary Diversity Optimization Using Multi-Objective Indicators. CoRR Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann
2018	—	`conf`	Evolutionary computation for digital art. GECCO (Companion) Aneta Neumann, Frank Neumann
2018	A	`conf`	Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. GECCO Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann
2018	J	`jnl`	Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
2018	—	`conf`	On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. PPSN (1) Vahid Roostapour, Aneta Neumann, Frank Neumann
2018	B	`conf`	On the Use of Colour-Based Segmentation in Evolutionary Image Composition. CEC Aneta Neumann, Frank Neumann
2018	B	`conf`	On the Use of Repair Methods in Differential Evolution for Dynamic Constrained Optimization. EvoApplications Maria Yaneli Ameca-Alducin, Maryam Hasani-Shoreh, Frank Neumann
2018	J	`jnl`	Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2018	A	`conf`	Randomized greedy algorithms for covering problems. GECCO Wanru Gao, Tobias Friedrich, Frank Neumann, Christian Hercher
2018	—	`conf`	Robust Fitting in Computer Vision: Easy or Hard? ECCV (12) Tat-Jun Chin, Zhipeng Cai, Frank Neumann
2018	J	`jnl`	Robust Fitting in Computer Vision: Easy or Hard? CoRR Tat-Jun Chin, Zhipeng Cai, Frank Neumann
2018	—	`conf`	Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. PPSN (2) Frank Neumann, Andrew M. Sutton
2018	A	`conf`	Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. GECCO Feng Shi, Frank Neumann, Jianxin Wang
2017	J	`jnl`	A Fully Polynomial Time Approximation Scheme for Packing While Traveling. CoRR Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu
2017	J	`jnl`	Ahura: A Heuristic-Based Racer for the Open Racing Car Simulator. IEEE Trans. Comput. Intell. AI Games Mohammad Reza Bonyadi, Zbigniew Michalewicz, Samadhi Nallaperuma, Frank Neumann
2017	A	`conf`	Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2017	J	`jnl`	Evolutionary Image Composition Using Feature Covariance Matrices. CoRR Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann
2017	C	`conf`	Evolutionary Image Transition Using Random Walks. EvoMUSART Aneta Neumann, Bradley Alexander, Frank Neumann
2017	A	`conf`	Evolutionary image composition using feature covariance matrices. GECCO Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann
2017	—	`conf`	Exact Approaches for the Travelling Thief Problem. SEAL Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann
2017	J	`jnl`	Exact Approaches for the Travelling Thief Problem. CoRR Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann
2017	J	`jnl`	Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. Evol. Comput. Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt
2017	—	`conf`	Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem. SSCI Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
2017	A	`conf`	On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA Mojgan Pourhassan, Tobias Friedrich, Frank Neumann
2017	—	`conf`	Parameterized analysis of bio-inspired computing. SSCI Frank Neumann
2017	J	`jnl`	Quasi-random Agents for Image Transition and Animation. CoRR Aneta Neumann, Frank Neumann, Tobias Friedrich
2017	A	`conf`	Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	—	`conf`	Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence Wanru Gao, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	A	`conf`	Speeding up evolutionary multi-objective optimisation through diversity-based parent selection. GECCO Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2017	J	`jnl`	The Packing While Traveling Problem. Eur. J. Oper. Res. Sergey Polyakovskiy, Frank Neumann
2017	J	`jnl`	Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2017	A*	`conf`	What's Hot in Evolutionary Computation. AAAI Tobias Friedrich, Frank Neumann
2016	J	`jnl`	A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous Optimisation. CoRR Shayan Poursoltan, Frank Neumann
2016	J	`jnl`	A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. Evol. Comput. Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan
2016	J	`jnl`	Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412). Dagstuhl Reports Holger H. Hoos, Frank Neumann, Heike Trautmann
2016	J	`jnl`	Evolutionary Image Transition Based on Theoretical Insights of Random Processes. CoRR Aneta Neumann, Bradley Alexander, Frank Neumann
2016	J	`jnl`	Evolutionary computation for multicomponent problems: opportunities and future directions. CoRR Mohammad Reza Bonyadi, Zbigniew Michalewicz, Frank Neumann, Markus Wagner
2016	A	`conf`	Fast Building Block Assembly by Majority Vote Crossover. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck
2016	A	`conf`	Fast and Effective Optimisation of Arrays of Submerged Wave Energy Converters. GECCO Junhua Wu, Slava Shekh, Nataliia Y. Sergiienko, Benjamin S. Cazzolato, Boyin Ding, Frank Neumann, Markus Wagner
2016	A	`conf`	Feature-Based Diversity Optimization for Problem Instance Classification. PPSN Wanru Gao, Samadhi Nallaperuma, Frank Neumann
2016	B	`conf`	Feature-based algorithm selection for constrained continuous optimisation. CEC Frank Neumann, Shayan Poursoltan
2016	A	`conf`	Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. PPSN Wanru Gao, Tobias Friedrich, Frank Neumann
2016	—	`ed.`	Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings GECCO (Companion) Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	A*	`conf`	Guaranteed Outlier Removal with Mixed Integer Linear Programs. CVPR Tat-Jun Chin, Yang Heng Kee, Anders P. Eriksson, Frank Neumann
2016	A	`conf`	On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. GECCO Junhua Wu, Sergey Polyakovskiy, Frank Neumann
2016	A	`conf`	Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. PPSN Mojgan Pourhassan, Feng Shi, Frank Neumann
2016	J	`jnl`	Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. CoRR Mojgan Pourhassan, Feng Shi, Frank Neumann
2016	A	`ed.`	Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016 GECCO Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	A	`conf`	Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. GECCO Benjamin Doerr, Wanru Gao, Frank Neumann
2016	J	`jnl`	Solving hard control problems in voting systems via integer programming. Eur. J. Oper. Res. Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
2016	—	`conf`	The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. ICONIP (3) Aneta Neumann, Bradley Alexander, Frank Neumann
2016	J	`jnl`	The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. CoRR Aneta Neumann, Bradley Alexander, Frank Neumann
2015	—	`conf`	A Feature-Based Analysis on the Impact of Set of Constraints for \varepsilon -Constrained Differential Evolution. ICONIP (3) Shayan Poursoltan, Frank Neumann
2015	J	`jnl`	A Feature-Based Analysis on the Impact of Set of Constraints for e-Constrained Differential Evolution. CoRR Shayan Poursoltan, Frank Neumann
2015	—	`conf`	A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation. ICONIP (3) Shayan Poursoltan, Frank Neumann
2015	J	`jnl`	A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation. CoRR Shayan Poursoltan, Frank Neumann
2015	J	`jnl`	Analyzing the Effects of Instance Features and Algorithm Parameters for Max-Min Ant System and the Traveling Salesperson Problem. Frontiers Robotics AI Samadhi Nallaperuma, Markus Wagner, Frank Neumann
2015	J	`jnl`	Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. Markus Wagner, Karl Bringmann, Tobias Friedrich, Frank Neumann
2015	J	`jnl`	Feature-Based Diversity Optimization for Problem Instance Classification. CoRR Wanru Gao, Samadhi Nallaperuma, Frank Neumann
2015	A	`conf`	Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2015	A	`conf`	Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms. GECCO Mojgan Pourhassan, Wanru Gao, Frank Neumann
2015	J	`jnl`	Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evol. Comput. Tobias Friedrich, Frank Neumann
2015	J	`jnl`	Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evol. Comput. Tobias Friedrich, Frank Neumann, Christian Thyssen
2015	A	`conf`	On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem. GECCO Mojgan Pourhassan, Frank Neumann
2015	J	`jnl`	On the Performance of Different Genetic Programming Approaches for the SORTING Problem. Evol. Comput. Markus Wagner, Frank Neumann, Tommaso Urli
2015	A*	`conf`	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. IJCAI Frank Neumann, Carsten Witt
2015	J	`jnl`	On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. CoRR Frank Neumann, Carsten Witt
2015	J	`jnl`	Optimising Spatial and Tonal Data for PDE-based Inpainting. CoRR Laurent Hoeltgen, Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Simon Setzer, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2015	B	`conf`	Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CPAIOR Sergey Polyakovskiy, Frank Neumann
2015	—	`conf`	Parameterized Complexity Analysis of Evolutionary Algorithms. GECCO (Companion) Frank Neumann, Andrew M. Sutton
2015	J	`jnl`	Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theor. Comput. Sci. Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
2015	—	`conf`	Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem. GECCO (Companion) Wanru Gao, Mojgan Pourhassan, Frank Neumann
2015	J	`jnl`	The Packing While Traveling Problem. CoRR Sergey Polyakovskiy, Frank Neumann
2014	B	`conf`	A Feature-based analysis on the impact of linear constraints for ε-constrained differential evolution. IEEE Congress on Evolutionary Computation Shayan Poursoltan, Frank Neumann
2014	J	`jnl`	A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. CoRR Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan
2014	A	`conf`	A comprehensive benchmark set and heuristics for the traveling thief problem. GECCO Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann
2014	A	`conf`	A fixed budget analysis of randomized search heuristics for the traveling salesperson problem. GECCO Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt
2014	J	`jnl`	Computational Intelligence for Software Engineering (NII Shonan Meeting 2014-13). NII Shonan Meet. Rep. Hong Mei, Frank Neumann, Xin Yao, Leandro L. Minku
2014	A	`conf`	EVOR: an online evolutionary algorithm for car racing games. GECCO Samadhi Nallaperuma, Frank Neumann, Mohammad Reza Bonyadi, Zbigniew Michalewicz
2014	J	`jnl`	Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation. IEEE Trans. Evol. Comput. Frank Neumann, Benjamin Doerr, Per Kristian Lehre, Pauline C. Haddow
2014	A	`conf`	Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. PPSN Tobias Friedrich, Frank Neumann
2014	—	`conf`	On the Impact of Utility Functions in Interactive Evolutionary Multi-objective Optimization. SEAL Frank Neumann, Anh Quang Nguyen
2014	J	`jnl`	Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CoRR Sergey Polyakovskiy, Frank Neumann
2014	A	`conf`	Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem. PPSN Samadhi Nallaperuma, Markus Wagner, Frank Neumann
2014	J	`jnl`	Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evol. Comput. Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma
2014	—	`conf`	Parameterized complexity analysis of evolutionary algorithms. GECCO (Companion) Frank Neumann, Andrew M. Sutton
2014	A	`conf`	Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. PPSN Andrew M. Sutton, Frank Neumann
2014	A	`conf`	Runtime analysis for maximizing population diversity in single-objective optimization. GECCO Wanru Gao, Frank Neumann
2014	B	`conf`	Single- and multi-objective genetic programming: New runtime results for sorting. IEEE Congress on Evolutionary Computation Markus Wagner, Frank Neumann
2014	J	`jnl`	Solving Hard Control Problems in Voting Systems via Integer Programming. CoRR Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
2014	J	`jnl`	The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2014	—	`conf`	User Preferences for Approximation-Guided Multi-objective Evolution. SEAL Anh Quang Nguyen, Markus Wagner, Frank Neumann
2013	A	`conf`	A fast approximation-guided evolutionary multi-objective algorithm. GECCO Markus Wagner, Frank Neumann
2013	A	`conf`	A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem. FOGA Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, Heike Trautmann
2013	J	`jnl`	A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, Frank Neumann
2013	—	`conf`	Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings. GECCO (Companion) Samadhi Nallaperuma, Markus Wagner, Frank Neumann
2013	—	`conf`	Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) Frank Neumann, Carsten Witt
2013	J	`jnl`	Evolutionary Algorithms and Dynamic Programming CoRR Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen
2013	A	`conf`	Fast and effective multi-objective optimisation of wind turbine placement. GECCO Raymond Tran, Junhua Wu, Christopher Denison, Thomas Ackling, Markus Wagner, Frank Neumann
2013	J	`jnl`	Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem. Algorithmica Stefan Kratsch, Frank Neumann
2013	B	`conf`	Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
2013	A	`ed.`	Foundations of Genetic Algorithms XII, FOGA '13, Adelaide, SA, Australia, January 16-20, 2013 FOGA Frank Neumann, Kenneth A. De Jong
2013	J	`jnl`	More effective crossover operators for the all-pairs shortest path problem. Theor. Comput. Sci. Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2013	J	`jnl`	Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. CoRR Tobias Friedrich, Frank Neumann, Christian Thyssen
2013	B	`conf`	Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
2013	A	`conf`	Population size matters: rigorous runtime results for maximizing the hypervolume indicator. GECCO Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
2013	A	`conf`	The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. GECCO Dogan Corus, Per Kristian Lehre, Frank Neumann
2013	J	`jnl`	Weighted preferences in evolutionary multi-objective optimization. Int. J. Mach. Learn. Cybern. Tobias Friedrich, Trent Kroeger, Frank Neumann
2012	J	`jnl`	A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines CoRR Markus Wagner, Jareth Day, Frank Neumann
2012	J	`jnl`	A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem CoRR Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Frank Neumann
2012	J	`jnl`	A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem CoRR Andrew M. Sutton, Frank Neumann
2012	A*	`conf`	A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI Andrew M. Sutton, Frank Neumann
2012	—	`conf`	A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) Andrew M. Sutton, Frank Neumann
2012	A	`conf`	A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO Andrew M. Sutton, Jareth Day, Frank Neumann
2012	B	`conf`	An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives. IEEE Congress on Evolutionary Computation Joseph Yuen, Sophia Gao, Markus Wagner, Frank Neumann
2012	—	`conf`	Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. GECCO (Companion) Frank Neumann, Carsten Witt
2012	J	`jnl`	Computational Complexity Analysis of Multi-Objective Genetic Programming CoRR Frank Neumann
2012	A	`conf`	Computational complexity analysis of multi-objective genetic programming. GECCO Frank Neumann
2012	J	`jnl`	Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. Rudolf Berghammer, Tobias Friedrich, Frank Neumann
2012	J	`jnl`	Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation". Theor. Comput. Sci. Per Kristian Lehre, Frank Neumann, Jonathan E. Rowe, Xin Yao
2012	—	`conf`	Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics. PPSN (1) Tommaso Urli, Markus Wagner, Frank Neumann
2012	—	`conf`	Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. LION Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann
2012	J	`jnl`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem CoRR Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2012	B	`conf`	Optimizing energy output and layout costs for large wind farms using particle swarm optimization. IEEE Congress on Evolutionary Computation Kalyan Veeramachaneni, Markus Wagner, Una-May O'Reilly, Frank Neumann
2012	—	`conf`	Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations. PPSN (1) Markus Wagner, Frank Neumann
2012	A	`conf`	The max problem revisited: the importance of mutation in genetic programming. GECCO Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2012	J	`jnl`	Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intell. Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2011	A*	`conf`	Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner
2011	J	`jnl`	Computational Complexity Results for Genetic Programming and the Sorting Problem CoRR Markus Wagner, Frank Neumann
2011	A	`conf`	Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. FOGA Greg Durrett, Frank Neumann, Una-May O'Reilly
2011	—	`conf`	Computational complexity and evolutionary computation. GECCO (Companion) Thomas Jansen, Frank Neumann
2011	J	`jnl`	Computing Minimum Cuts by Randomized Search Heuristics. Algorithmica Frank Neumann, Joachim Reichel, Martin Skutella
2011	J	`jnl`	Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen
2011	J	`jnl`	Evolving Pacing Strategies for Team Pursuit Track Cycling CoRR Markus Wagner, Jareth Day, Claire Diora Jordan, Trent Kroeger, Frank Neumann
2011	—	`conf`	Foundations of evolutionary multi-objective optimization. GECCO (Companion) Tobias Friedrich, Frank Neumann
2011	J	`jnl`	Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. Tobias Friedrich, Christian Horoba, Frank Neumann
2011	A	`conf`	On the effectiveness of crossover for migration in parallel evolutionary algorithms. GECCO Frank Neumann, Pietro S. Oliveto, Günter Rudolph, Dirk Sudholt
2011	—	`conf`	Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. SSVM Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr
2011	A	`conf`	PAC learning and genetic programming. GECCO Timo Kötzing, Frank Neumann, Reto Spöhel
2011	J	`jnl`	Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation CoRR Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner
2011	J	`jnl`	Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2011	A	`conf`	Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2011	—	`conf`	Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence Tobias Friedrich, Trent Kroeger, Frank Neumann
2010	A	`conf`	A few ants are enough: ACO with iteration-best update. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2010	J	`jnl`	Ant Colony Optimization and the minimum spanning tree problem. Theor. Comput. Sci. Frank Neumann, Carsten Witt
2010	A	`conf`	Ant colony optimization and the minimum cut problem. GECCO Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro S. Oliveto
2010	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2010	—	`ch.`	Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization. Advances in Multi-Objective Nature Inspired Computing Christian Horoba, Frank Neumann
2010	—	`book`	Bioinspired Computation in Combinatorial Optimization Bioinspired Computation in Combinatorial Optimization Frank Neumann, Carsten Witt
2010	J	`jnl`	Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics CoRR Greg Durrett, Frank Neumann, Una-May O'Reilly
2010	—	`conf`	Computational complexity and evolutionary computation. GECCO (Companion) Thomas Jansen, Frank Neumann
2010	J	`jnl`	Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Evol. Comput. Thomas Jansen, Frank Neumann
2010	J	`jnl`	Editorial. Algorithmica Benjamin Doerr, Frank Neumann, Ingo Wegener
2010	—	`conf`	Evolving Fuzzy Rules: Evaluation of a New Approach. SEAL Adam Ghandar, Zbigniew Michalewicz, Frank Neumann
2010	—	`conf`	Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. PPSN (1) Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto
2010	—	`conf`	Foundations of evolutionary multi-objective optimization. GECCO (Companion) Tobias Friedrich, Frank Neumann
2010	—	`conf`	How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. PPSN (1) Frank Neumann, Madeleine Theile
2010	J	`jnl`	In Memoriam: Ingo Wegener. Algorithmica Benjamin Doerr, Frank Neumann
2010	—	`conf`	More Effective Crossover Operators for the All-Pairs Shortest Path Problem. PPSN (1) Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile
2010	—	`conf`	Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. PPSN (1) Süntje Böttcher, Benjamin Doerr, Frank Neumann
2010	J	`jnl`	Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2010	A	`conf`	Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO Rudolf Berghammer, Tobias Friedrich, Frank Neumann
2010	J	`jnl`	Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions CoRR Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2010	—	`conf`	Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. ANTS Conference Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt
2010	J	`jnl`	When to use bit-wise neutrality. Nat. Comput. Tobias Friedrich, Frank Neumann
2009	A	`conf`	Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. FOGA Christian Horoba, Frank Neumann
2009	J	`jnl`	Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2009	J	`jnl`	Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intell. Frank Neumann, Dirk Sudholt, Carsten Witt
2009	J	`jnl`	Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2009	—	`ch.`	Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Innovations in Swarm Intelligence Frank Neumann, Dirk Sudholt, Carsten Witt
2009	—	`conf`	Computational complexity and evolutionary computation. GECCO (Companion) Thomas Jansen, Frank Neumann
2009	A	`conf`	Computing single source shortest paths using single-objective fitness. FOGA Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2009	A	`conf`	Evolutionary algorithms and dynamic programming. GECCO Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile
2009	A	`conf`	Fixed-parameter evolutionary algorithms and the vertex cover problem. GECCO Stefan Kratsch, Frank Neumann
2009	A	`conf`	Multiplicative approximations and the hypervolume indicator. GECCO Tobias Friedrich, Christian Horoba, Frank Neumann
2009	J	`jnl`	On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evol. Comput. Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
2009	J	`jnl`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Algorithmica Frank Neumann, Carsten Witt
2009	A	`conf`	Theoretical analysis of fitness-proportional selection: landscapes and efficiency. GECCO Frank Neumann, Pietro S. Oliveto, Carsten Witt
2009	B	`conf`	Theoretical analysis of rank-based mutation - combining exploration and exploitation. IEEE Congress on Evolutionary Computation Pietro S. Oliveto, Per Kristian Lehre, Frank Neumann
2008	A	`conf`	Analyzing Hypervolume Indicator Based Algorithms. PPSN Dimo Brockhoff, Tobias Friedrich, Frank Neumann
2008	A	`conf`	Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. PPSN Frank Neumann, Joachim Reichel
2008	A	`conf`	Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. GECCO Christian Horoba, Frank Neumann
2008	—	`ch.`	Can Single-Objective Optimization Profit from Multiobjective Optimization? Multiobjective Problem Solving from Nature Frank Neumann, Ingo Wegener
2008	—	`conf`	Computational complexity and evolutionary computation. GECCO (Companion) Thomas Jansen, Frank Neumann
2008	A	`conf`	Computing minimum cuts by randomized search heuristics. GECCO Frank Neumann, Joachim Reichel, Martin Skutella
2008	J	`jnl`	Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Comput. Oper. Res. Frank Neumann
2008	A	`conf`	Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. PPSN Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann
2008	—	`conf`	Multi-objective Problems in Terms of Relational Algebra. RelMiCS Florian Diedrich, Britta Kehden, Frank Neumann
2008	—	`conf`	Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference Frank Neumann, Dirk Sudholt, Carsten Witt
2008	A	`conf`	Rigorous analyses of fitness-proportional selection for optimizing linear functions. GECCO Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann
2008	A	`conf`	Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN Tobias Friedrich, Christian Horoba, Frank Neumann
2008	B	`conf`	Using fast matrix multiplication in bio-inspired computation for complex optimization problems. IEEE Congress on Evolutionary Computation Florian Diedrich, Frank Neumann
2008	B	`conf`	When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation Tobias Friedrich, Frank Neumann
2007	B	`conf`	A rigorous view on neutrality. IEEE Congress on Evolutionary Computation Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann
2007	—	`conf`	Ant Colony Optimization and the Minimum Spanning Tree Problem. LION Frank Neumann, Carsten Witt
2007	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electron. Colloquium Comput. Complex. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	A	`conf`	Approximating covering problems by randomized search heuristics using multi-objective models. GECCO Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
2007	—	`conf`	Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS Frank Neumann, Dirk Sudholt, Carsten Witt
2007	—	`conf`	Computational complexity and evolutionary computation. GECCO (Companion) Thomas Jansen, Frank Neumann
2007	A	`conf`	Do additional objectives make a problem harder? GECCO Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
2007	J	`jnl`	Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. Eur. J. Oper. Res. Frank Neumann
2007	B	`conf`	On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	A	`conf`	On the runtime analysis of the 1-ANT ACO algorithm. GECCO Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2007	B	`conf`	Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2007	J	`jnl`	Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. Frank Neumann, Ingo Wegener
2007	A	`conf`	Rigorous analyses of simple diversity mechanisms. GECCO Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2007	J	`jnl`	Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Evol. Comput. Benjamin Doerr, Nils Hebbinghaus, Frank Neumann
2006	B	`conf`	A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. EvoCOP Britta Kehden, Frank Neumann
2006	J	`jnl`	Ant Colony Optimization and the Minimum Spanning Tree Problem. Electron. Colloquium Comput. Complex. Frank Neumann, Carsten Witt
2006	J	`jnl`	Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. Frank Neumann, Ingo Wegener
2006	—	`conf`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Theory of Evolutionary Algorithms Frank Neumann, Carsten Witt
2006	B	`conf`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. ISAAC Frank Neumann, Carsten Witt
2006	J	`jnl`	Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Electron. Colloquium Comput. Complex. Frank Neumann, Carsten Witt
2006	A	`conf`	Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. PPSN Benjamin Doerr, Nils Hebbinghaus, Frank Neumann
2006	B	`conf`	Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. LATIN Frank Neumann, Marco Laumanns
2006	J	`jnl`	Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Electron. Colloquium Comput. Complex. Nils Hebbinghaus, Benjamin Doerr, Frank Neumann
2005	—	`—`	Combinatorial optimization and the analysis of randomized search heuristics. Frank Neumann
2005	A	`conf`	Minimum spanning trees made easier via multi-objective optimization. GECCO Frank Neumann, Ingo Wegener
2005	B	`conf`	RelView - An OBDD-Based Computer Algebra System for Relations. CASC Rudolf Berghammer, Frank Neumann
2005	—	`conf`	Relational Implementation of Simple Parallel Evolutionary Algorithms. RelMiCS Britta Kehden, Frank Neumann, Rudolf Berghammer
2005	J	`jnl`	Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization Electron. Colloquium Comput. Complex. Frank Neumann, Marco Laumanns
2004	A	`conf`	Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. PPSN Frank Neumann
2004	B	`conf`	Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. IEEE Congress on Evolutionary Computation Frank Neumann
2004	—	`conf`	Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) Frank Neumann, Ingo Wegener