מירב זהבי

אקדמי בכיר

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
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.
שפת פרסום אנגלית
דפים 82-123
כתב עת Dagstuhl Reports
כרך 11
נושא מספר 6
סטטוס פרסום פורסם - 01.12.2021
6

Keywords

exact computation
graph algorithms
graph drawing
, parameterized complexity
גישה למסמך
10.4230/DagRep.11.6.82