Bodlaender, Hans; Grigoriev, Alexander - Maastricht : METEOR, Maastricht Research School of … - 2004
We consider graphs that can be embedded on a surface of bounded genus such that each edge has a bounded number of crossings. We prove that many optimization problems, including maximum independent set, minimum vertex cover, minimum dominating set and many others, admit polynomial time...