Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi

doi:10.4230/DagRep.11.6.82

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

Robert Ganian
, Fabrizio Montecchiani
, Martin Nöllenburg
, Meirav Zehavi

Research output: Contribution to journal › Editorial

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.

Original language	English
Article number	6
Pages (from-to)	82-123
Number of pages	42
Journal	Dagstuhl Seminar Reports
Volume	11
Issue number	6
DOIs	https://doi.org/10.4230/DagRep.11.6.82
State	Published - 1 Dec 2021

Keywords

exact computation
graph algorithms
graph drawing
, parameterized complexity

Access to Document

10.4230/DagRep.11.6.82

Cite this

@article{2edad799634f411b9edce336f22da6dd,

title = "Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).",

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

keywords = "exact computation, graph algorithms, graph drawing, , parameterized complexity",

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

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2021",

month = dec,

day = "1",

doi = "10.4230/DagRep.11.6.82",

language = "English",

volume = "11",

pages = "82--123",

journal = " Dagstuhl Seminar Reports",

issn = "2192-5283",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH",

number = "6",

}

TY - JOUR

T1 - Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

AU - Ganian, Robert

AU - Montecchiani, Fabrizio

AU - Nöllenburg, Martin

AU - Zehavi, Meirav

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2021/12/1

Y1 - 2021/12/1

N2 - 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.

AB - 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.

KW - exact computation

KW - graph algorithms

KW - graph drawing

KW - , parameterized complexity

U2 - 10.4230/DagRep.11.6.82

DO - 10.4230/DagRep.11.6.82

M3 - Editorial

SN - 2192-5283

VL - 11

SP - 82

EP - 123

JO - Dagstuhl Seminar Reports

JF - Dagstuhl Seminar Reports

IS - 6

M1 - 6

ER -

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

Abstract

Keywords

Access to Document

Fingerprint

Cite this