15 citations · 22 across the 5 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2021
An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
Éric Colin de Verdière, Thomas Magnard
We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem i…
cs.CG2017★ 15 cited
Computational topology of graphs on surfaces
Éric Colin de Verdière
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in…
cs.CG2016★ 1 cited
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták +2
We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our method is constructive and does not rely…