Andre Opris
Orcid: 0000-0002-7730-7831
According to our database1,
Andre Opris
authored at least 24 papers
between 2022 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Achieving Tight O(4<sup>k)</sup> Runtime Bounds on Jump<sub>k</sub> by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity.
Algorithmica, November, 2025
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025
Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025
A Royal Road Function for Permutation Spaces: an Example Where Order Crossover is Provably Essential.
Proceedings of the Genetic and Evolutionary Computation Conference, 2025
Why Dominance Is Not Enough: Lessons from Practical Evolutionary Multi-Objective Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2025
A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy.
Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2025
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025
2024
Dataset, December, 2024
Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem.
CoRR, 2024
A Tight O(4<sup>k</sup>/p<sub>c</sub>) Runtime Bound for a (μ+1) GA on Jump<sub>k</sub> for Realistic Crossover Probabilities.
CoRR, 2024
Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation.
Artif. Intell., 2024
Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
A Tight <i>O</i>(4<i><sup>k</sup>/p<sub>c</sub></i>) Runtime Bound for a (μ+1)GA on Jump<i><sub>k</sub></i> for Realistic Crossover Probabilities.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Hot of the Press: Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
2023
J. Log. Anal., 2023
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022