Parameterized Algorithms for Queue Layouts

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

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

3 Scopus citations


An h-queue layout of a graph G consists of a linear order of its vertices and a partition of its edges into h queues, such that no two independent edges of the same queue nest. The minimum h such that G admits an h-queue layout is the queue number of G. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts. As our first result, we show that deciding whether a graph G has queue number 1 and computing a corresponding layout is fixed-parameter tractable when parameterized by the treedepth of G. Our second result then uses a more restrictive parameter, the vertex cover number, to solve the problem for arbitrary h.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 28th International Symposium, GD 2020, Revised Selected Papers
EditorsDavid Auber, Pavel Valtr
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages15
ISBN (Print)9783030687656
StatePublished - 1 Jan 2020
Externally publishedYes
Event28th International Symposium on Graph Drawing and Network Visualization, GD 2020 - Virtual, Online
Duration: 16 Sep 202018 Sep 2020

Publication series

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


Conference28th International Symposium on Graph Drawing and Network Visualization, GD 2020
CityVirtual, Online


  • Kernelization
  • Parameterized complexity
  • Queue number
  • Treedepth
  • Vertex cover number

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Parameterized Algorithms for Queue Layouts'. Together they form a unique fingerprint.

Cite this