PPaperPicks

Andre Opris

17 papers at tracked venues · 2 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. 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
  2. Hot of the Press: Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
  3. Hot of the Press: Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
  4. Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
    GECCO 2026 · Andre Opris
  5. Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
  6. SPEA2+: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees
  7. Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
    AAAI 2026 · Andre Opris
  8. Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
    GECCO 2026 · Andre Opris
  9. A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
    IJCAI 2025 · Andre Opris
  10. A Many-Objective Problem Where Crossover Is Provably Indispensable
    AAAI 2025 · Andre Opris
  11. A Many-Objective Problem Where Crossover is Provably Indispensable
    GECCO 2025 · Andre Opris
  12. A Royal Road Function for Permutation Spaces: an Example Where Order Crossover is Provably Essential
    GECCO 2025 · Andre Opris
  13. Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem
  14. Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
  15. Why Dominance Is Not Enough: Lessons from Practical Evolutionary Multi-Objective Algorithms
  16. Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms
  17. On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently