27 citations · 28 across the 4 of their papers we have counts for
6 papers
How to Morph Graphs on the Torus
Erin Wolf Chambers, Jeff Erickson, Patrick Lin +1
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in…
Fusible numbers and Peano Arithmetic
Jeff Erickson, Gabriel Nivasch, Junyan Xu
Inspired by a mathematical riddle involving fuses, we define the "fusible numbers" as follows: is fusible, and whenever are fusible with , the number …
A Toroidal Maxwell-Cremona-Delaunay Correspondence
Jeff Erickson, Patrick Lin
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A toroidal graph embedding is positive equilibrium if it is possible to place positive we…
Smoothing the gap between NP and ER
Jeff Erickson, Ivor van der Hoog, Tillmann Miltzow
We study algorithmic problems that belong to the complexity class of the existential theory of the reals (ER). A problem is ER-complete if it is as hard as the problem ETR and if i…
Minimum Cuts in Surface Graphs
Erin W. Chambers, Jeff Erickson, Kyle Fox +1
We describe algorithms to efficiently compute minimum -cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph with $…
Minimum-Cost Coverage of Point Sets by Disks
Esther M. Arkin, Herve Broennimann, Jeff Erickson +5
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (t_j) and radii (r_j) that cover a given set o…