Vol. 4 No. 2 (2025)

Original Research Articles

• Guest Editors' Foreword

  Denis Pankratov, Jeff M. Phillips

  1:1-1:2

  • PDF

• Every Combinatorial Polyhedron Can Unfold with Overlap

  Joseph O'Rourke

  2:1-2:19

  • PDF

• On the Budgeted Hausdorff Distance Problem

  Sariel Har-Peled, Benjamin Raichel

  3:1-3:8

  • PDF

• Geometric Algorithms for k-NN Poisoning

  Diego Ihara Centurion, Karine Chubarian, Bohan Fan, Francesco Sgherzi, Thiruvenkadam Sivaprakasam Radhakrishnan, Anastasios Sidiropoulos, Angelo Straight

  4:1-4:12

  • PDF

• On the Complexity of Embedding in Graph Products

  Therese Biedl, David Eppstein, Torsten Ueckerdt

  5:1-5:18

  • PDF

• Approximating the Directed Hausdorff Distance

  Oliver Chubet, Parth Parikh, Donald Sheehy, Siddharth Sheth

  6:1-6:16

  • PDF