34

Multiple source shortest paths in a genus g graph
– Sergio Cabello, Erin W. Chambers

47

Multiplesource shortest paths in planar graphs
– Philip N Klein
 2005

212

Graphs on surfaces
– Bojan Mohar, Bojan Mohar
 2001

21

Optimally cutting a surface into a disk. Discrete Comput
– J Erickson, S HarPeled

167

Faster ShortestPath Algorithms for Planar Graphs
– Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian
 1994

163

Classical topology and combinatorial group theory
– J Stillwell
 1980

16

Graph and map isomorphism and all polyhedral embeddings in linear time
– Kenichi Kawarabayashi, Bojan Mohar, Bojan Mohar
 2008

18

Maximum (s, t)flows in planar networks in O(V  log V )time
– K Weihe
 1997

26

Minimum st cut of a planar undirected network in O(n log2 (n)) time
– J H Reif
 1983

28

An O(n log n) algorithm for maximum stflow in a directed planar graph
– Glencora Borradaile, Philip Klein

42

Dynamic Generators of Topologically Embedded Graphs
– Davod Eppstein
 2003

15

Finding one tight cycle
– Sergio Cabello, Matt Devos, Jeff Erickson

27

Computing crossing number in linear time
– Ki Kawarabayashi, B Reed
 2007

311

Handbook of graph theory
– J L Gross, J Yellen
 2003

45

Embeddings of graphs with no short noncontractible cycles
– C Thomassen
 1990

121

Fast algorithms for shortest paths in planar graphs, with applications
– G N Frederickson
 1987

19

Maximum flow in planar networks
– A Itai, Y Shiloach
 1979

8

Computing the shortest essential cycle
– Jeff Erickson, Pratik Worah
 2008

9

Minimum cut in directed planar networks
– L Janiga, V Koubek
 1992
