Theorem (B.M. 1999) For every surface S there is a linear time algorithm which, for a given graph G, either finds an embedding of G in S or returns a subgraph of G that is a subdivision of a ...