NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (26)

cs.DS2006

Minimum-Cost Coverage of Point Sets by Disks

Esther M. Arkin, Herve Broennimann, Jeff Erickson +5

cs.CG2017

Recognizing Weakly Simple Polygons

Hugo Akitaya, Greg Aloupis, Jeff Erickson +1

math.GT2007

Rips Complexes of Planar Point Sets

Erin W. Chambers, Vin de Silva, Jeff Erickson +1

cs.DS2018

Holiest Minimum-Cost Paths and Flows in Surface Graphs

Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren

cs.CG2001

Vertex-Unfoldings of Simplicial Manifolds

Erik D. Demaine, David Eppstein, Jeff Erickson +2

cs.CG2015

Electrical Reduction, Homotopy Moves, and Defect

Hsien-Chih Chang, Jeff Erickson

cs.DS2013

Multiple-Source Shortest Paths in Embedded Graphs

Sergio Cabello, Erin Wolf Chambers, Jeff Erickson

cs.CG2001

Vertex-Unfoldings of Simplicial Polyhedra

Erik D. Demaine, David Eppstein, Jeff Erickson +2

cs.CG2019

Topologically Trivial Closed Walks in Directed Surface Graphs

Jeff Erickson, Yipu Wang

math.CO2001

Arbitrarily Large Neighborly Families of Congruent Symmetric Convex 3-Polytopes

Jeff Erickson

cs.CG2000

Flipturning polygons

Oswin Aichholzer, Carmen Cortes, Erik D. Demaine +7

cs.DS2012

Necklaces, Convolutions, and X+Y

David Bremner, Timothy M. Chan, Erik D. Demaine +6

cs.DM2005

Distance-2 Edge Coloring is NP-Complete

Jeff Erickson, Shripad Thite, David P. Bunde

cs.CG2002

Flipping Cubical Meshes

Marshall Bern, David Eppstein, Jeff Erickson

cs.CG2002

Building Space-Time Meshes over Arbitrary Spatial Domains

Jeff Erickson, Damrong Guoy, John M. Sullivan +1

cs.CG2002

Dense point sets have sparse Delaunay triangulations

Jeff Erickson

cs.DS2013

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs

Jeff Erickson, Anastasios Sidiropoulos

cs.CG2001

Nice point sets can have nasty Delaunay triangulations

Jeff Erickson

cs.CG2019

Lower Bounds for Electrical Reduction on Surfaces

Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson

cs.CG2014

Detecting Weakly Simple Polygons

Hsien-Chih Chang, Jeff Erickson, Chao Xu

cs.CG1999

Finite-resolution hidden surface removal

Jeff Erickson

cs.CG2002

Optimally cutting a surface into a disk

Jeff Erickson, Sariel Har-Peled

cs.DM2017

Embedded-width: A variant of treewidth for plane graphs

Glencora Borradaile, Jeff Erickson, Hung Le +1

cs.CG2017

Untangling Planar Curves

Hsien-Chih Chang, Jeff Erickson

cs.CG1998

Separation-Sensitive Collision Detection for Convex Objects

Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi +1

cs.CG2002

Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible

Michael Soss, Jeff Erickson, Mark Overmars