Table of Contents

• Hyperbanana GraphsChristopher Clement, Audrey Lee-St. John, Jessica Sidman. [doi]
• How to Cover Most of a Point Set with a V-Shape of Minimum WidthBoris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky. [doi]
• What's in a gaze? How to reconstruct a simple polygon from local snapshotsPeter Widmeyer. [doi]
• Open Problems from CCCG 2012Joseph S. B. Mitchell. [doi]
• Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive ResultsJoseph O'Rourke. [doi]
• Polynomial Time Algorithms for Label Size Maximization on Rotating MapsYusuke Yokosuka, Keiko Imai. [doi]
• Kinetic Data Structures on The MoveSue Whitesides. [doi]
• On k-Guarding PolygonsDaniel Busto, William S. Evans, David G. Kirkpatrick. [doi]
• Convex hull alignment through translationMichael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira. [doi]
• On k-Enclosing Objects in a Coloured Point SetLuis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi 0001, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid. [doi]
• Covering Folded ShapesOswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow. [doi]
• Universal Point Sets for Planar Graph Drawings with Circular ArcsPatrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud, Alexander Wolff. [doi]
• Theta-3 is connectedOswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot. [doi]
• Geometric Separators and the Parabolic LiftDonald Sheehy. [doi]
• An Efficient Exact Algorithm for the Natural Wireless Localization ProblemBruno Crepaldi, Pedro J. de Rezende, Cid C. de Souza. [doi]
• Weighted Straight Skeletons In The PlaneTherese C. Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader. [doi]
• Drawing some 4-regular planar graphs with integer edge lengthsTimothy Sun. [doi]
• Bounding the Locus of the Center of Mass for a Part with Shape VariationFatemeh Panahi, A. Frank van der Stappen. [doi]
• Zipper Unfoldability of Domes and PrismoidsErik D. Demaine, Martin L. Demaine, Ryuhei Uehara. [doi]
• On Fence Patrolling by Mobile AgentsKe Chen, Adrian Dumitrescu, Anirban Ghosh. [doi]
• Fault Tolerant Clustering RevisitedNirman Kumar, Benjamin Raichel. [doi]
• The Unified Segment Tree and its Application to the Rectangle Intersection ProblemDavid P. Wagner. [doi]
• Stabbing Polygonal Chains with Rays is Hard to ApproximateSteven Chaplick, Elad Cohen, Gila Morgenstern. [doi]
• Cole's Parametric Search Technique Made PracticalMichael T. Goodrich, Pawel Pszona. [doi]
• Partial Searchlight Scheduling is Strongly PSPACE-completeGiovanni Viglietta. [doi]
• Map FoldingRahnuma Islam Nishat, Sue Whitesides. [doi]
• Grid Proximity Graphs: LOGs, GIGs and GIRLsRiver Allen, Laurie J. Heyer, Rahnuma Islam Nishat, Sue Whitesides. [doi]
• Counting CarambolasMaarten Löffler, André Schulz, Csaba D. Tóth. [doi]
• On the Rectangle Escape ProblemSepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh. [doi]
• Medial Residues of Piecewise Linear ManifoldsErin W. Chambers, Tao Ju, David Letscher. [doi]
• How To Place a Point to Maximize AnglesBoris Aronov, Mark V. Yagnatinsky. [doi]
• Data structures for incremental extreme ray enumeration algorithmsBlagoy Genov. [doi]
• Planar Convex Hull Range Query and Related ProblemsNadeem Moidu, Jatin Agarwal, Kishore Kothapalli. [doi]
• Computing Covers of Plane ForestsLuis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid. [doi]
• Spanning Colored Points with IntervalsPayam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi. [doi]
• Face-Guarding PolyhedraGiovanni Viglietta. [doi]
• 2) Time (and Better)Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero. [doi]
• Morpion Solitaire 5D: a new upper bound 121 on the maximum scoreAkitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato. [doi]
• Geometric Red-Blue Set Cover for Unit Squares and Related ProblemsTimothy M. Chan, Nan Hu. [doi]
• Cell-Paths in Mono- and Bichromatic Line Arrangements in the PlaneOswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl. [doi]
• Counting Triangulations ApproximatelyVictor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel. [doi]
• An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple PolygonMikkel Abrahamsen. [doi]
• Optimal Data Structures for Farthest-Point Queries in Cactus NetworksProsenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid. [doi]
• Heaviest Induced Ancestors and Longest Common SubstringsTravis Gagie, Pawel Gawrychowski, Yakov Nekrich. [doi]
• Set-Difference Range QueriesDavid Eppstein, Michael T. Goodrich, Joseph A. Simons. [doi]
• Privacy by Fake Data: A Geometric ApproachVictor Alvarez, Erin W. Chambers, László Kozma. [doi]
• Weighted Region Problem in Arrangement of LinesAmin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack. [doi]
• Faster approximation for Symmetric Min-Power BroadcastGruia Calinescu. [doi]
• 2 in Presence of Existing FacilitiesAritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee. [doi]
• Combinatorics of Beacon Routing and CoverageMichael Biro, Jie Gao, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell. [doi]
• Quantifying Design: the geometric properties behind designer choices and human perceptionAlla Shaffer. [doi]
• Aggregate-Max Nearest Neighbor Searching in the PlaneHaitao Wang. [doi]
• Computational complexity and an integer programming model of ShakashakaErik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno. [doi]