15 citations · 22 across the 5 of their papers we have counts for
6 papers
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…
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…
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
For an undirected edge-weighted graph and a set of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from disconn…
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…
On the Complexity of Immersed Normal Surfaces
Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay
Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a…
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial clos…