PGD

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

J. Graph Algorithms Appl., volume 28, number 2, pages 131-150, 2024.

Minimizing Switches in Cased Graph Drawings

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 43:1-43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract

Robert Ganian, Martin Nöllenburg, Röder, Sebastian

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 53:1-53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 66:1-66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Liana Khazaliya

The Complexity of Cluster Vertex Splitting and Company

Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau and Serge Gaspers and Ralf Klasing), volume 14519 of LNCS, pages 226-239, 2024, Springer.

Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann

The Parameterized Complexity Landscape of the Unsplittable Flow Problem

Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král and Martin Milanic), volume 14760 of Lecture Notes in Computer Science, pages 220-235, 2024, Springer.

Mathis Teva Rocton

The Parameterized Complexity of Extending Stack Layouts

Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg

The Parameterized Complexity Of Extending Stack Layouts

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner and Karsten Klein), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Simon Dominik Fink

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Bhore, Sujoy, Robert Ganian, Liana Khazaliya, Montecchiani, Fabrizio, Martin Nöllenburg

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers and Joachim Gudmundsson), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Liana Khazaliya