Abstract is missing.
- Square Formation by Asynchronous Oblivious RobotsMarcello Mamino, Giovanni Viglietta. 1-6
- Finding Points in General PositionVincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier. 7-14
- Minimizing the Total Movement for Movement to Independence Problem on a LineMehrdad Ghadiri, Sina Yazdanbod. 15-20
- Searching with Advice: Robot Fence-JumpingKonstantinos Georgiou, Evangelos Kranakis, Alexandra Steau. 21-28
- On the Stability of Medial Axis of a Union of Balls in the PlaneDavid Letscher, Kyle Sykes. 29-33
- kth Nearest Neighbor Sampling in the PlaneKirk P. Gardner, Donald R. Sheehy. 34-41
- NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform GridDavid Hedin, W. Randolph Franklin. 42-47
- Realizing Farthest-Point Voronoi DiagramsTherese C. Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot. 48-56
- Recognition of Triangulation Duals of Simple Polygons With and Without HolesMartin Derka, Alejandro López-Ortiz, Daniela Maftuleac. 57-62
- Sliding k-Transmitters: Hardness and ApproximationTherese C. Biedl, Saeed Mehrabi 0001, Ziting Yu. 63-68
- The Length of the Beacon Attraction TrajectoryBahram Kouhestani, David Rappaport, Kai Salomaa. 69-74
- A Competitive Strategy for Walking in Generalized Streets for a Simple RobotAzadeh Tabatabaei, Fardin Shapouri, Mohammad Ghodsi. 75-79
- Polynomial volume point set embedding of graphs in 3DFarshad Barahimi, Steve Wismath. 80-85
- Boundary Labeling with ObstaclesMartin Fink 0001, Subhash Suri. 86-92
- nStephane Durocher, Ellen Gethner, Debajyoti Mondal. 93-100
- Squarability of rectangle arrangementsMatej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer. 101-106
- Transforming Hierarchical Trees on Metric SpacesMahmoodreza Jahanseir, Don Sheehy. 107-113
- On the Triangulation of non-fat Imprecise PointsVahideh Keikha, Ali Mohades, Mansoor Davoodi Monfared. 114-121
- On the Precision to Sort Line-Quadric IntersectionsMichael Deakin, Jack Snoeyink. 122-127
- Adaptive Metrics for Adaptive SamplesNicholas J. Cavanna, Donald R. Sheehy. 128-132
- Geometric Spanners Merging and its ApplicationsDavood Bakhshesh, Mohammad Farshi. 133-139
- A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a CircleAhmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid. 140-146
- Partitions of planar point sets into polygonsAjit Arvind Diwan, Bodhayan Roy. 147-154
- Counting Convex k-gons in an Arrangement of Line SegmentsMartin Fink 0001, Neeraj Kumar, Subhash Suri. 155-160
- A Fast 2-Approximation Algorithm for Guarding Orthogonal TerrainsYangdi Lyu, Alper Üngör. 161-167
- An Iterative Refinement Scheme of Dominating Guards and Witnesses for Art Gallery ProblemsEyüp Serdar Ayaz, Alper Üngör. 168-174
- Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge GuardsIsrael Aldana-Galvan, Jose Luis Alvarez-Rebollar, Juan Carlos Catana-Salazar, Mazay Jimenez-Salinas, Erick Solids-Villareal, Jorge Urrutia. 175-181
- The Planar Slope NumberUdo Hoffmann. 182-186
- Epsilon-covering: a greedy optimal algorithm for simple shapesTuong Nguyen, Isabelle Sivignon. 187-194
- Geometric Unique Set Cover on Unit Disks and Unit SquaresSaeed Mehrabi 0001. 195-200
- Stabbing Line Segments with Disks and Related ProblemsRaghunath Reddy Madireddy, Apurva Mudgal. 201-207
- Critical Placements of a Square or Circle amidst Trajectories for Junction DetectionIngo van Duijn, Irina Kostitsyna, Marc van J. Kreveld, Maarten Löffler. 208-215
- Smallest Paths with Restricted Orientations in Simple PolygonsJillian Dicker, Joseph G. Peters. 216-222
- Exact Solutions for the Geometric Firefighter ProblemMaurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza. 223-229
- Progressive Alignment of ShapesAshwin Gopinath, David G. Kirkpatrick, Paul W. K. Rothemund, Chris Thachuk. 230-236
- Rectangle-of-influence triangulationsTherese C. Biedl, Anna Lubiw, Saeed Mehrabi 0001, Sander Verdonschot. 237-243
- Maximum Area Rectangle Separating Red and Blue PointsBogdan Armaselu, Ovidiu Daescu. 244-251
- Characterizing minimum-length coordinated motions for two discsDavid G. Kirkpatrick, Paul Liu. 252-259
- Maximizing the Sum of Radii of Disjoint Balls or DisksDavid Eppstein. 260-265
- On the Number of Forceless Hint Sequences in Paint-by-Numbers PuzzlesDaniel Berend, Shira Zucker. 266-269
- An upper bound of 84 for Morpion Solitaire 5DHenryk Michalewski, Andrzej Nagórko, Jakub Pawlewicz. 270-278
- Kernelizing Buttons and ScissorsAkanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma. 279-286
- Minimizing Uncertainty through Sensor Placement with Angle ConstraintsIoana O. Bercea, Volkan Isler, Samir Khuller. 287-294
- New Bounds for Facial Nonrepetitive ColouringProsenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague. 295-302
- Problems on One Way Road NetworksJammigumpula Ajaykumar, Avinandan Das, Navaneeta Saikia, Arindam Karmakar. 303-308
- Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneraciesJack Snoeyink. 309-314