| No. |
Title |
Author |
Year |
| 1 |
Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles |
Kim, Mincheol et al. |
2022 |
| 2 |
Inscribing or Circumscribing a Histogon to a Convex Polygon |
Chung, Jaehoon et al. |
2022 |
| 3 |
Front Matter, Table of Contents, Preface, Conference Organization |
Ahn, Hee-Kap et al. |
2021 |
| 4 |
Largest Similar Copies of Convex Polygons in Polygonal Domains |
Eom, Taekang et al. |
2021 |
| 5 |
LIPIcs, Volume 212, ISAAC 2021, Complete Volume |
Ahn, Hee-Kap et al. |
2021 |
| 6 |
Maximum-Area Rectangles in a Simple Polygon |
Choi, Yujin et al. |
2019 |
| 7 |
Approximate Range Queries for Clustering |
Oh, Eunjin et al. |
2018 |
| 8 |
On Romeo and Juliet Problems: Minimizing Distance-to-Sight |
Ahn, Hee-Kap et al. |
2018 |
| 9 |
Point Location in Dynamic Planar Subdivisions |
Oh, Eunjin et al. |
2018 |
| 10 |
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms |
Oh, Eunjin et al. |
2017 |
| 11 |
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons |
Oh, Eunjin et al. |
2017 |
| 12 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |
| 13 |
Finding Pairwise Intersections of Rectangles in a Query Rectangle |
Oh, Eunjin et al. |
2017 |
| 14 |
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon |
Oh, Eunjin et al. |
2017 |
| 15 |
A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree |
Oh, Eunjin et al. |
2016 |
| 16 |
Assigning Weights to Minimize the Covering Radius in the Plane |
Oh, Eunjin et al. |
2016 |
| 17 |
Constrained Geodesic Centers of a Simple Polygon |
Oh, Eunjin et al. |
2016 |
| 18 |
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon |
Oh, Eunjin et al. |
2016 |
| 19 |
Overlap of Convex Polytopes under Rigid Motion |
Ahn, Hee-Kap et al. |
2012 |
