Publications: Manuel Sorge

2026

[1]	Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks Robert Ganian, Frank Sommer, Manuel Sorge The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net. Note: to appear [bibtex]

2025

[1]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. [bibtex] [doi]
[2]	The complexity of cluster vertex splitting and company Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann Discrete Applied Mathematics, volume 365, pages 190–207, 2025. [bibtex] [doi]
[3]	Optimal Decision Tree Pruning Revisited: Algorithms and Complexity Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net. [bibtex] [pdf]

2024

[1]

The Complexity of Cluster Vertex Splitting and Company
Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann
Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau, Serge Gaspers, Ralf Klasing, eds.), volume 14519 of LNCS, pages 226–239, 2024, Springer.
[bibtex] [doi]

2023

[1]	On Computing Optimal Tree Ensembles Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR. [bibtex] [pdf]
[2]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. [bibtex] [pdf] [doi]
[3]	The Influence of Dimensions on the Complexity of Computing Decision Trees Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press. [bibtex] [doi]

2022

[1]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. [bibtex] [pdf] [doi]
[2]	Turbocharging Heuristics for Weak Coloring Numbers Alexander Dobler, Manuel Sorge, Anaïs Villedieu European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]

2020

[1]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020. [bibtex] [pdf] [doi]
[2]	Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]