Mathis Rocton
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
5
Venues
3
Active years
2024–2026
Best venue rank
A*
Where they publish
Papers
5 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STACS | Computing Twin-Width via Treedepth and Vertex Integrity. | Robert Ganian, Mathis Rocton |
| 2025 | ICLR | The Computational Complexity of Positive Non-Clashing Teaching in Graphs. | Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton |
| 2025 | ICLR | Training One-Dimensional Graph Neural Networks is NP-Hard. | Robert Ganian, Mathis Rocton, Simon Wietheger |
| 2024 | STACS | Computing Twin-Width Parameterized by the Feedback Edge Number. | Jakub Balabn, Robert Ganian, Mathis Rocton |
| 2024 | WG | The Parameterized Complexity Landscape of the Unsplittable Flow Problem. | Robert Ganian, Mathis Rocton, Daniel Unterberger |