Last update:
Thu Aug 13 09:42:11 MDT 2020
Kenneth L. Clarkson and
Günter Rote Welcome from the Editors-in-Chief . . . 1--2
David Eppstein Happy endings for flip graphs . . . . . 3--28
Attila Pór and
David R. Wood On visibility and blockers . . . . . . . 29--40
Prosenjit Bose and
Paz Carmi and
Sébastien Collette and
Michiel Smid On the stretch factor of convex Delaunay
graphs . . . . . . . . . . . . . . . . . 41--56
Mark de Berg and
Herman Haverkort and
Constantinos P. Tsirogiannis Visibility maps of realistic terrains
have linear smoothed complexity . . . . 57--71
Gunnar Carlsson and
Gurjeet Singh and
Afra J. Zomorodian Computing multidimensional persistence 72--100
Christian Wulff-Nilsen Computing the maximum detour of a plane
geometric graph in subquadratic time . . 101--122
Maarten Löffler and
Elena Mumford Connected rectilinear graphs on point
sets . . . . . . . . . . . . . . . . . . 1--15
Adrian Dumitrescu Approximate Euclidean Ramsey theorems 16--29
Olivier Devillers Delaunay triangulation of imprecise
points: preprocess and actually get a
fast query time . . . . . . . . . . . . 30--45
Tetsuo Asano and
Wolfgang Mulzer and
Günter Rote and
Yajun Wang Constant-work-space algorithms for
geometric problems . . . . . . . . . . . 46--68
Sriram V. Pemmaraju and
Imran A. Pirwani Good quality virtual realization of unit
disk graphs . . . . . . . . . . . . . . 69--91
Herman Haverkort Recursive tilings and space-filling
curves with little fragmentation . . . . 92--127
Roel Apfelbaum and
Itay Ben-Dan and
Stefan Felsner and
Tillmann Miltzow and
Rom Pinchasi and
Torsten Ueckerdt and
Ran Ziv Points with large quadrant depth . . . . 128--143
David Eppstein Optimally fast incremental Manhattan
plane embedding and planar tight span
construction . . . . . . . . . . . . . . 144--182
Martin Tancer $d$-representability of simplicial
complexes of fixed dimension . . . . . . 183--188
Christian Knauer and
Andreas Spillner A fixed-parameter algorithm for the
minimum Manhattan network problem . . . 189--204
Jie Gao and
Dengpan Zhou The emergence of sparse spanners and
well-separated pair decomposition under
anarchy . . . . . . . . . . . . . . . . 1--19
Boris Bukh and
Gabriel Nivasch Upper bounds for centerlines . . . . . . 20--30
Martin Fürer and
Shiva Prasad Kasiviswanathan Spanners for geometric intersection
graphs with applications . . . . . . . . 31--64
Sariel Har-Peled and
Mira Lee Weighted geometric set cover problems
revisited . . . . . . . . . . . . . . . 65--85
Ruy Fabila-Monroy and
David R. Wood Colouring the triangles determined by a
point set . . . . . . . . . . . . . . . 86--101
Nieves Atienza and
Natalia de Castro and
Carmen Cortés and
M. Ángeles Garrido and
Clara I. Grima and
Gregorio Hernández and
Alberto Márquez and
Auxiliadora Moreno-González and
Martin Nöllenburg and
José Ramón Portillo and
Pedro Reyes and
Jesús Valenzuela and
Maria Trinidad Villar and
Alexander Wolff Cover contact graphs . . . . . . . . . . 102--131
Siu-Wing Cheng and
Christian Knauer and
Stefan Langerman and
Michiel Smid Approximating the average stretch factor
of geometric graphs . . . . . . . . . . 132--153
Bette Bultena and
Matthew Klimesh and
Frank Ruskey Minimum area polyomino Venn diagrams . . 154--167
Bernd Gärtner and
Martin Jaggi and
Clément Maria An exponential lower bound on the
complexity of regularization paths . . . 168--195
Paz Carmi and
Michiel Smid An optimal algorithm for computing
angle-constrained spanners . . . . . . . 196--221
Mark de Berg and
Marcel Roeloffzen and
Bettina Speckmann Kinetic convex hulls, Delaunay
triangulations and connectivity
structures in the black-box model . . . 222--249
Gabriel Nivasch and
János Pach and
Rom Pinchasi and
Shira Zerbib The number of distinct distances from a
vertex of a convex polygon . . . . . . . 1--12
Michael Kerber Embedding the dual complex of
hyper-rectangular partitions . . . . . . 13--37
Anne Driemel and
Herman Haverkort and
Maarten Löffler and
Rodrigo I. Silveira Flow computations on imprecise terrains 38--78
Adrian Dumitrescu Metric inequalities for polygons . . . . 79--93
Bodo Manthey and
Heiko Röglin Worst-case and smoothed analysis of
$k$-means clustering with Bregman
divergences . . . . . . . . . . . . . . 94--132
Sharif Ibrahim and
Bala Krishnamoorthy and
Kevin R. Vixie Simplicial flat norm with scale . . . . 133--159
Steven J. Gortler and
Craig Gotsman and
Ligang Liu and
Dylan P. Thurston On affine rigidity . . . . . . . . . . . 160--181
Prosenjit Bose and
Kai Dannies and
Jean-Lou De Carufel and
Christoph Doell and
Carsten Grimm and
Anil Maheshwari and
Stefan Schirra and
Michiel Smid Network farthest-point diagrams and
their application to feed-link network
extension . . . . . . . . . . . . . . . 182--211
Mark de Berg and
Krzysztof Onak and
Anastasios Sidiropoulos Fat polygonal partitions with
applications to visualization and
embeddings . . . . . . . . . . . . . . . 212--239
Jean Cardinal and
Kolja Knauer and
Piotr Micek and
Torsten Ueckerdt Making triangles colorful . . . . . . . 240--246
Maarten Löffler and
Wolfgang Mulzer Unions of onions: preprocessing
imprecise points for fast onion
decomposition . . . . . . . . . . . . . 1--13
Reza Dorrigiv and
Stephane Durocher and
Arash Farzan and
Robert Fraser and
Alejandro López-Ortiz and
J. Ian Munro and
Alejandro Salinger and
Matthew Skala The Hausdorff core problem on simple
polygons . . . . . . . . . . . . . . . . 14--40
Michael S. Payne and
Jens M. Schmidt and
David R. Wood Which point sets admit a $k$-angulation? 41--55
Mikhail Bogdanov and
Olivier Devillers and
Monique Teillaud Hyperbolic Delaunay complexes and
Voronoi diagrams made practical . . . . 56--85
Adrian Dumitrescu and
Sariel Har-Peled and
Csaba D. Tóth Minimum convex partitions and maximum
empty polytopes . . . . . . . . . . . . 86--103
Zsolt Gáspár and
Tibor Tarnai and
Krisztián Hincz Partial covering of a circle by equal
circles. Part I: the mechanical models 104--125
Zsolt Gáspár and
Tibor Tarnai and
Krisztián Hincz Partial covering of a circle by equal
circles. Part II: the case of 5 circles 126--149
Oswin Aichholzer and
Greg Aloupis and
Erik D. Demaine and
Martin L. Demaine and
Sándor P. Fekete and
Michael Hoffmann and
Anna Lubiw and
Jack Snoeyink and
Andrew Winslow Covering folded shapes . . . . . . . . . 150--167
Matt Gibson and
Gaurav Kanade and
Erik Krohn and
Kasturi Varadarajan Guarding terrains via local search . . . 168--178
David Eppstein and
Elena Mumford Steinitz theorems for simple orthogonal
polyhedra . . . . . . . . . . . . . . . 179--244
Vytautas Gruslys A counterexample to a geometric
Hales--Jewett type conjecture . . . . . 245--249
Stefan König Computational aspects of the Hausdorff
distance in unbounded dimension . . . . 250--274
Mark Kozdoba On projections of metric spaces . . . . 275--283
Abdul Basit and
Adam Sheffer Incidences with $k$-non-degenerate sets
and their applications . . . . . . . . . 284--302
Michael A. Bekos and
Chrysanthi N. Raftopoulou On a conjecture of Lovász on
circle-representations of simple
4-regular planar graphs . . . . . . . . 1--20
Menelaos I. Karavelas and
Christos Konaxis and
Eleni Tzanaki The maximum number of faces of the
Minkowski sum of three convex polytopes 21--74
Kevin Buchin and
Maike Buchin and
Marc van Kreveld and
Bettina Speckmann and
Frank Staals Trajectory grouping structure . . . . . 75--98
Pedro Mart\'\in and
Horst Martini Algorithms for ball hulls and ball
intersections in normed planes . . . . . 99--107
William Evans and
Noushin Saeedi On characterizing terrain visibility
graphs . . . . . . . . . . . . . . . . . 108--141
Luc Devroye and
James King Random hyperplane search trees in high
dimensions . . . . . . . . . . . . . . . 142--164
Magnus Lie Hetland Ptolemaic indexing . . . . . . . . . . . 165--184
Andrei Asinowski and
Tillmann Miltzow and
Günter Rote Quasi-parallel segments and
characterizations of unique bichromatic
matchings . . . . . . . . . . . . . . . 185--219
Santanu Bhowmick and
Kasturi Varadarajan and
Shi-Ke Xue A constant-factor approximation for
multi-covering with disks . . . . . . . 220--234
Ronald Ortner Forcing subarrangements in complete
arrangements of pseudocircles . . . . . 235--248
Christian Scheffer and
Jan Vahrenhold Subquadratic medial-axis approximation
in $ \mathbb {R}^3 $ . . . . . . . . . . 249--287
John C. Baez and
Karine Bagdasaryan and
Philip Gibbs The Lebesgue universal covering problem 288--299
Balázs Keszegh and
Dömötör Pálvölgyi More on decomposing coverings by octants 300--315
Danny Z. Chen and
Haitao Wang A new algorithm for computing visibility
graphs of polygonal obstacles in the
plane . . . . . . . . . . . . . . . . . 316--345
Siu-Wing Cheng and
Olivier Devillers Guest Editors' Foreword . . . . . . . . 1--1
Tal Kaminker and
Micha Sharir Finding the largest disk containing a
query point in logarithmic time with
linear storage . . . . . . . . . . . . . 3--18
Luis Barba and
Prosenjit Bose and
Mirela Damian and
Rolf Fagerberg and
Wah Loon Keng and
Joseph O'Rourke and
André van Renssen and
Perouz Taslakian and
Sander Verdonschot and
Ge Xia New and improved spanning ratios for Yao
graphs . . . . . . . . . . . . . . . . . 19--53
Anna Gundert and
May Szedlák Higher dimensional discrete Cheeger
inequalities . . . . . . . . . . . . . . 54--71
Sander P. A. A. Alewijnse and
Timur M. Bagautdinov and
Mark de Berg and
Quirijn W. Bouts and
Alex P. ten Brink and
Kevin Buchin and
Michel A. Westenberg Progressive geometric algorithms . . . . 72--92
Bernd Gärtner Sampling with removal in LP-type
problems . . . . . . . . . . . . . . . . 93--112
Shay Solomon Euclidean Steiner shallow--light trees 113--139
Frédéric Chazal and
Brittany Terese Fasy and
Fabrizio Lecci and
Alessandro Rinaldo and
Larry Wasserman Stochastic convergence of persistence
landscapes and silhouettes . . . . . . . 140--161
Ulrich Bauer and
Michael Lesnick Induced matchings and the algebraic
stability of persistence barcodes . . . 162--191
Maria Axenovich and
Torsten Ueckerdt Density of range capturing hypergraphs 1--21
David Eppstein and
Danny Holten and
Maarten Löffler and
Martin Nöllenburg and
Bettina Speckmann and
Kevin Verbeek Strict confluent drawing . . . . . . . . 22--46
Martin Nöllenburg and
Roman Prutkin and
Ignaz Rutter On self-approaching and increasing-chord
drawings of $3$-connected planar graphs 47--69
Benjamin A. Burton and
Murray Elder and
Arkadius Kalka and
Stephan Tillmann $2$-manifold recognition is in logspace 70--85
Marc Glisse and
Sylvain Lazard and
Julien Michel and
Marc Pouget Silhouette of a random polytope . . . . 86--99
Kevin Buchin and
David Eppstein and
Maarten Löffler and
Martin Nöllenburg and
Rodrigo I. Silveira Adjacency-preserving spatial treemaps 100--122
Sergio Cabello and
Éric Colin de Verdi\`ere and
Francis Lazarus Finding shortest non-trivial cycles in
directed graphs on surfaces . . . . . . 123--148
Romanos-Diogenes Diogenes Malikiosis and
Sinai Robins and
Yichi Zhang Polyhedral Gauss sums, and polytopes
with symmetry . . . . . . . . . . . . . 149--170
Zachary Abel and
Jason Cantarella and
Erik D. Demaine and
David Eppstein and
Thomas C. Hull and
Jason S. Ku and
Robert J. Lang and
Tomohiro Tachi Rigid origami vertices: conditions and
forcing sets . . . . . . . . . . . . . . 171--184
Rafel Jaume and
Günter Rote Recursively regular subdivisions and
applications . . . . . . . . . . . . . . 185--220
Nikhil Bansal and
Kirk Pruhs Weighted geometric set multi-cover via
quasi-uniform sampling . . . . . . . . . 221--236
Stephan Tillmann and
Sampson Wong An algorithm for the Euclidean cell
decomposition of a cusped strictly
convex projective surface . . . . . . . 237--255
Stephan Friedrichs and
Michael Hemmer and
James King and
Christiane Schmidt The continuous 1.5D terrain guarding
problem: discretization, optimal
solutions, and PTAS . . . . . . . . . . 256--284
Sharif Ibrahim and
Bala Krishnamoorthy and
Kevin R. Vixie Flat norm decomposition of integral
currents . . . . . . . . . . . . . . . . 285--307
Andreas Gemsa and
Martin Nöllenburg and
Ignaz Rutter Consistent labeling of rotating maps . . 308--331
Olivier Devillers and
Ross Hemsley The worst visibility walk in a random
Delaunay triangulation is $ O(\sqrt n) $ 332--359
Christian Scheffer Near-linear time medial-axis
approximation of smooth curves in $
\mathbb {R}^3 $ . . . . . . . . . . . . 360--429
Dominique Attali and
Olivier Devillers and
Marc Glisse and
Sylvain Lazard Recognizing shrinkable complexes is
NP-complete . . . . . . . . . . . . . . 430--443
Prosenjit Bose and
Paz Carmi and
Mirela Damian and
Jean-Lou De Caroufel and
Darryl Hill and
Anil Maheshwari and
Yuyang Liu and
Michiel Smid On the stretch factor of convex
polyhedra whose vertices are (almost) on
a sphere . . . . . . . . . . . . . . . . 444--472
Danny Z. Chen and
Rajasekhar Inkulu and
Haitao Wang Two-point $ L_1 $ shortest path queries
in the plane . . . . . . . . . . . . . . 473--519
Mahdi Amani and
Ahmad Biniaz and
Prosenjit Bose and
Jean-Lou De Carufel and
Anil Maheshwari and
Michiel Smid A plane $ 1.88$-spanner for points in
convex position . . . . . . . . . . . . 520--539
Matt Gibson and
Gaurav Kanade and
Rainer Penninger and
Kasturi Varadarajan and
Ivo Vigan On isolating points using unit disks . . 540--557
Ho-Lin Chen and
David Doty and
Ján Ma\vnuch and
Arash Rafiey and
Ladislav Stacho Pattern overlap implies runaway growth
in hierarchical tile systems . . . . . . 3--18
Sariel Har-Peled Shortest path in a polygon using
sublinear space . . . . . . . . . . . . 19--45
Karl Bringmann and
Wolfgang Mulzer Approximability of the discrete Fréchet
distance . . . . . . . . . . . . . . . . 46--76
Esther M. Arkin and
Alon Efrat and
Christian Knauer and
Joseph S. B. Mitchell and
Valentin Polishchuk and
Günter Rote and
Lena Schlipf and
Topi Talvitie Shortest path to a segment and quickest
visibility queries . . . . . . . . . . . 77--100
Olivier Devillers and
Marc Glisse and
Xavier Goaoc and
Rémy Thomasse Smoothed complexity of convex hulls by
witnesses and collectors . . . . . . . . 101--144
Arie Bos and
Herman Haverkort Hyperorthogonal well-folded Hilbert
curves . . . . . . . . . . . . . . . . . 145--190
Therese Biedl and
Martin Derka $1$-string $ B_2 $-VPG representation of
planar graphs . . . . . . . . . . . . . 191--215
Helmut Alt and
Mark de Berg and
Christian Knauer Approximating minimum-area rectangular
and convex containers for packing convex
polygons . . . . . . . . . . . . . . . . 1--10
Ahmad Biniaz and
Prosenjit Bose and
Jean-Lou De Carufel and
Cyril Gavoille and
Anil Maheshwari and
Michiel Smid Towards plane spanners of degree 3 . . . 11--31
Jean-Lou De Carufel and
Matthew J. Katz and
Matias Korman and
André van Renssen and
Marcel Roeloffzen and
Shakhar Smorodinsky On interference among moving sensors and
related problems . . . . . . . . . . . . 32--46
Manuel Wettstein Counting and enumerating crossing-free
geometric graphs . . . . . . . . . . . . 47--77
Stephane Durocher and
Alexandre Leblanc and
Matthew Skala The projection median as a weighted
average . . . . . . . . . . . . . . . . 78--104
Boris Aronov and
Matias Korman and
Simon Pratt and
André van Renssen and
Marcel Roeloffzen Time-space trade-off algorithms for
triangulating a simple polygon . . . . . 105--124
Prosenjit Bose and
Rolf Fagerberg and
André van Renssen and
Sander Verdonschot Competitive local routing with
constraints . . . . . . . . . . . . . . 125--152
Arnaud Bannier and
Nicolas Bodin A new drawing for simple Venn diagrams
based on algebraic construction . . . . 153--173
Boris Bukh and
Po-Shen Loh and
Gabriel Nivasch Classifying unavoidable Tverberg
partitions . . . . . . . . . . . . . . . 174--205
Herman Haverkort How many three-dimensional Hilbert
curves are there? . . . . . . . . . . . 206--281
Olivier Devillers and
Menelaos I. Karavelas and
Monique Teillaud Qualitative symbolic perturbation: two
applications of a new geometry-based
perturbation framework . . . . . . . . . 282--315
David Eppstein Maximizing the sum of radii of disjoint
balls or disks . . . . . . . . . . . . . 316--339
Sándor P. Fekete and
Andreas Haas and
Michael Hemmer and
Michael Hoffmann and
Irina Kostitsyna and
Dominik Krupke and
Florian Maurer and
Joseph S. B. Mitchell and
Arne Schmidt and
Christiane Schmidt and
Julian Troegel Computing nonsimple polygons of minimum
perimeter . . . . . . . . . . . . . . . 340--365
Marc van Kreveld and
Maarten Löffler and
Frank Staals Central trajectories . . . . . . . . . . 366--386
Sándor P. Fekete and
Anna Lubiw Guest Editors' foreword [special issue
of selected papers from SoCG2016] . . . 1--1
Iyad Kanj and
Ljubomir Perkovi\'c and
Duru Türko\uglu Degree four plane spanners: Simpler and
better . . . . . . . . . . . . . . . . . 3--31
Martin Fink and
John Hershberger and
Nirman Kumar and
Subhash Suri Hyperplane separability and convexity of
probabilistic point sets . . . . . . . . 32--57
Glencora Borradaile and
Erin Wolf Chambers and
Kyle Fox and
Amir Nayyeri Minimum cycle and homology bases of
surface-embedded graphs . . . . . . . . 58--79
Irina Kostitsyna and
Maarten Löffler and
Valentin Polishchuk and
Frank Staals On the complexity of minimum-link path
problems . . . . . . . . . . . . . . . . 80--108
Markus Geyer and
Michael Hoffmann and
Michael Kaufmann and
Vincent Kusters and
Csaba D. Tóth The planar tree packing theorem . . . . 109--177
Sándor P. Fekete and
Winfried Hellmann and
Michael Hemmer and
Arne Schmidt and
Julian Troegel Computing maxmin edge length
triangulations . . . . . . . . . . . . . 1--26
Moritz Baum and
Thomas Bläsius and
Andreas Gemsa and
Ignaz Rutter and
Franziska Wegner Scalable exact visualization of
isocontours in road networks via
minimum-link paths . . . . . . . . . . . 27--73
Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
David Eppstein and
Anna Lubiw and
Ryuhei Uehara Flat foldings of plane graphs with
prescribed angles and edge lengths . . . 74--93
Giordano Da Lozzo and
Vida Dujmovi\'c and
Fabrizio Frati and
Tamara Mchedlidze and
Vincenzo Roselli Drawing planar graphs with many
collinear vertices . . . . . . . . . . . 94--130
Haitao Wang On the geodesic centers of polygonal
domains . . . . . . . . . . . . . . . . 131--190
Bahareh Banyassady and
Matias Korman and
Wolfgang Mulzer and
André van Renssen and
Marcel Roeloffzen and
Paul Seiferth and
Yannik Stein Improved time-space trade-offs for
computing Voronoi diagrams . . . . . . . 191--212
Jean Cardinal and
Stefan Felsner Topological drawings of complete
bipartite graphs . . . . . . . . . . . . 213--246
Luca Castelli Aleardi and
Olivier Devillers Array-based compact data structures for
triangulations: practical solutions with
theoretical guarantees . . . . . . . . . 247--289
Linda Kleist Drawing planar graphs with prescribed
face areas . . . . . . . . . . . . . . . 290--311
Helmut Alt and
Kevin Buchin and
Steven Chaplick and
Otfried Cheong and
Philipp Kindermann and
Christian Knauer and
Fabian Stehn Placing your coins on a shelf . . . . . 312--327
Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Maarten Löffler and
Martin Nöllenburg Planar and poly-arc Lombardi drawings 328--355
Vida Dujmovi\vc and
David R. Wood Thickness and antithickness of graphs 356--386
Peter Frankl and
János Pach A stability theorem on cube
tessellations . . . . . . . . . . . . . 387--390
Luca Castelli Aleardi and
Olivier Devillers and
Éric Fusy Canonical ordering for graphs on the
cylinder, with applications to periodic
straight-line drawings on the flat
cylinder and torus . . . . . . . . . . . 391--429
Prosenjit Bose and
Matias Korman and
André van Renssen and
Sander Verdonschot Routing on the visibility graph . . . . 430--453
Timothy M. Chan Applications of Chebyshev polynomials to
low-dimensional computational geometry 3--20
Mickaël Buchet and
Tamal K. Dey and
Jiayuan Wang and
Yusu Wang Declutter and resample: towards
parameter free denoising . . . . . . . . 21--46
Csaba Biró and
Édouard Bonnet and
Dániel Marx and
Tillmann Miltzow and
Pawe\l Rz\ka\.zewski Fine-grained complexity of coloring unit
disks and balls . . . . . . . . . . . . 47--80
Balázs Keszegh and
Dömötör Pálvölgyi An abstract approach to polychromatic
coloring: shallow hitting sets in
ABA-free hypergraphs and
pseudohalfplanes . . . . . . . . . . . . 1--26
Timothy M. Chan and
Dimitrios Skrepetos All-pairs shortest paths in geometric
intersection graphs . . . . . . . . . . 27--41
Jisu Kim and
Alessandro Rinaldo and
Larry Wasserman Minimax rates for estimating the
dimension of a manifold . . . . . . . . 42--95
Erin Wolf Chambers and
Yusu Wang Measuring similarity between curves on
$2$-manifolds via homotopy area . . . . 96--126
Kolja Knauer and
Daniel Gonçalves and
Benjamin Leveque On the structure of Schnyder woods on
orientable surfaces . . . . . . . . . . 127--163
Saul Schleimer and
Arnaud de Mesmay and
Jessica Purcell and
Eric Sedgwick On the tree-width of knot diagrams . . . 164--180
Edouard Bonnet and
Panos Giannopoulos and
Michael Lampis On the parameterized complexity of
red--blue points separation . . . . . . 181--206
Mark de Berg and
Sergio Cabello and
Otfried Cheong and
David Eppstein and
Christian Knauer Covering many points with a small-area
box . . . . . . . . . . . . . . . . . . 207--222
Ramsay Dyer and
Gert Vegter and
Mathijs Hubertus Maria Johannes Wintraecken Simplices modelled on spaces of constant
curvature . . . . . . . . . . . . . . . 223--256
David Eppstein Realization and connectivity of the
graphs of origami flat foldings . . . . 257--280
Timothy M. Chan and
Dimitrios Skrepetos Approximate shortest paths and distance
oracles in weighted unit-disk graphs . . 3--20
Édouard Bonnet and
Panos Giannopoulos Orthogonal Terrain Guarding is
NP-complete . . . . . . . . . . . . . . 21--44
Fabian Klute and
Martin Nöllenburg Minimizing crossings in constrained
two-sided circular graph layouts . . . . 45--69
Kristóf Huszár and
Jonathan Spreer and
Uli Wagner On the treewidth of triangulated
$3$-manifolds . . . . . . . . . . . . . 70--98
Jean Cardinal and
Timothy M. Chan and
John Iacono and
Stefan Langerman and
Aurélien Ooms Subquadratic encodings for point
configurations . . . . . . . . . . . . . 99--126
Vincent Divol and
Frédéric Chazal The density of expected persistence
diagrams and its kernel based estimation 127--153
Marc van Kreveld and
Maarten Löffler and
Lionov Wiratma On optimal polyline simplification using
the Hausdorff and Fréchet distance . . . 1--25
Gill Barequet and
David Eppstein and
Michael Goodrich and
Nil Mamano Stable-matching Voronoi diagrams:
Combinatorial complexity and algorithms 26--59
Adrian Dumitrescu and
Ritankar Mandal New lower bounds for the number of
pseudoline arrangements . . . . . . . . 60--92
Hugo Akitaya and
Erik Demaine and
Takashi Horiyama and
Thomas Hull and
Jason Ku and
Tomohiro Tachi Rigid foldability is NP-hard . . . . . . 93--124
Robert Cyrus Haraway and
III Determining hyperbolicity of compact
orientable $3$-manifolds with torus
boundary . . . . . . . . . . . . . . . . 125--136
Manuel Borrazzo and
Fabrizio Frati On the planar edge-length ratio of
planar graphs . . . . . . . . . . . . . 137--155
Omrit Filtser and
Matthew Katz Algorithms for the discrete Fréchet
distance under translation . . . . . . . 156--175
Braxton Osting and
Sourabh Palande and
Bei Wang Spectral sparsification of simplicial
complexes for clustering and label
propagation . . . . . . . . . . . . . . 176--211
Prosenjit Bose and
Jean-Lou De Carufel and
Olivier Devillers Expected Complexity of Routing in $
\Theta_6 $ and Half-$ \Theta_6 $ Graphs 212--234
Haitao Wang A Divide-and-Conquer Algorithm for
Two-Point $ L_1 $ Shortest Path Queries
in Polygonal Domains . . . . . . . . . . 235--282
Dingkang Wang and
Yusu Wang An Improved Cost Function for
Hierarchical Cluster Trees . . . . . . . 283--331
Michael Kaufmann and
Michael Bekos and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi Raftopoulou and
Torsten Ueckerdt Four Pages Are Indeed Necessary for
Planar Graphs . . . . . . . . . . . . . 332--353
Balázs Keszegh and
Dömötör Pálvölgyi Aligned plane drawings of the
generalized Delaunay-graphs for
pseudo-disks . . . . . . . . . . . . . . 354--370