The following pages link to Algorithms – ESA 2005 (Q5475826):
Displaying 7 items.
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Separating and nonseparating disjoint homotopic cycles in graph embeddings (Q1924122) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Finding shortest non-trivial cycles in directed graphs on surfaces (Q2970447) (← links)
- The crossing number of a projective graph is quadratic in the face–width (Q3503476) (← links)
