| No. |
Title |
Author |
Year |
| 1 |
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra |
Ito, Takehiro et al. |
2023 |
| 2 |
Reconfiguration of Colorings in Triangulations of the Sphere |
Ito, Takehiro et al. |
2023 |
| 3 |
Rerouting Planar Curves and Disjoint Paths |
Ito, Takehiro et al. |
2023 |
| 4 |
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds |
Banyassady, Bahareh et al. |
2022 |
| 5 |
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles |
Ito, Takehiro et al. |
2019 |
| 6 |
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain |
Arseneva, Elena et al. |
2018 |
| 7 |
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution) |
Buchin, Kevin et al. |
2017 |
| 8 |
Front Matter, Table of Contents, Preface, External Reviewers |
Okamoto, Yoshio et al. |
2017 |
| 9 |
LIPIcs, Volume 92, ISAAC'17, Complete Volume |
Okamoto, Yoshio et al. |
2017 |
| 10 |
Approximation and Hardness of Token Swapping |
Miltzow, Tillmann et al. |
2016 |
| 11 |
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain |
Won Bae, Sang et al. |
2016 |
| 12 |
08431 Open Problems -- Moderately Exponential Time Algorithms |
Fomin, Fedor V. et al. |
2008 |
