PACE Solver Description: DreyFVS. - Gabriel Bathie; Gaétan Berthe; Yoann Coudert-Osmont; David Desobry; Amadeus Reinald; Mathis Rocton (IPEC, 2022)

PACE Solver Description: Touiouidth. - Gaétan Berthe; Yoann Coudert-Osmont; Alexander Dobler; Laure Morelle; Amadeus Reinald; Mathis Rocton (IPEC, 2023)

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training. - Cornelius Brand; Robert Ganian; Mathis Rocton (NeurIPS, 2023)

Twin-Width Meets Feedback Edges and Vertex Integrity. - Jakub Balabán; Robert Ganian; Mathis Rocton (IPEC, 2024)

Computing Twin-Width Parameterized by the Feedback Edge Number. - Jakub Balabán; Robert Ganian; Mathis Rocton (STACS, 2024)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem. - Robert Ganian; Mathis Rocton; Daniel Unterberger (WG, 2024)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs. - Robert Ganian; Liana Khazaliya; Fionn Mc Inerney; Mathis Rocton (ICLR, 2025)

Training One-Dimensional Graph Neural Networks is NP-Hard. - Robert Ganian; Mathis Rocton; Simon Wietheger (ICLR, 2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs. - Maël Dumas; Anthony Perez 001; Mathis Rocton; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2025)