Journal: JoCG

Volume 12, Issue 2

3 -- 24Alan Arroyo, Julien Bensmail, R. Bruce Richter. Extending Drawings of Graphs to Arrangements of Pseudolines
25 -- 54Sándor Kisfaludi-Bak. A quasi-polynomial algorithm for well-spaced hyperbolic TSP
55 -- 85Jeff Erickson 0001, Patrick Lin 0001. A Toroidal Maxwell-Cremona-Delaunay Correspondence
86 -- 125Ljubomir Perkovic, Michael Dennis 0001, Duru Türkoglu. The Stretch Factor of Hexagon-Delaunay Triangulations
126 -- 148Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
149 -- 175Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer. Worst-Case Optimal Squares Packing into Disks

Volume 12, Issue 1

1 -- 34Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic. Local routing in WSPD-based spanners
35 -- 39Ahmad Biniaz. A short proof of the toughness of Delaunay triangulations
40 -- 69Saladi Rahul. Approximate range counting revisited
70 -- 108Karl Bringmann, Marvin Künnemann, André Nusser. Walking the dog fast in practice: Algorithm engineering of the Fréchet distance
109 -- 127A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell. Planar bichromatic bottleneck spanning trees
128 -- 144Stav Ashur, Omrit Filtser, Matthew J. Katz. A constant-factor approximation algorithm for vertex guarding a WV-polygon
145 -- 177Sergey Avvakumov, Gabriel Nivasch. Homotopic curve shortening and the affine curve-shortening flow
178 -- 197David Eppstein. Cubic planar graphs that cannot be drawn on few lines