Éric Colin de Verdière

75 papers A* 13A 6Journal 46Unranked 10

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