Andre Opris
Scholar

Andre Opris

Google Scholar ID: KNt_SKQAAAAJ
Assistant Professor, University of Passau
o-minimalityoptimization problemsruntime analysistheory of randomized search
Google Scholar↗
Citations & Impact
All-time
Citations
206
 
H-index
8
 
i10-index
6
 
Publications
20
 
Co-authors
0
 
Contact
No contact links provided.
Publications
7 items
Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
2026
Cited
0
Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
2025
Cited
0
A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
2025
Cited
0
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
2025
Cited
0
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
2025
Cited
0
A Many Objective Problem Where Crossover is Provably Indispensable
2024
Cited
0
Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
2024
Cited
1
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)