A Strategic Routing Framework and Algorithms for Computing Alternative Paths. - Thomas Bläsius; Maximilian Böther; Philipp Fischbeck; Tobias Friedrich 001; Alina Gries; Falk Hüffner; Otto Kißig; Pascal Lenzner; Louise Molitor; Leon Schiller; Armin Wells; Simon Wietheger (ATMOS, 2020)

Learning Languages with Decidable Hypotheses. - Julian Berger; Maximilian Böther; Vanja Doskoc; Jonathan Gadea Harder; Nicolas Klodt; Timo Kötzing; Winfried Lötzsch; Jannik Peters 001; Leon Schiller; Lars Seifert; Armin Wells; Simon Wietheger (CiE, 2021)

Fixed-Parameter Sensitivity Oracles. - Davide Bilò; Katrin Casel; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Martin Schirneck; Simon Wietheger (ITCS, 2022)

Tool support for the teaching of state-based behavior modeling. - Christian Zöllner 002; Christian M. Adriano; Simon Wietheger; Leen Lambers; Holger Giese (MoDELS (Companion), 2022)

Fair Correlation Clustering in Forests. - Katrin Casel; Tobias Friedrich 001; Martin Schirneck; Simon Wietheger (FORC, 2023)

The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. - Sacha Cerf; Benjamin Doerr; Benjamin Hebras; Yakob Kahane; Simon Wietheger (IJCAI, 2023)

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). - Simon Wietheger; Benjamin Doerr (IJCAI, 2023)

Crossover for Cardinality Constrained Optimization. - Tobias Friedrich 001; Timo Kötzing; Aishwarya Radhakrishnan; Leon Schiller; Martin Schirneck; Georg Tennigkeit; Simon Wietheger (ACM Trans. Evol. Learn. Optim., 2023)

Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem. - Sacha Cerf; Benjamin Doerr; Benjamin Hebras; Yakob Kahane; Simon Wietheger (GECCO Companion, 2024)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms. - Simon Wietheger; Benjamin Doerr (PPSN (4), 2024)

Maps for learning indexable classes. - Julian Berger; Maximilian Böther; Vanja Doskoc; Jonathan Gadea Harder; Nicolas Klodt; Timo Kötzing; Winfried Lötzsch; Jannik Peters 001; Leon Schiller; Lars Seifert; Armin Wells; Simon Wietheger (Comput., 2024)

The Boundaries of Tractability in Hierarchical Task Network Planning. - Cornelius Brand; Robert Ganian; Fionn Mc Inerney; Simon Wietheger (CoRR, 2024)

Parameterized Complexity of Efficient Sortation. - Robert Ganian; Hung P. Hoang 001; Simon Wietheger (CoRR, 2024)

Training One-Dimensional Graph Neural Networks is NP-Hard. - Robert Ganian; Mathis Rocton; Simon Wietheger (ICLR, 2025)