Document Open Access Logo

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

Authors Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.11.6.82.pdf
  • Filesize: 5.74 MB
  • 42 pages

Document Identifiers

Author Details

Robert Ganian
  • TU Wien, AT
Fabrizio Montecchiani
  • University of Perugia, IT
Martin Nöllenburg
  • TU Wien, AT
Meirav Zehavi
  • Ben-Gurion University, IL
and all authors of the abstracts in this report

Cite AsGet BibTex

Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, and Meirav Zehavi. Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). In Dagstuhl Reports, Volume 11, Issue 6, pp. 82-123, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/DagRep.11.6.82

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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • exact computation
  • graph algorithms
  • graph drawing
  • parameterized complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail