Parameterized Algorithms for Book Embedding Problems

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg

Abstract: A k -page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the...