People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
PGD
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
Robert Ganian
PDF
Cite
Project
Project
DOI
Minimizing Switches in Cased Graph Drawings
Robert Ganian
,
Martin Nöllenburg
,
Röder, Sebastian
Cite
Project
DOI
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Robert Ganian
PDF
Cite
Project
Project
DOI
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Liana Khazaliya
PDF
Cite
Project
Project
DOI
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Mathis Teva Rocton
PDF
Cite
Project
Project
DOI
The Parameterized Complexity of Extending Stack Layouts
Thomas Depian
,
Simon Dominik Fink
,
Robert Ganian
,
Martin Nöllenburg
PDF
Cite
Project
Project
DOI
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand
,
Robert Ganian
,
Sebastian Röder
,
Florian Schager
PDF
Cite
Project
Project
DOI
The Parameterized Complexity of Coordinated Motion Planning
Robert Ganian
PDF
Cite
Project
Project
DOI
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Liana Khazaliya
PDF
Cite
Project
Project
DOI
«
Cite
×