The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.11.6.82
URN: urn:nbn:de:0030-drops-155817
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15581/
Go back to Dagstuhl Reports

Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav
Weitere Beteiligte (Hrsg. etc.): Robert Ganian and Fabrizio Montecchiani and Martin Nöllenburg and Meirav Zehavi

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

pdf-format:
dagrep_v011_i006_p082_21293.pdf (6 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 21293 "Parameterized Complexity in Graph Drawing". The seminar was held mostly in-person from July 18 to July 23, 2021. It brought together 28 researchers from the Graph Drawing and the Parameterized Complexity research communities with the aim to discuss and explore open research questions on the interface between the two fields. The report collects the abstracts of talks and open problems presented in the seminar, as well as brief progress reports from the working groups.

BibTeX - Entry

@Article{ganian_et_al:DagRep.11.6.82,
  author =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav},
  title =	{{Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)}},
  pages =	{82--123},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15581},
  URN =		{urn:nbn:de:0030-drops-155817},
  doi =		{10.4230/DagRep.11.6.82},
  annote =	{Keywords: exact computation, graph algorithms, graph drawing, parameterized complexity}
}

Keywords: exact computation, graph algorithms, graph drawing, parameterized complexity
Collection: DagRep, Volume 11, Issue 6
Issue Date: 2021
Date of publication: 01.12.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI