Isotropic Surface Remeshing. - Pierre Alliez; Éric Colin de Verdière; Olivier Devillers; Martin Isenburg (Shape Modeling International, 2003)

Tutte's barycenter method applied to isotopies. - Éric Colin de Verdière; Michel Pocchiola; Gert Vegter (Comput. Geom., 2003)

Conforming Delaunay triangulations in 3D. - David Cohen-Steiner; Éric Colin de Verdière; Mariette Yvinec (Comput. Geom., 2004)

Centroidal Voronoi diagrams for isotropic surface remeshing. - Pierre Alliez; Éric Colin de Verdière; Olivier Devillers; Martin Isenburg (Graph. Model., 2005)

Optimal System of Loops on an Orientable Surface. - Éric Colin de Verdière; Francis Lazarus (Discret. Comput. Geom., 2005)

Tightening non-simple paths and cycles on surfaces. - Éric Colin de Verdière; Jeff Erickson 001 (SODA, 2006)

Optimal pants decompositions and shortest homotopic cycles on an orientable surface. - Éric Colin de Verdière; Francis Lazarus (J. ACM, 2007)

Walking your dog in the woods in polynomial time. - Erin W. Chambers; Éric Colin de Verdière; Jeff Erickson 001; Sylvain Lazard; Francis Lazarus; Shripad Thite (SCG, 2008)

Splitting (complicated) surfaces is hard. - Erin W. Chambers; Éric Colin de Verdière; Jeff Erickson 001; Francis Lazarus; Kim Whittlesey (Comput. Geom., 2008)

Output-sensitive algorithm for the edge-width of an embedded graph. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (SCG, 2010)

Shortest Cut Graph of a Surface with Prescribed Vertex Set. - Éric Colin de Verdière (ESA (2), 2010)

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. - Erin W. Chambers; Éric Colin de Verdière; Jeff Erickson 001; Sylvain Lazard; Francis Lazarus; Shripad Thite (Comput. Geom., 2010)

Tightening Nonsimple Paths and Cycles on Surfaces. - Éric Colin de Verdière; Jeff Erickson 001 (SIAM J. Comput., 2010)

Helly numbers of acyclic families - Éric Colin de Verdière; Grégory Ginot; Xavier Goaoc (CoRR, 2011)

Finding Cycles with Topological Properties in Embedded Graphs. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (SIAM J. Discret. Math., 2011)

Shortest vertex-disjoint two-face paths in planar graphs. - Éric Colin de Verdière; Alexander Schrijver (ACM Trans. Algorithms, 2011)

Testing graph isotopies on surfaces. - Arnaud de Mesmay; Éric Colin de Verdière (SCG, 2012)

Multinerves and helly numbers of acyclic families. - Éric Colin de Verdière; Grégory Ginot; Xavier Goaoc (SCG, 2012)

Algorithms for the edge-width of an embedded graph. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (Comput. Geom., 2012)

Irreducible Triangulations of Surfaces with Boundary. - Alexandre Boulch; Éric Colin de Verdière; Atsuhiro Nakamoto (Graphs Comb., 2013)

On the Complexity of Immersed Normal Surfaces. - Benjamin A. Burton; Éric Colin de Verdière; Arnaud de Mesmay (CoRR, 2014)

Testing Graph Isotopy on Surfaces. - Éric Colin de Verdière; Arnaud de Mesmay (Discret. Comput. Geom., 2014)

Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. - Éric Colin de Verdière; Alfredo Hubard; Arnaud de Mesmay (Discret. Comput. Geom., 2015)

Approximating connectivity domination in weighted bounded-genus graphs. - Vincent Cohen-Addad; Éric Colin de Verdière; Philip N. Klein; Claire Mathieu; David Meierfrankenfeld (STOC, 2016)

Finding shortest non-trivial cycles in directed graphs on surfaces. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (J. Comput. Geom., 2016)

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. - Éric Colin de Verdière; Salman Parsa (SODA, 2017)

Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. - Éric Colin de Verdière (Algorithmica, 2017)

Computational topology of graphs on surfaces. - Éric Colin de Verdière (CoRR, 2017)

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. - Éric Colin de Verdière; Vojtech Kaluza; Pavel Paták; Zuzana Patáková; Martin Tancer (J. Graph Algorithms Appl., 2017)

Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. - Sergio Cabello; Éric Colin de Verdière (CoRR, 2019)

Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem. - Éric Colin de Verdière; Salman Parsa (CoRR, 2020)

Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. - Éric Colin de Verdière; Carolina Medina; Edgardo Roldán-Pensado; Gelasio Salazar (Discret. Comput. Geom., 2020)

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. - Sergio Cabello; Éric Colin de Verdière (Theor. Comput. Sci., 2020)

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

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. - Vincent Cohen-Addad; Éric Colin de Verdière; Dániel Marx; Arnaud de Mesmay (J. ACM, 2021)

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 (SIAM J. Comput., 2021)

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

Forty years of history. - Marthe Bonamy; Patrice Ossona de Mendez; Éric Colin de Verdière; Mathilde Bouvel (Eur. J. Comb., 2023)

Guest Editors' Foreword. - Kevin Buchin; Éric Colin de Verdière (Discret. Comput. Geom., 2023)

Computing Shortest Closed Curves on Non-Orientable Surfaces. - Denys Bulavka; Éric Colin de Verdière; Niloufar Fuladi (SoCG, 2024)

Untangling Graphs on Surfaces. - Éric Colin de Verdière; Vincent Despré; Loïc Dubois 001 (SODA, 2024)

FPT Algorithms for Crossing Number Problems: A Unified Approach. - Éric Colin de Verdière; Petr Hlinený (CoRR, 2024)

Finding a Shortest Curve That Separates Few Objects from Many. - Therese Biedl; Éric Colin de Verdière; Fabrizio Frati; Anna Lubiw; Günter Rote (SoCG, 2025)

A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces. - Éric Colin de Verdière; Vincent Despré; Loïc Dubois 001 (SODA, 2025)