Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

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

Research output: Contribution to journalEditorial


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 languageEnglish
Article number6
Pages (from-to)82-123
Number of pages42
Journal Dagstuhl Seminar Reports
Issue number6
StatePublished - 1 Dec 2021


  • exact computation
  • graph algorithms
  • graph drawing
  • , parameterized complexity


Dive into the research topics of 'Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).'. Together they form a unique fingerprint.

Cite this