Abstract. Using an exhaustive computer search, we found the number of minimum genus orientable embeddings of the complete bipartite graph K_m,n for 2≤m,n≤7 except for (m,n)=(7,7).