Parameterized Algorithms for Book Embedding Problems

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


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 problem of determining whether G admits a k-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thickness, or not fixed, called Book Thickness. Both problems are known to be NP-complete in general. We show that Fixed-Order Book Thickness and Book Thickness are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed-Order Book Thickness is fixed-parameter tractable parameterized by the pathwidth of the vertex order.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings
EditorsDaniel Archambault, Csaba D. Tóth
Number of pages14
ISBN (Print)9783030358013
StatePublished - 1 Jan 2019
Externally publishedYes
Event27th International Symposium on Graph Drawing and Network Visualization, GD 2019 - Prague, Czech Republic
Duration: 17 Sep 201920 Sep 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11904 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference27th International Symposium on Graph Drawing and Network Visualization, GD 2019
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Parameterized Algorithms for Book Embedding Problems'. Together they form a unique fingerprint.

Cite this