Publications: Mathis Teva Rocton

⬅️ Zurück zum Profil


2026

[1]Computing Twin-Width via Treedepth and Vertex Integrity
Robert Ganian, Mathis Rocton
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen, eds.), volume 364 of LIPIcs, pages 42:1–42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2025

[1]Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
Jakub Balabán, Robert Ganian, Mathis Rocton
SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025.
[bibtex] [pdf] [doi]
[2]PACE Solver Description: Bad Dominating Set Maker
Alexander Dobler, Simon Dominik Fink, Mathis Rocton
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[3]The Computational Complexity of Positive Non-Clashing Teaching in Graphs
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
[bibtex] [pdf]
[4]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, 2025, OpenReview.net.
[bibtex] [pdf]

2024

[1]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 (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[2]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 (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 220–235, 2024, Springer.
[bibtex] [pdf] [doi]
[3]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 (Édouard Bonnet, Pawel Rzazewski, eds.), volume 321 of LIPIcs, pages 3:1–3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]

2023

[1]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, 2023.
[bibtex]
[2]PACE Solver Description: Touiouidth
Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton
Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 38:1–38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [doi]
AC Admin
AC Admin

Website maintainer