PGD

Not All Degree Constraints Are Created Equal when Computing Spanning Trees
21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
On the Complexity of Extending Storylines
Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
PDF bib Project
On the Recognition of Outerplanar Graphs with Queue Number 1
Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), 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) (Maarten Löffler, Silvia Miksch, eds.), 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
Perfect Rectangular Tilings with Two Colors
37th International Symposium on Algorithms and Computation, ISAAC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
bib Project Project
Point Set Embeddability with List Constraints
Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), 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) (F. Foucaud, A. Parreau, eds.), 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) (Seth Pettie, Philip Bille, Sabine Storandt, eds.), 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
J. Comput. Syst. Sci., volume 157, pages 103753, 2026.
PDF bib Project Project Project DOI