Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)

Abstract

Full Citation:

Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi. Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.