ABSTRACT Splitting (Complicated) Surfaces Is Hard ∗ (2008)
Erin W. Chambers, Francis Lazarus, Jeff Erickson, Kim Whittlesey
Let M be an orientable combinatorial surface without boundary. A cycle on M is splitting if it has no self-intersections and it partitions M into two components, neither of which is homeomorphic to a...
Abstract Greedy Optimal Homotopy and Homology Generators ∗ (2008)
We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed...
Minimum-Cost Coverage of Point Sets by Disks (2006)
Arkin, Esther M., Broennimann, Herve, Erickson, Jeff, Fekete, Sandor P., Knauer, Christian, Lenchner, Jonathan, ...
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 of demand points Y...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Splitting (Complicated) Surfaces is Hard (2006)
Chambers, Erin, Colin De Verdière, Éric, Erickson, Jeff, Lazarus, Francis, Whittlesey, Kim
Let $\MM$ be an orientable combinatorial surface without boundary. A cycle on $\MM$ is \emph{splitting} if it has no self-intersections and it partitions $\MM$ into two components, neither of which...
Minimum-cost coverage of point sets by disks (2006)
Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, ...
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 of demand points Y...
Splitting (complicated) surfaces is hard (2006)
Erin W. Chambers, Éric Colin, Verdière Jeff Erickson, Francis Lazarus, Kim Whittlesey
Let M be an orientable surface without boundary. A cycle on M is splitting if it has no self-intersections and it partitions M into two components, neither homeomorphic to a disk. In other words,...
Greedy optimal homotopy and homology generators (2005)
Abstract We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed...
Bestvina's normal form complex and the homology of Garside groups (2002)
Charney, Ruth, Meier, John, Whittlesey, Kim
A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(\pi,1)s for Garside groups. This...
Normal all pseudo-Anosov subgroups of mapping class groups (1999)
We construct the first known examples of nontrivial, normal, all pseudo-Anosov subgroups of mapping class groups of surfaces. Specifically, we construct such subgroups for the closed genus two...