Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. - Jan Elffers; Jan Johannsen; Massimo Lauria; Thomas Magnard; Jakob Nordström; Marc Vinyals (SAT, 2016)

An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. - Éric Colin de Verdière; Thomas Magnard (ESA, 2021)

Shellings and Sheddings Induced by Collapses. - Thomas Magnard; Michael Skotnica; Martin Tancer (SIAM J. Discret. Math., 2021)

Topological embeddings of graphs onsimplicial complexes. (Plongements topologiques de graphessur les complexes simpliciaux). - Thomas Magnard (2021)

Embedding Graphs into Two-Dimensional Simplicial Complexes. - Éric Colin de Verdière; Thomas Magnard; Bojan Mohar (Comput. Geom. Topol., 2022)