DagRep.13.4.58.pdf
- Filesize: 2.32 MB
- 40 pages
Document
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 13, Issue 4
Volume: Dagstuhl Reports, Volume 13
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-11-02
Cite AsGet BibTex
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, and Liana Khazaliya. New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). In Dagstuhl Reports, Volume 13, Issue 4, pp. 58-97, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/DagRep.13.4.58
https://doi.org/10.4230/DagRep.13.4.58
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Parameterized complexity and exact algorithms
- Theory of computation → Computational geometry
Keywords
- algorithm design
- computational geometry
- graph drawing
- parameterized complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads