Publications: Mathis Teva Rocton

⬅️ Zurück zum Profil


2026

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

2025

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025.
PACE Solver Description: Bad Dominating Set Maker
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal and Erik Jan van Leeuwen), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
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

Computing Twin-Width Parameterized by the Feedback Edge Number
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff and Mamadou Moustapha Kanté and Orna Kupferman and Daniel Lokshtanov), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Twin-Width Meets Feedback Edges and Vertex Integrity
19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (Édouard Bonnet and Pawel Rzazewski), volume 321 of LIPIcs, pages 3:1–3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král and Martin Milanic), volume 14760 of Lecture Notes in Computer Science, pages 220–235, 2024, Springer.

2023

PACE Solver Description: Touiouidth
Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra and Magnus Wahlström), volume 285 of LIPIcs, pages 38:1–38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
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.
AC Admin
AC Admin

Website maintainer