P
PaperPicks
Conferences
Aneta Neumann
University of Adelaide, Australia
20 papers at tracked venues · 1 at CORE A* · active 2024–2026
DBLP profile ↗
ORCID 0000-0002-0036-4782 ↗
Homepage ↗
Venues
GECCO
×10
PPSN
×8
AAAI
×1
IJCAI
×1
Frequent coauthors
Denis Antipov
DBLP profile ↗
ORCID search ↗
×3
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
×2
Liam Wigney
DBLP profile ↗
ORCID search ↗
×2
Jan Eube
DBLP profile ↗
ORCID search ↗
×1
Ishara Hewa Pathiranage
DBLP profile ↗
ORCID search ↗
×1
Thilina Pathirage Don
DBLP profile ↗
ORCID search ↗
×1
Frank Neumann
DBLP profile ↗
ORCID search ↗
×1
Saba Sadeghi Ahouei
DBLP profile ↗
ORCID search ↗
×1
Shuaiqun Pan
DBLP profile ↗
ORCID search ↗
×1
Meng Xu
DBLP profile ↗
ORCID search ↗
×1
Johannes Lengler
DBLP profile ↗
ORCID search ↗
×1
Jonathan Gadea Harder
DBLP profile ↗
ORCID search ↗
×1
Papers
Effective Traveling for Metric Instances of the Traveling Thief Problem
PPSN 2026
·
Jan Eube
DBLP profile ↗
ORCID search ↗
Hot of the Press: Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
GECCO 2026
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
Hot off the Press: Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
GECCO 2026
·
Denis Antipov
DBLP profile ↗
ORCID search ↗
Insights from Multi-tasking the EAX Algorithm for the Travelling Salesperson Problem
PPSN 2026
·
Liam Wigney
DBLP profile ↗
ORCID search ↗
On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic Multiple Knapsack Problem under Dynamic Constraints
GECCO 2026
·
Ishara Hewa Pathiranage
DBLP profile ↗
ORCID search ↗
Evolutionary Multitasking for the Scenario-based Travelling Thief Problem
GECCO 2025
·
Thilina Pathirage Don
DBLP profile ↗
ORCID search ↗
Evolutionary computation for stochastic problems
GECCO 2025
·
Frank Neumann
DBLP profile ↗
ORCID search ↗
Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators
GECCO 2025
·
Saba Sadeghi Ahouei
DBLP profile ↗
ORCID search ↗
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
GECCO 2025
·
Shuaiqun Pan
DBLP profile ↗
ORCID search ↗
On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem
GECCO 2025
·
Liam Wigney
DBLP profile ↗
ORCID search ↗
Quality Diversity Genetic Programming for Learning Scheduling Heuristics
GECCO 2025
·
Meng Xu
DBLP profile ↗
ORCID search ↗
Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems
GECCO 2025
·
Johannes Lengler
DBLP profile ↗
ORCID search ↗
Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
IJCAI 2025
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
PPSN 2024
·
Jonathan Gadea Harder
DBLP profile ↗
ORCID search ↗
Evolutionary Multi-objective Diversity Optimization
PPSN 2024
·
Anh Viet Do
DBLP profile ↗
ORCID search ↗
Limited Query Graph Connectivity Test
AAAI 2024
·
Mingyu Guo
DBLP profile ↗
ORCID search ↗
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential
PPSN 2024
·
Denis Antipov
DBLP profile ↗
ORCID search ↗
Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits
PPSN 2024
·
Kokila Kasuni Perera
DBLP profile ↗
ORCID search ↗
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem
PPSN 2024
·
Denis Antipov
DBLP profile ↗
ORCID search ↗
Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
PPSN 2024
·
Xiankun Yan
DBLP profile ↗
ORCID search ↗