Simon Wietheger

Projektass.(FWF) / MSc

Role

PreDoc Researcher
Algorithms and Complexity, E192-01

Contact

Publications

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms / Wietheger, S., & Doerr, B. (2024). Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. In Parallel Problem Solving from Nature – PPSN XVIII : 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14–18, 2024, Proceedings, Part IV (pp. 153–168). Springer. https://doi.org/10.1007/978-3-031-70085-9_10
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III) / Wietheger, S., & Doerr, B. (2024). A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). In GECCO ’24 Companion: Proceedings of the Genetic and Evolutionary Computation Conference Companion (pp. 63–64). The Association for Computing Machinery. https://doi.org/10.1145/3638530.3664062
Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem / Cerf, S., Doerr, B., Hebras, B., Kahane, Y., & Wietheger, S. (2024). Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. In GECCO ’24 Companion: Proceedings of the Genetic and Evolutionary Computation Conference Companion (pp. 27–28). The Association for Computing Machinery. https://doi.org/10.1145/3638530.3664080