Éric Colin de Verdière

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 29

Top Topics

Linear Approximation

Top Venues

Discret. Comput. Geom.

Publications

Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi
Computing Shortest Closed Curves on Non-Orientable Surfaces. SoCG (2024)
Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi
Computing shortest closed curves on non-orientable surfaces. CoRR (2024)
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
Untangling Graphs on Surfaces. SODA (2024)
Kevin Buchin, Éric Colin de Verdière
Guest Editors' Foreword. Discret. Comput. Geom. 70 (2) (2023)
Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel
Forty years of history. Eur. J. Comb. 111 (2023)
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
Untangling Graphs on Surfaces. CoRR (2023)
Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
Embedding Graphs into Two-Dimensional Simplicial Complexes. Comput. Geom. Topol. 1 (1) (2022)
Éric Colin de Verdière, Thomas Magnard
An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes. CoRR (2021)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. J. ACM 68 (4) (2021)
Éric Colin de Verdière, Thomas Magnard
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. ESA (2021)
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals. SIAM J. Comput. 50 (1) (2021)
Éric Colin de Verdière, Salman Parsa
Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem. CoRR (2020)
Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado, Gelasio Salazar
Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. Discret. Comput. Geom. 64 (2) (2020)
Sergio Cabello, Éric Colin de Verdière
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. 835 (2020)
Sergio Cabello, Éric Colin de Verdière
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR (2019)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. SoCG (2019)
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. CoRR (2019)
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. SODA (2018)
Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
Embedding Graphs into Two-Dimensional Simplicial Complexes. SoCG (2018)
Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
Embedding graphs into two-dimensional simplicial complexes. CoRR (2018)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. J. Graph Algorithms Appl. 21 (5) (2017)
Éric Colin de Verdière
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. Algorithmica 78 (4) (2017)
Éric Colin de Verdière, Salman Parsa
Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. SODA (2017)
Éric Colin de Verdière
Computational topology of graphs on surfaces. CoRR (2017)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. CoRR (2016)
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. CoRR (2016)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7 (1) (2016)
Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld
Approximating connectivity domination in weighted bounded-genus graphs. STOC (2016)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. Graph Drawing (2016)
Éric Colin de Verdière
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. ESA (2015)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. Discret. Comput. Geom. 53 (3) (2015)
Éric Colin de Verdière
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. CoRR (2015)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. CoRR (2014)
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. SoCG (2014)
Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay
On the Complexity of Immersed Normal Surfaces. CoRR (2014)
Éric Colin de Verdière, Arnaud de Mesmay
Testing Graph Isotopy on Surfaces. Discret. Comput. Geom. 51 (1) (2014)
Éric Colin de Verdière, Arnaud de Mesmay
Testing Graph Isotopy on Surfaces. CoRR (2013)
Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto
Irreducible Triangulations of Surfaces with Boundary. Graphs Comb. 29 (6) (2013)
Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc
Multinerves and helly numbers of acyclic families. SCG (2012)
Arnaud de Mesmay, Éric Colin de Verdière
Testing graph isotopies on surfaces. SCG (2012)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45 (5-6) (2012)
Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto
Irreducible triangulations of surfaces with boundary CoRR (2011)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. 25 (4) (2011)
Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc
Helly numbers of acyclic families CoRR (2011)
Éric Colin de Verdière, Alexander Schrijver
Shortest vertex-disjoint two-face paths in planar graphs. ACM Trans. Algorithms 7 (2) (2011)
Éric Colin de Verdière
Shortest Cut Graph of a Surface with Prescribed Vertex Set. ESA (2) (2010)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Finding shortest non-trivial cycles in directed graphs on surfaces. SCG (2010)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43 (3) (2010)
Éric Colin de Verdière, Jeff Erickson
Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39 (8) (2010)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Output-sensitive algorithm for the edge-width of an embedded graph. SCG (2010)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Walking your dog in the woods in polynomial time. SCG (2008)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
Splitting (complicated) surfaces is hard. Comput. Geom. 41 (1-2) (2008)
Éric Colin de Verdière, Alexander Schrijver
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs CoRR (2008)
Éric Colin de Verdière, Alexander Schrijver
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. STACS (2008)
Éric Colin de Verdière, Francis Lazarus
Optimal pants decompositions and shortest homotopic cycles on an orientable surface. J. ACM 54 (4) (2007)
Éric Colin de Verdière, Jeff Erickson
Tightening non-simple paths and cycles on surfaces. SODA (2006)
Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey
Splitting (complicated) surfaces is hard. SCG (2006)
Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg
Centroidal Voronoi diagrams for isotropic surface remeshing. Graph. Model. 67 (3) (2005)
Éric Colin de Verdière, Francis Lazarus
Optimal System of Loops on an Orientable Surface. Discret. Comput. Geom. 33 (3) (2005)
David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec
Conforming Delaunay triangulations in 3D. Comput. Geom. 28 (2-3) (2004)
Éric Colin de Verdière, Michel Pocchiola, Gert Vegter
Tutte's barycenter method applied to isotopies. Comput. Geom. 26 (1) (2003)
Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg
Isotropic Surface Remeshing. Shape Modeling International (2003)
Éric Colin de Verdière, Francis Lazarus
Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. Graph Drawing (2003)
David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec
Conforming Delaunay triangulations in 3D. SCG (2002)
Éric Colin de Verdière, Francis Lazarus
Optimal System of Loops on an Orientable Surface. FOCS (2002)
Éric Colin de Verdière, Michel Pocchiola, Gert Vegter
Tutte's barycenter method applied to isotopies. CCCG (2001)