PGD

On the Recognition of Outerplanar Graphs with Queue Number 1
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
ACM Transactions on Algorithms, 2026.
Note: to appear
bib Project Project
Point Set Embeddability with List Constraints
Graph Drawing and Network Visualization (GD'26) (Löffler, Maarten and Miksch, Silvia), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
Realizing Planar Linkages in Polygonal Domains
International Workshop on Combinatorial Algorithms (IWOCA'26) (Foucaud, F. and Parreau, A.), volume 16587 of LNCS, pages 251-265, 2026, Springer.
bib Project DOI
Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
European Symposium on Algorithms (ESA'26) (Philip Bille, Seth Pettie, and Sabine Storandt), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
Routing Few Robots in a Crowded Network
Journal of Computer and System Sciences, 2026.
Note: to appear
bib Project Project Project
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
bib Project Project
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen and Michael Lampis), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
bib Project
The Parameterized Complexity of Coordinated Motion Planning
Discrete and Computational Geometry, 2026.
Note: to appear
bib Project Project