The following pages link to Erin Wolf Chambers (Q741613):
Displaying 44 items.
- (Q471136) (redirect page) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Vietoris-Rips complexes of planar point sets (Q977181) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Persistent homology over directed acyclic graphs (Q1713416) (← links)
- Density of local maxima of the distance function to a set of points in the plane (Q1713435) (← links)
- Constructing monotone homotopies and sweepouts (Q2073264) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- The zipper foldings of the diamond (Q2348605) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- Distances between immersed graphs: metric properties (Q2691630) (← links)
- Skeleton-Based Recognition of Shapes in Images via Longest Path Matching (Q2799975) (← links)
- (Q2825824) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Multiple-Source Shortest Paths in Embedded Graphs (Q2862202) (← links)
- (Q2934586) (← links)
- Minimum cycle and homology bases of surface-embedded graphs (Q2970476) (← links)
- Flows in One-Crossing-Minor-Free Graphs (Q3060737) (← links)
- Extremal Problems for Roman Domination (Q3583327) (← links)
- Walking your dog in the woods in polynomial time (Q3602907) (← links)
- Testing contractibility in planar rips complexes (Q3602926) (← links)
- Homotopy measures for representative trajectories (Q4606296) (← links)
- (Q4607960) (← links)
- Homology Flows, Cohomology Cuts (Q4910577) (← links)
- Flows in One-Crossing-Minor-Free Graphs (Q4913762) (← links)
- Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary (Q5111709) (← links)
- Homology flows, cohomology cuts (Q5172721) (← links)
- Counting and sampling minimum cuts in genus g graphs (Q5174485) (← links)
- Measuring similarity between curves on 2-manifolds via homotopy area (Q5174503) (← links)
- Medial Fragments for Segmentation of Articulating Objects in Images (Q5195306) (← links)
- Exploring 2D Shape Complexity (Q5195310) (← links)
- (Q5224476) (← links)
- Minimum cuts and shortest homologous cycles (Q5370738) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- (Q5881551) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (Q5894095) (← links)
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area (Q5894771) (← links)
- (Q6059174) (← links)
- Research networks for women (Q6160064) (← links)
- Algorithms for contractibility of compressed curves on 3-manifold boundaries (Q6174804) (← links)
