There is a simple polynomial-time algorithm for finding a shortest two-sided cycle of an embedded graph. Note that this problem does not use the embedding except for the signatures. So, this is also ...