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

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

doi:https://doi.org/10.4230/DagRep.13.4.58

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

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

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Article number	4
Pages (from-to)	58-97
Number of pages	40
Journal	Dagstuhl Reports
Volume	13
Issue number	4
DOIs	https://doi.org/10.4230/DagRep.13.4.58
State	Published - 2 Nov 2023

Keywords

algorithm design
computational geometry
graph drawing
parameterized complexity

Access to Document

https://doi.org/10.4230/DagRep.13.4.58

Cite this

@article{a8c296a7dee945f498ef1760335e9505,

title = "New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).",

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

keywords = "algorithm design, computational geometry, graph drawing, parameterized complexity",

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

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 = "2023",

month = nov,

day = "2",

doi = "https://doi.org/10.4230/DagRep.13.4.58",

language = "American English",

volume = "13",

pages = "58--97",

number = "4",

}

TY - JOUR

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

AU - Ganian, Robert

AU - Montecchiani, Fabrizio

AU - Nöllenburg, Martin

AU - Zehavi, Meirav

AU - Khazaliya, Liana

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 - 2023/11/2

Y1 - 2023/11/2

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

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

KW - algorithm design

KW - computational geometry

KW - graph drawing

KW - parameterized complexity

U2 - https://doi.org/10.4230/DagRep.13.4.58

DO - https://doi.org/10.4230/DagRep.13.4.58

M3 - Article

SN - 2192-5283

VL - 13

SP - 58

EP - 97

JO - Dagstuhl Reports

JF - Dagstuhl Reports

IS - 4

M1 - 4

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this