Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
PGD
Routing few robots in a crowded network
J. Comput. Syst. Sci.
, volume 157, pages 103753, 2026.
Argyrios Deligkas
,
Eduard Eiben
,
Robert Ganian
,
Iyad Kanj
,
Dominik Leko
,
M. S. Ramanujan
PDF
bib
Project
Project
Project
DOI
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
21st International Symposium on Parameterized and Exact Computation, IPEC 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Thomas Depian
,
Simon Dominik Fink
,
Alexander Firbas
,
Robert Ganian
,
Martin Nöllenburg
,
Marie Diana Sieper
bib
Project
Project
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Parameterized and Exact Computation (IPEC'26)
(Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
Thomas Depian
,
Simon Dominik Fink
,
Alexander Firbas
,
Robert Ganian
,
Martin Nöllenburg
,
Marie Diana Sieper
bib
Project
The Parameterized Complexity of Coordinated Motion Planning
Discrete and Computational Geometry
, 2026.
Note: to appear
Eduard Eiben
,
Robert Ganian
,
Iyad Kanj
bib
Project
Project
The Parameterized Complexity Of Extending Stack Layouts
Journal of Graph Algorithms and Applications
, volume 29, number 3, pages 39–78, 2026.
Thomas Depian
,
Simon Dominik Fink
,
Robert Ganian
,
Martin Nöllenburg
bib
Project
DOI
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
34th International Symposium on Graph Drawing and Network Visualization, GD 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Alexander Firbas
,
Robert Ganian
,
Sylvain Meunier
,
Martin Nöllenburg
bib
Project
Project
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Graph Drawing and Network Visualization (GD'26)
(Maarten Löffler, Silvia Miksch, eds.), volume 396 of
LIPIcs
, pages 16:1–16:19, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Alexander Firbas
,
Robert Ganian
,
Sylvain Meunier
,
Martin Nöllenburg
PDF
bib
Project
DOI
Visualizing Treewidth
J. Graph Algorithms Appl.
, volume 30, number 2, pages 199–235, 2026.
Alvin Chiu
,
Thomas Depian
,
David Eppstein
,
Michael T. Goodrich
,
Martin Nöllenburg
bib
Project
DOI
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
41st International Symposium on Computational Geometry, SoCG 2025, June 23-27, 2025, Kanazawa, Japan
(Oswin Aichholzer, Haitao Wang, eds.), volume 332 of
LIPIcs
, pages 44:1–44:15, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Eduard Eiben
,
Robert Ganian
,
Iyad Kanj
,
M. S. Ramanujan
PDF
bib
Project
Project
DOI
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity
SIAM J. Discret. Math.
, volume 39, number 4, pages 2102–2141, 2025.
Jakub Balabán
,
Robert Ganian
,
Mathis Teva Rocton
PDF
bib
Project
Project
DOI
«
»
bib
×