Journal of Computational Geometry

Articles

• Approximating longest spanning tree with neighborhoods

  Ahmad Biniaz

  1–13

  • PDF

• Reverse shortest path problem for unit-disk graphs

  Haitao Wang, Yiming Zhao

  14–47

  • PDF

• An SPQR-tree-like embedding representation for level planarity

  Guido Brückner, Ignaz Rutter

  48–77

  • PDF

• The Gromov-Hausdorff distance between ultrametric spaces: its structure and computation

  Facundo Mémoli, Zane Smith, Zhengchao Wan

  78–143

  • PDF

• On the independence number of intersection graphs of axis-parallel segments

  Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

  144–156

  • PDF

• A 10-Approximation of the π/2 -MST

  Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour

  157–173

  • PDF

• Recognizing and realizing inductively pierced codes

  Nora Youngs, R. Amzi Jeffs, Ryan Curry, Ziyu Zhao

  174–194

  • PDF

• Geometric algorithms for sampling the flux space of metabolic networks

  Apostolos Chalkis, Ioannis Emiris, Vissarion Fisikopoulos, Elias Tsigaridas, Haris Zafeiropoulos

  195–220

  • PDF

• A coupled alpha complex

  Yohai Reani, Omer Bobrowski

  221–256

  • PDF

• Approximate vertex enumeration

  Andreas Löhne

  257–286

  • PDF

• Constructing many faces in arrangements of lines and segments

  Haitao Wang

  287–308

  • PDF

• Asymptotic improvements on the exact matching distance for $2$-parameter persistence

  Havard Bakke Bjerkevik, Michael Kerber

  309–342

  • PDF

• Unit-disk range searching and applications

  Haitao Wang

  343–394

  • PDF