Publications: Mathis Teva Rocton

Computing Twin-Width via Treedepth and Vertex Integrity Robert Ganian, Mathis Rocton. 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026
📄 Details

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton. SIAM J. Discret. Math.
📄 Details
Training One-Dimensional Graph Neural Networks is NP-Hard Robert Ganian, Mathis Rocton, Simon Wietheger. The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025
📄 Details

Computing Twin-Width Parameterized by the Feedback Edge Number Jakub Balabán, Robert Ganian, Mathis Rocton. 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France
📄 Details
Twin-Width Meets Feedback Edges and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton. 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom
📄 Details
The Parameterized Complexity Landscape of the Unsplittable Flow Problem Robert Ganian, Mathis Rocton, Daniel Unterberger. Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers
📄 Details

PACE Solver Description: Touiouidth Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton. Parameterized and Exact Computation (IPEC'2023)
📄 Details
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Cornelius Brand, Robert Ganian, Mathis Rocton. Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023
📄 Details