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.13.4.58
URN: urn:nbn:de:0030-drops-192393
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19239/
Go back to Dagstuhl Reports

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

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)

pdf-format:
dagrep_v013_i004_p058_23162.pdf (2 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 23162 "New Frontiers of Parameterized Complexity in Graph Drawing”. The seminar was held in-person from April 16 to April 21, 2023. It brought together 32 researchers from the Graph Drawing and the Parameterized Complexity research communities to discuss and explore new research frontiers 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.13.4.58,
  author =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana},
  title =	{{New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)}},
  pages =	{58--97},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{4},
  editor =	{Ganian, Robert and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Zehavi, Meirav and Khazaliya, Liana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19239},
  URN =		{urn:nbn:de:0030-drops-192393},
  doi =		{10.4230/DagRep.13.4.58},
  annote =	{Keywords: algorithm design, computational geometry, graph drawing, parameterized complexity}
}

Keywords: algorithm design, computational geometry, graph drawing, parameterized complexity
Collection: DagRep, Volume 13, Issue 4
Issue Date: 2023
Date of publication: 02.11.2023

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