Simon Wietheger

Orcid: 0000-0002-0734-0708

According to our database1, Simon Wietheger authored at least 21 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study.
CoRR, April, 2026

Fair Correlation Clustering Meets Graph Parameters.
CoRR, February, 2026

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy.
CoRR, November, 2025

Speeding Up the NSGA-II via Dynamic Population Sizes.
CoRR, September, 2025

A Structural Complexity Analysis of Hierarchical Task Network Planning.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Training One-Dimensional Graph Neural Networks is NP-Hard.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2025

2024
Parameterized Complexity of Efficient Sortation.
CoRR, 2024

The Boundaries of Tractability in Hierarchical Task Network Planning.
CoRR, 2024

Maps for learning indexable classes.
Comput., 2024

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III).
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 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.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024

2023
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Fair Correlation Clustering in Forests.
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

2022
Tool support for the teaching of state-based behavior modeling.
Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, 2022

Fixed-Parameter Sensitivity Oracles.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Crossover for cardinality constrained optimization.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021
Learning Languages with Decidable Hypotheses.
Proceedings of the Connecting with Computability, 2021

2020
A Strategic Routing Framework and Algorithms for Computing Alternative Paths.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020


  Loading...