Jeff Erickson

According to our database1, Jeff Erickson authored at least 97 papers between 1994 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Computational Geometry (Dagstuhl Seminar 19181).
Dagstuhl Reports, 2019

A Framework for Robust Realistic Geometric Computations.
CoRR, 2019

Minimum Cuts in Surface Graphs.
CoRR, 2019

Optimal Curve Straightening is ∃R-Complete.
CoRR, 2019

Lower Bounds for Electrical Reduction on Surfaces.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Topologically Trivial Closed Walks in Directed Surface Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Algorithms
ISBN: 978-1-792-64483-2, 2019

2018
Holiest minimum-cost paths and flows in surface graphs.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Tightening Curves on Surfaces via Local Moves.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.
JIP, 2017

Untangling Planar Curves.
Discrete & Computational Geometry, 2017

Recognizing Weakly Simple Polygons.
Discrete & Computational Geometry, 2017

Computational Geometry (Dagstuhl Seminar 17171).
Dagstuhl Reports, 2017

Lower Bounds for Planar Electrical Reduction.
CoRR, 2017

Embedded-width: A variant of treewidth for plane graphs.
CoRR, 2017

2016
Global Minimum Cuts in Surface-Embedded Graphs.
Encyclopedia of Algorithms, 2016

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221).
Dagstuhl Reports, 2016

2015
Computational Geometry (Dagstuhl Seminar 15111).
Dagstuhl Reports, 2015

Electrical Reduction, Homotopy Moves, and Defect.
CoRR, 2015

Detecting Weakly Simple Polygons.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Efficiently Hex-Meshing Things with Topology.
Discrete & Computational Geometry, 2014

Necklaces, Convolutions, and X+Y.
Algorithmica, 2014

A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Multiple-Source Shortest Paths in Embedded Graphs.
SIAM J. Comput., 2013

Tracing Compressed Curves in Triangulated Surfaces.
Discrete & Computational Geometry, 2013

Transforming Curves on Surfaces Redux.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Homology Flows, Cohomology Cuts.
SIAM J. Comput., 2012

Global minimum cuts in surface embedded graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Special Section on Foundations of Computer Science.
SIAM J. Comput., 2011

Computing Replacement Paths in Surface Embedded Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Shortest Non-Crossing Walks in the Plane.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Shortest non-trivial cycles in directed surface graphs.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Finding one tight cycle.
ACM Trans. Algorithms, 2010

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

Computing the Shortest Essential Cycle.
Discrete & Computational Geometry, 2010

Vietoris-Rips Complexes of Planar Point Sets.
Discrete & Computational Geometry, 2010

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

Maximum Flows and Parametric Shortest Paths in Planar Graphs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Centerpoint Theorems for Wedges.
Discrete Mathematics & Theoretical Computer Science, 2009

Guest Editor's Foreword.
Discrete & Computational Geometry, 2009

Minimum cuts and shortest homologous cycles.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Realizing partitions respecting full and partial order information.
J. Discrete Algorithms, 2008

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

Empty-ellipse graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

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

Testing contractibility in planar rips complexes.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Capturing a Convex Object With Three Discs.
IEEE Trans. Robotics, 2007

Finding Small Holes.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006
On the Least Median Square Problem.
Discrete & Computational Geometry, 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

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

Necklaces, Convolutions, and X + Y.
Proceedings of the Algorithms, 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl., 2005

Building spacetime meshes over arbitrary spatial domains.
Eng. Comput. (Lond.), 2005

Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty".
Discrete & Computational Geometry, 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry, 2005

Distance-2 Edge Coloring is NP-Complete
CoRR, 2005

Local polyhedra and geometric graphs.
Comput. Geom., 2005

Greedy optimal homotopy and homology generators.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Lower bounds for external algebraic decision trees.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Optimally Cutting a Surface into a Disk.
Discrete & Computational Geometry, 2004

Kinetic collision detection between two simple polygons.
Comput. Geom., 2004

Automatic Blocking Scheme for Structured Meshing in 2d Multiphase Flow Simulation.
Proceedings of the 13th International Meshing Roundtable, 2004

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects.
Proceedings of the Algorithms, 2004

Spacetime meshing with adaptive refinement and coarsening.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Indexing Moving Points.
J. Comput. Syst. Sci., 2003

Nice Point Sets Can Have Nasty Delaunay Triangulations.
Discrete & Computational Geometry, 2003

Preprocessing chains for fast dihedral rotations is hard or even impossible.
Comput. Geom., 2003

On the Complexity of Halfspace Volume Queries.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Flipping Cubical Meshes.
Eng. Comput. (Lond.), 2002

Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002

Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Building Space-Time Meshes Over Arbitrary Spatial Domains.
Proceedings of the 11th International Meshing Roundtable, 2002

Vertex-unfoldings of simplicial manifolds.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Dense point sets have sparse Delaunay triangulations
CoRR, 2001

Vertex-Unfoldings of Simplicial Polyhedra
CoRR, 2001

Reconfiguring convex polygons.
Comput. Geom., 2001

2000
Space-Time Tradeoffs for Emptiness Queries.
SIAM J. Comput., 2000

Efficient Searching with Linear Constraints.
J. Comput. Syst. Sci., 2000

Flipturning polygons
CoRR, 2000

Finite-resolution hidden surface removal.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
New Lower Bounds for Convex Hull Problems in Odd Dimensions.
SIAM J. Comput., 1999

Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions.
Discrete & Computational Geometry, 1999

Bounds for Linear Satisfiability Problems.
Chicago J. Theor. Comput. Sci., 1999

Separation-Sensitive Collision Detection for Convex Objects.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies.
Discrete & Computational Geometry, 1997

Space-Time Tradeoffs for Emptiness Queries (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
New Lower Bounds for Hopcroft's Problem.
Discrete & Computational Geometry, 1996

Better Lower Bounds for Halfspace Emptiness.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Better Lower Bounds on Detecting Affine and Spherical Degeneracies.
Discrete & Computational Geometry, 1995

Lower Bounds for Linear Satisfiability Problems.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

New Lower Bounds for Hopcroft's Problem (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

On the relative complexities of some geometric problems.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Iterated Nearest Neighbors and Finding Minimal Polytopes.
Discrete & Computational Geometry, 1994


  Loading...