Éric Colin de Verdière

According to our database, Éric Colin de Verdière authored at least 45 papers between 2001 and 2025.

Collaborative distances:

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

2025

A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces.

Éric Colin de Verdière, Vincent Despré, Loïc Dubois

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Unified FPT Framework for Crossing Number Problems.

Éric Colin de Verdière, Petr Hlinený

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Finding a Shortest Curve That Separates Few Objects from Many.

Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, Günter Rote

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

FPT Algorithms for Crossing Number Problems: A Unified Approach.

Éric Colin de Verdière, Petr Hlinený

CoRR, 2024

Untangling Graphs on Surfaces.

Éric Colin de Verdière, Vincent Despré, Loïc Dubois

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Computing Shortest Closed Curves on Non-Orientable Surfaces.

Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Guest Editors' Foreword.

Kevin Buchin, Éric Colin de Verdière

Discret. Comput. Geom., September, 2023

Forty years of history.

Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel

Eur. J. Comb., June, 2023

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

2020

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path.

Sergio Cabello, Éric Colin de Verdière

Theor. Comput. Sci., 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

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

2019

Hardness of Minimum Barrier Shrinkage and Minimum Activation Path.

Sergio Cabello, Éric Colin de Verdière

CoRR, 2019

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

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

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

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Embedding Graphs into Two-Dimensional Simplicial Complexes.

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

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Computational topology of graphs on surfaces.

Éric Colin de Verdière

CoRR, 2017

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold.

Éric Colin de Verdière, Salman Parsa

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Approximating connectivity domination in weighted bounded-genus graphs.

Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

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

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals.

Éric Colin de Verdière

Proceedings of the Algorithms - ESA 2015, 2015

2014

Testing Graph Isotopy on Surfaces.

Éric Colin de Verdière, Arnaud de Mesmay

Discret. Comput. Geom., 2014

On the Complexity of Immersed Normal Surfaces.

Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay

CoRR, 2014

Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.

Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Irreducible Triangulations of Surfaces with Boundary.

Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto

Graphs Comb., 2013

2012

Algorithms for the edge-width of an embedded graph.

Sergio Cabello, Éric Colin de Verdière, Francis Lazarus

Comput. Geom., 2012

Multinerves and helly numbers of acyclic families.

Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Testing graph isotopies on surfaces.

Arnaud de Mesmay, Éric Colin de Verdière

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Finding Cycles with Topological Properties in Embedded Graphs.

Sergio Cabello, Éric Colin de Verdière, Francis Lazarus

SIAM J. Discret. Math., 2011

Helly numbers of acyclic families

Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc

CoRR, 2011

2010

Tightening Nonsimple Paths and Cycles on Surfaces.

Éric Colin de Verdière, Jeff Erickson

SIAM J. Comput., 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, Sylvain Lazard, Francis Lazarus, Shripad Thite

Comput. Geom., 2010

Shortest Cut Graph of a Surface with Prescribed Vertex Set.

Éric Colin de Verdière

Proceedings of the Algorithms, 2010

Finding shortest non-trivial cycles in directed graphs on surfaces.

Sergio Cabello, Éric Colin de Verdière, Francis Lazarus

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Output-sensitive algorithm for the edge-width of an embedded graph.

Sergio Cabello, Éric Colin de Verdière, Francis Lazarus

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2008

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs.

Éric Colin de Verdière, Alexander Schrijver

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008

Walking your dog in the woods in polynomial time.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2006

Tightening non-simple paths and cycles on surfaces.

Éric Colin de Verdière, Jeff Erickson

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Splitting (complicated) surfaces is hard.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Kim Whittlesey

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Centroidal Voronoi diagrams for isotropic surface remeshing.

Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg

Graph. Model., 2005

2003

Isotropic Surface Remeshing.

Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg

Proceedings of the 2003 International Conference on Shape Modeling and Applications (SMI 2003), 2003

Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface.

Éric Colin de Verdière, Francis Lazarus

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Optimal System of Loops on an Orientable Surface.

Éric Colin de Verdière, Francis Lazarus

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

Conforming Delaunay triangulations in 3D.

David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Tutte's barycenter method applied to isotopies.

Éric Colin de Verdière, Michel Pocchiola, Gert Vegter

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001