Publications: Simon Wietheger
2026
| [1] | Fair Correlation Clustering Meets Graph Parameters Proceedings of the 17th Latin American Theoretical Informatics (LATIN 2026), 2026. Note: to appear |
| [2] | Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear |
| [3] | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. |
| [4] | Parameterized Complexity of Efficient Sortation 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
2025
| [1] | A Structural Complexity Analysis of Hierarchical Task Network Planning Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391–4400, 2025, ijcai.org. |
| [2] | Hot off the Press: Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 (Bogdan Filipic, ed.), pages 85–86, 2025, ACM. |
| [3] | Training One-Dimensional Graph Neural Networks is NP-Hard The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
2024
| [1] | 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, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 (Xiaodong Li, Julia Handl, eds.), pages 27–28, 2024, ACM. |
| [2] | Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Heike Trautmann, Tea Tusar, Penousal Machado, Thomas Bäck, eds.), volume 15151 of Lecture Notes in Computer Science, pages 153–168, 2024, Springer. |
AC Admin
Website maintainer