É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.

[BibT_eX]

[DOI]

Denys Bulavka

Niloufar Fuladi

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

2023

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Kevin Buchin

Discret. Comput. Geom., September, 2023

Forty years of history.

[BibT_eX]

[DOI]

Marthe Bonamy

Patrice Ossona de Mendez

Mathilde Bouvel

Eur. J. Comb., June, 2023

2022

Embedding Graphs into Two-Dimensional Simplicial Complexes.

[BibT_eX]

[DOI]

Thomas Magnard

Bojan Mohar

Comput. Geom. Topol., 2022

2021

A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

SIAM J. Comput., 2021

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Dániel Marx

J. ACM, 2021

An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes.

[BibT_eX]

[DOI]

Thomas Magnard

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Salman Parsa

CoRR, 2020

2019

Hardness of Minimum Barrier Shrinkage and Minimum Activation Path.

[BibT_eX]

[DOI]

CoRR, 2019

2017

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Computational topology of graphs on surfaces.

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

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

[BibT_eX]

[DOI]

Salman Parsa

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

2016

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

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Approximating connectivity domination in weighted bounded-genus graphs.

[BibT_eX]

[DOI]

Vincent Cohen-Addad

Philip N. Klein

Claire Mathieu

David Meierfrankenfeld

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

2015

Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces.

[BibT_eX]

[DOI]

Alfredo Hubard

Discret. Comput. Geom., 2015

2014

Testing Graph Isotopy on Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

On the Complexity of Immersed Normal Surfaces.

[BibT_eX]

[DOI]

Benjamin A. Burton

CoRR, 2014

2013

Irreducible Triangulations of Surfaces with Boundary.

[BibT_eX]

[DOI]

Alexandre Boulch

Atsuhiro Nakamoto

Graphs Comb., 2013

2012

Algorithms for the edge-width of an embedded graph.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Multinerves and helly numbers of acyclic families.

[BibT_eX]

[DOI]

Grégory Ginot

Xavier Goaoc

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

Testing graph isotopies on surfaces.

[BibT_eX]

[DOI]

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

2011

Shortest vertex-disjoint two-face paths in planar graphs.

[BibT_eX]

[DOI]

Alexander Schrijver

ACM Trans. Algorithms, 2011

Finding Cycles with Topological Properties in Embedded Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Helly numbers of acyclic families

[BibT_eX]

[DOI]

Grégory Ginot

Xavier Goaoc

CoRR, 2011

2010

Tightening Nonsimple Paths and Cycles on Surfaces.

[BibT_eX]

[DOI]

Jeff Erickson

SIAM J. Comput., 2010

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

[BibT_eX]

[DOI]

Erin W. Chambers

Comput. Geom., 2010

Shortest Cut Graph of a Surface with Prescribed Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

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

[BibT_eX]

[DOI]

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

2008

Splitting (complicated) surfaces is hard.

[BibT_eX]

[DOI]

Erin W. Chambers

Jeff Erickson

Kim Whittlesey

Comput. Geom., 2008

Walking your dog in the woods in polynomial time.

[BibT_eX]

[DOI]

Erin W. Chambers

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

2007

Optimal pants decompositions and shortest homotopic cycles on an orientable surface.

[BibT_eX]

[DOI]

J. ACM, 2007

2006

Tightening non-simple paths and cycles on surfaces.

[BibT_eX]

[DOI]

Jeff Erickson

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

2005

Optimal System of Loops on an Orientable Surface.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Centroidal Voronoi diagrams for isotropic surface remeshing.

[BibT_eX]

[DOI]

Pierre Alliez

Olivier Devillers

Martin Isenburg

Graph. Model., 2005

2004

Conforming Delaunay triangulations in 3D.

[BibT_eX]

[DOI]

David Cohen-Steiner

Mariette Yvinec

Comput. Geom., 2004

2003

Tutte's barycenter method applied to isotopies.

[BibT_eX]

[DOI]

Michel Pocchiola

Gert Vegter

Comput. Geom., 2003

Isotropic Surface Remeshing.

[BibT_eX]

[DOI]

Pierre Alliez