CCCG 2013 Accepted Papers

Giovanni Viglietta. Partial Searchlight Scheduling is Strongly PSPACE-complete
Jeremy Barbay, Timothy M. Chan, Gonzalo Navarro and Pablo Perez-Lantero. Maximum-Weight Planar Boxes in $O(n^2)$ Time (and Better)
Joseph A. Simons, David Eppstein and Michael Goodrich. Set-Difference Range Queries
Nadeem Moidu, Jatin Agarwal and Kishore Kothapalli. Planar Convex Hull Range Query and Related Problems
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno. Computational complexity and an integer programming model of Shakashaka
Gruia Calinescu. Faster approximation for Symmetric Min-Power Broadcast
Erik D. Demaine, Martin Demaine and Ryuhei Uehara. Zipper Unfoldability of Domes and Prismoids
Victor Alvarez, Erin Chambers and Laszlo Kozma. Privacy by Fake Data: A Geometric Approach
Erin Chambers, Tao Ju and David Letscher. Medial Residues of Piecewise Linear Manifolds
Fatemeh Panahi and Frank van der Stappen. Bounding the Locus of the Center of Mass for a Part with Shape Variation
Luis Barba, Oswin Aichholzer, Sang Won Bae, Prosenjit Bose, Matias Korman, Andre Van Renssen, Perouz Taslakian and Sander Verdonschot. Theta-3 is connected
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane
Alexis Beingessner, Michiel Smid, Prosenjit Bose and Luis Barba. Computing Covers of Plane Forests
Michael Goodrich and Pawel Pszona. Cole's Parametric Search Technique Made Practical
Victor Alvarez, Karl Bringmann, Saurabh Ray and Raimund Seidel. Counting Triangulations Approximately
Joseph O'Rourke. Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results
Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari and Michiel Smid. Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Timothy M. Chan and Nan Hu. Geometric Red-Blue Set Cover for Unit Squares and Related Problems
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno and Masahide Yamato. Morpion Solitaire 5D: a new upper bound of 121 on the maximum score
Travis Gagie, Pawel Gawrychowski and Yakov Nekrich. Heaviest Induced Ancestors and Longest Common Substrings
Ke Chen, Adrian Dumitrescu and Anirban Ghosh. On Fence Patrolling by Mobile Agents
Aritra Banik, Bhaswar Bhattacharya, Sandip Das and Satyaki Mukherjee. One-Round Discrete Voronoi Game in $\mathbb{R}^2$ in Presence of Existing Facilities
Mikkel Abrahamsen. An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala and Mohammad Abdul Wahid. On k-Enclosing Objects in a Coloured Point Set
Nirman Kumar and Benjamin Raichel. Fault Tolerant Clustering Revisited
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sandor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink and Andrew Winslow. Covering Folded Shapes
Yusuke Yokosuka and Keiko Imai. Polynomial Time Algorithms for Label Size Maximization on Rotating Maps
Giovanni Viglietta. Face-Guarding Polyhedra
Haitao Wang. Aggregate-Max Nearest Neighbor Searching in the Plane
Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Silvain Lazard, Tamara Mchedlidze, Monique Teillaud and Alexander Wolff. Universal Point Sets for Planar Graph Drawings with Circular Arcs
River Allen, Laurie Heyer, Rahnuma Islam Nishat and Sue Whitesides. Grid Proximity Graphs: LOGs, GIGs and GIRLs
Christopher Clement, Audrey Lee-St.John and Jessica Sidman. Hyperbanana Graphs
Therese Biedl, Martin Held, Stefan Huber, Peter Palfrader and Dominik Kaaser. Weighted Straight Skeletons In The Plane
Timothy Sun. Drawing some 4-regular planar graphs with integer edge lengths
Rahnuma Islam Nishat and Sue Whitesides. Map Folding
Steven Chaplick, Elad Cohen and Gila Morgenstern. Stabbing Polygonal Chains with Rays is Hard to Approximate
Bruno Crepaldi, Pedro de Rezende and Cid de Souza. An Efficient Exact Algorithm for the Natural Wireless Localization Problem
Maarten Loffler, Andre Schulz and Csaba Toth. Counting Carambolas
Don Sheehy. Geometric Separators and the Parabolic Lift
Blagoy Genov. Data structures for incremental extreme ray enumeration algorithms
Boris Aronov, John Iacono, Ozgur Ozkan and Mark Yagnatinsky. How to Cover Most of a Point Set with a V-Shape of Minimum Width
Boris Aronov and Mark Yagnatinsky. How To Place a Point to Maximize Angles
David Wagner. The Unified Segment Tree and its Application to the Rectangle Intersection Problem
Amin Gheibi, Anil Maheshwari and Jorg-Rudiger Sack. Weighted Region Problem in Arrangement of Lines
Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam and Mohammad Reza Kazemi. Spanning Colored Points with Intervals
Daniel Busto, William Evans and David Kirkpatrick. On $k$-Guarding Polygons
Michael Hoffmann, Vincent Kusters, Gunter Rote, Maria Saumell and Rodrigo I. Silveira. Convex hull alignment through translation
Michael Biro, Jie Gao, Justin Iwerks, Irina Kostitsyna and Joe Mitchell. Combinatorics of Beacon Routing and Coverage
Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod and Hamid Zarrabi-Zadeh. On the Rectangle Escape Problem