P
PaperPicks
Conferences
Andre Opris
17 papers at tracked venues · 2 at CORE A* · active 2024–2026
DBLP profile ↗
ORCID 0000-0002-7730-7831 ↗
Venues
GECCO
×8
PPSN
×4
IJCAI
×3
AAAI
×2
Frequent coauthors
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
×7
Benjamin Doerr
DBLP profile ↗
ORCID search ↗
×2
Papers
Hot of the Press: A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
GECCO 2026
·
Andre Opris
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 of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
GECCO 2026
·
Benjamin Doerr
DBLP profile ↗
ORCID search ↗
Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
GECCO 2026
·
Andre Opris
Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
PPSN 2026
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
SPEA2+: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees
PPSN 2026
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
AAAI 2026
·
Andre Opris
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
GECCO 2026
·
Andre Opris
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
IJCAI 2025
·
Andre Opris
A Many-Objective Problem Where Crossover Is Provably Indispensable
AAAI 2025
·
Andre Opris
A Many-Objective Problem Where Crossover is Provably Indispensable
GECCO 2025
·
Andre Opris
A Royal Road Function for Permutation Spaces: an Example Where Order Crossover is Provably Essential
GECCO 2025
·
Andre Opris
Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
IJCAI 2025
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
IJCAI 2025
·
Benjamin Doerr
DBLP profile ↗
ORCID search ↗
Why Dominance Is Not Enough: Lessons from Practical Evolutionary Multi-Objective Algorithms
GECCO 2025
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms
PPSN 2024
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗
On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently
PPSN 2024
·
Duc-Cuong Dang
DBLP profile ↗
ORCID search ↗