Thomas Magnard

According to our database, Thomas Magnard authored at least 5 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Embedding Graphs into Two-Dimensional Simplicial Complexes.

Éric Colin de Verdière, Thomas Magnard, Bojan Mohar

Comput. Geom. Topol., 2022

2021

Topological embeddings of graphs onsimplicial complexes. (Plongements topologiques de graphessur les complexes simpliciaux).

Thomas Magnard

PhD thesis, 2021

Shellings and Sheddings Induced by Collapses.

Thomas Magnard, Michael Skotnica, Martin Tancer

SIAM J. Discret. Math., 2021

An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes.

Éric Colin de Verdière, Thomas Magnard

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2016

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

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016