default search action
Éric Colin de Verdière
Person information
- affiliation: ENS Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi:
Computing Shortest Closed Curves on Non-Orientable Surfaces. SoCG 2024: 28:1-28:16 - [c24]Éric Colin de Verdière, Vincent Despré, Loïc Dubois:
Untangling Graphs on Surfaces. SODA 2024: 4909-4941 - [i18]Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi:
Computing shortest closed curves on non-orientable surfaces. CoRR abs/2403.11749 (2024) - [i17]Éric Colin de Verdière, Petr Hlinený:
FPT Algorithms for Crossing Number Problems: A Unified Approach. CoRR abs/2410.00206 (2024) - 2023
- [j24]Kevin Buchin, Éric Colin de Verdière:
Guest Editors' Foreword. Discret. Comput. Geom. 70(2): 305-306 (2023) - [j23]Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel:
Forty years of history. Eur. J. Comb. 111: 103689 (2023) - [i16]Éric Colin de Verdière, Vincent Despré, Loïc Dubois:
Untangling Graphs on Surfaces. CoRR abs/2311.00437 (2023) - 2022
- [j22]Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding Graphs into Two-Dimensional Simplicial Complexes. Comput. Geom. Topol. 1(1): 6:1-6:23 (2022) - 2021
- [j21]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): 30:1-30:26 (2021) - [j20]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): 1-31 (2021) - [c23]Éric Colin de Verdière, Thomas Magnard:
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. ESA 2021: 32:1-32:17 - [e1]Kevin Buchin
37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference). LIPIcs 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-184-9 [contents] - [i15]Éric Colin de Verdière, Thomas Magnard:
An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes. CoRR abs/2107.06236 (2021) - 2020
- [j19]Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado
Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. Discret. Comput. Geom. 64(2): 386-395 (2020) - [j18]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. 835: 120-133 (2020) - [i14]É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 abs/2001.04747 (2020)
2010 – 2019
- 2019
- [c22]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: 27:1-27:16 - [i13]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 abs/1903.08603 (2019) - [i12]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR abs/1910.04228 (2019) - 2018
- [c21]Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding Graphs into Two-Dimensional Simplicial Complexes. SoCG 2018: 27:1-27:14 - [c20]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: 1439-1458 - [i11]Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding graphs into two-dimensional simplicial complexes. CoRR abs/1803.07032 (2018) - 2017
- [j17]Éric Colin de Verdière:
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. Algorithmica 78(4): 1206-1224 (2017) - [j16]Éric Colin de Verdière, Vojtech Kaluza
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. J. Graph Algorithms Appl. 21(5): 939-981 (2017) - [c19]Éric Colin de Verdière, Salman Parsa:
Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-Manifold. SODA 2017: 2691-2704 - [i10]Éric Colin de Verdière:
Computational topology of graphs on surfaces. CoRR abs/1702.05358 (2017) - 2016
- [j15]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7(1): 123-148 (2016) - [c18]Éric Colin de Verdière, Vojtech Kaluza
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. GD 2016: 454-467 - [c17]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: 584-597 - [i9]Éric Colin de Verdière, Vojtech Kaluza
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. CoRR abs/1608.07855 (2016) - [i8]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 abs/1611.02966 (2016) - 2015
- [j14]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. Discret. Comput. Geom. 53(3): 587-620 (2015) - [c16]Éric Colin de Verdière:
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. ESA 2015: 373-385 - [i7]Éric Colin de Verdière:
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals. CoRR abs/1502.00911 (2015) - 2014
- [j13]Éric Colin de Verdière, Arnaud de Mesmay:
Testing Graph Isotopy on Surfaces. Discret. Comput. Geom. 51(1): 171-206 (2014) - [c15]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. SoCG 2014: 335 - [i6]Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay:
Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces. CoRR abs/1408.4036 (2014) - [i5]Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay:
On the Complexity of Immersed Normal Surfaces. CoRR abs/1412.4988 (2014) - 2013
- [j12]Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto
Irreducible Triangulations of Surfaces with Boundary. Graphs Comb. 29(6): 1675-1688 (2013) - [i4]Éric Colin de Verdière, Arnaud de Mesmay:
Testing Graph Isotopy on Surfaces. CoRR abs/1310.2745 (2013) - 2012
- [j11]Sergio Cabello
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012) - [c14]Arnaud de Mesmay, Éric Colin de Verdière:
Testing graph isotopies on surfaces. SCG 2012: 141-150 - [c13]Éric Colin de Verdière, Grégory Ginot
Multinerves and helly numbers of acyclic families. SCG 2012: 209-218 - 2011
- [j10]Sergio Cabello
Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. 25(4): 1600-1614 (2011) - [j9]Éric Colin de Verdière, Alexander Schrijver:
Shortest vertex-disjoint two-face paths in planar graphs. ACM Trans. Algorithms 7(2): 19:1-19:12 (2011) - [i3]Éric Colin de Verdière, Grégory Ginot, Xavier Goaoc:
Helly numbers of acyclic families. CoRR abs/1101.6006 (2011) - [i2]Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto:
Irreducible triangulations of surfaces with boundary. CoRR abs/1103.5364 (2011) - 2010
- [j8]Erin W. Chambers
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010) - [j7]Éric Colin de Verdière, Jeff Erickson:
Tightening Nonsimple Paths and Cycles on Surfaces. SIAM J. Comput. 39(8): 3784-3813 (2010) - [c12]Sergio Cabello
Output-sensitive algorithm for the edge-width of an embedded graph. SCG 2010: 147-155 - [c11]Sergio Cabello
Finding shortest non-trivial cycles in directed graphs on surfaces. SCG 2010: 156-165 - [c10]Éric Colin de Verdière:
Shortest Cut Graph of a Surface with Prescribed Vertex Set. ESA (2) 2010: 100-111
2000 – 2009
- 2008
- [j6]Erin W. Chambers
Splitting (complicated) surfaces is hard. Comput. Geom. 41(1-2): 94-110 (2008) - [c9]Erin W. Chambers
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - [c8]Éric Colin de Verdière, Alexander Schrijver:
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. STACS 2008: 181-192 - [i1]Éric Colin de Verdière, Alexander Schrijver:
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. CoRR abs/0802.2845 (2008) - 2007
- [j5]Éric Colin de Verdière, Francis Lazarus:
Optimal pants decompositions and shortest homotopic cycles on an orientable surface. J. ACM 54(4): 18 (2007) - 2006
- [c7]Erin W. Chambers
Splitting (complicated) surfaces is hard. SCG 2006: 421-429 - [c6]Éric Colin de Verdière, Jeff Erickson:
Tightening non-simple paths and cycles on surfaces. SODA 2006: 192-201 - 2005
- [j4]Pierre Alliez, Éric Colin de Verdière, Olivier Devillers
Centroidal Voronoi diagrams for isotropic surface remeshing. Graph. Model. 67(3): 204-231 (2005) - [j3]Éric Colin de Verdière, Francis Lazarus:
Optimal System of Loops on an Orientable Surface. Discret. Comput. Geom. 33(3): 507-534 (2005) - 2004
- [j2]David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec:
Conforming Delaunay triangulations in 3D. Comput. Geom. 28(2-3): 217-233 (2004) - 2003
- [j1]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. Comput. Geom. 26(1): 81-97 (2003) - [c5]Éric Colin de Verdière, Francis Lazarus:
Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. GD 2003: 478-490 - [c4]Pierre Alliez, Éric Colin de Verdière, Olivier Devillers
Isotropic Surface Remeshing. Shape Modeling International 2003: 49-58 - 2002
- [c3]David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec:
Conforming Delaunay triangulations in 3D. SCG 2002: 199-208 - [c2]Éric Colin de Verdière, Francis Lazarus:
Optimal System of Loops on an Orientable Surface. FOCS 2002: 627-636 - 2001
- [c1]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. CCCG 2001: 57-60
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: