Éric Colin de Verdière

Affiliations:
  • ENS Paris, France


According to our database1, Éric Colin de Verdière authored at least 42 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FPT Algorithms for Crossing Number Problems: A Unified Approach.
CoRR, 2024

Untangling Graphs on Surfaces.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Computing Shortest Closed Curves on Non-Orientable Surfaces.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Guest Editors' Foreword.
Discret. Comput. Geom., September, 2023

Forty years of history.
Eur. J. Comb., June, 2023

2022
Embedding Graphs into Two-Dimensional Simplicial Complexes.
Comput. Geom. Topol., 2022

2021
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals.
SIAM J. Comput., 2021

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
J. ACM, 2021

An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path.
Theor. Comput. Sci., 2020

Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces.
Discret. Comput. Geom., 2020

Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem.
CoRR, 2020

2019
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path.
CoRR, 2019

2017
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane.
J. Graph Algorithms Appl., 2017

Computational topology of graphs on surfaces.
CoRR, 2017

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

Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Finding shortest non-trivial cycles in directed graphs on surfaces.
J. Comput. Geom., 2016

Approximating connectivity domination in weighted bounded-genus graphs.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.
Discret. Comput. Geom., 2015

2014
Testing Graph Isotopy on Surfaces.
Discret. Comput. Geom., 2014

On the Complexity of Immersed Normal Surfaces.
CoRR, 2014

2013
Irreducible Triangulations of Surfaces with Boundary.
Graphs Comb., 2013

2012
Algorithms for the edge-width of an embedded graph.
Comput. Geom., 2012

Multinerves and helly numbers of acyclic families.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Testing graph isotopies on surfaces.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011
Shortest vertex-disjoint two-face paths in planar graphs.
ACM Trans. Algorithms, 2011

Finding Cycles with Topological Properties in Embedded Graphs.
SIAM J. Discret. Math., 2011

Helly numbers of acyclic families
CoRR, 2011

2010
Tightening Nonsimple Paths and Cycles on Surfaces.
SIAM J. Comput., 2010

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.
Comput. Geom., 2010

Shortest Cut Graph of a Surface with Prescribed Vertex Set.
Proceedings of the Algorithms, 2010

Output-sensitive algorithm for the edge-width of an embedded graph.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2008
Splitting (complicated) surfaces is hard.
Comput. Geom., 2008

Walking your dog in the woods in polynomial time.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Optimal pants decompositions and shortest homotopic cycles on an orientable surface.
J. ACM, 2007

2006
Tightening non-simple paths and cycles on surfaces.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Optimal System of Loops on an Orientable Surface.
Discret. Comput. Geom., 2005

Centroidal Voronoi diagrams for isotropic surface remeshing.
Graph. Model., 2005

2004
Conforming Delaunay triangulations in 3D.
Comput. Geom., 2004

2003
Tutte's barycenter method applied to isotopies.
Comput. Geom., 2003

Isotropic Surface Remeshing.
Proceedings of the 2003 International Conference on Shape Modeling and Applications (SMI 2003), 2003


  Loading...