Erin W. Chambers

Extremal Problems for Roman Domination

A Roman dominating function of a graph

A simple and robust thinning algorithm on cell complexes

G

Minimum cuts and shortest homologous cycles

is a labeling

Vietoris–Rips Complexes of Planar Point Sets

f\colon\,V(G)\to\{0,1,2\}

Multiple-Source Shortest Paths in Embedded Graphs

such that every vertex with label 0 has a neighbor with label 2. The Roman domination number

A case study of retention practices at the University of Illinois at Urbana-Champaign

\gamma_R(G)

Homology flows, cohomology cuts

of

Splitting (complicated) surfaces is hard

G

Testing contractibility in planar rips complexes

is the minimum of

Erosion thickness on medial axes of 3D shapes

\sum_{v\in V(G)}f(v)