|
14
|
Minimum Cuts and Shortest Homologous Cycles
– Erin Chambers, Jeff Erickson, Amir Nayyeri
- 2009
|
|
|
Combinatorial Optimization of Cycles and Bases
– Jeff Erickson
|
|
11
|
Homology flows, cohomology cuts
– Erin W. Chambers, Jeff Erickson, Amir Nayyeri
- 2009
|
|
1
|
Global Minimum Cuts in Surface Embedded Graphs
– Jeff Erickson, Kyle Fox, Amir Nayyeri
|
|
3
|
Shortest non-trivial cycles in directed surface graphs
– Jeff Erickson
- 2011
|
|
1
|
Faster shortest non-contractible cycles in directed surface graphs
– Kyle Fox
|
|
18
|
Tightening Non-Simple Paths and Cycles on Surfaces
– Éric Colin de Verdière, Jeff Erickson
|
|
7
|
Computing the shortest essential cycle
– Jeff Erickson, Pratik Worah
- 2008
|
|
5
|
Output-Sensitive Algorithm for the Edge-Width of an Embedded Graph
– Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
- 2010
|
|
1
|
Testing Contractibility in Planar Rips Complexes ∗
– Erin W. Chambers, Jeff Erickson, Pratik Worah
- 2008
|
|
10
|
Finding one tight cycle
– Sergio Cabello, Matt Devos, Jeff Erickson
|
|
5
|
Multiplesource shortest paths in embedded graphs
– Sergio Cabello, Erin W. Chambers, Jeff Erickson
- 2012
|
|
5
|
Maximum Flows and Parametric Shortest Paths in Planar Graphs
– Jeff Erickson
|
|
5
|
Finding shortest non-trivial cycles in directed graphs on surfaces
– Sergio Cabello, Francis Lazarus, Éric Colin De Verdière
- 2010
|
|
22
|
Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time
– Martin Kutz
- 2005
|
|
32
|
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
– Sergio Cabello, Bojan Mohar
- 2005
|
|
|
Polynomial-time Approximation Schemes for . . .
– Glencora Borradaile, Erik D. Demaine, Siamak Tazari
- 2009
|
|
|
unknown title
– Glencora Borradaile, Erik D. Demaine, Technische Universität Darmstadt
- 902
|
|
|
Shortest Cut Graph of a Surface with Prescribed Vertex Set
– Éric Colin de Verdière
- 2010
|
