@inproceedings{f04ca355d2474b36a62052ceb86a0f69,

title = "Parameterized Algorithms for Queue Layouts",

abstract = "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.",

keywords = "Kernelization, Parameterized complexity, Queue number, Treedepth, Vertex cover number",

author = "Sujoy Bhore and Robert Ganian and Fabrizio Montecchiani and Martin N{\"o}llenburg",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 28th International Symposium on Graph Drawing and Network Visualization, GD 2020 ; Conference date: 16-09-2020 Through 18-09-2020",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-68766-3_4",

language = "English",

isbn = "9783030687656",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "40--54",

editor = "David Auber and Pavel Valtr",

booktitle = "Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Revised Selected Papers",

address = "Germany",

}