Abstract A k - page upward book embedding ( UBE) of a directed acyclic graph G is embeddings on pages with the additional requirement that vertices appear in topological ordering along spine book. The UBE Testing problem, which asks whether admits UBE, was introduced 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999). In companion paper, Heath Pemmaraju 28(5), 1999) proved problem ...