Plenary talk - Thursday Aug. 8, 9:00-10:00
  • Kinetic Data Structures on The Move
    Sue Whitesides
    [Download PDF]

    • Session 1A - Thursday Aug. 8, 10:00-10:50
  • Weighted Straight Skeletons In The Plane
    Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser and Peter Palfrader
    [Download PDF]
  • Medial Residues of Piecewise Linear Manifolds
    Erin Chambers, Tao Ju and David Letscher
    [Download PDF]

    • Session 1B - Thursday Aug. 8, 10:00-10:50
  • Morpion Solitaire 5D: a new upper bound 121 on the maximum score
    Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno and Masahide Yamato
    [Download PDF]
  • Computational complexity and an integer programming model of Shakashaka
    Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno
    [Download PDF]

    • Session 2A - Thursday Aug. 8, 11:15-12:30
  • One-Round Discrete Voronoi Game in $\mathbb {R}^2$ in Presence of Existing Facilities
    Aritra Banik, Bhaswar Bhattacharya, Sandip Das and Satyaki Mukherjee
    [Download PDF]
  • Zipper Unfoldability of Domes and Prismoids
    Erik D. Demaine, Martin L. Demaine and Ryuhei Uehara
    [Download PDF]
  • Map Folding
    Rahnuma Islam Nishat and Sue Whitesides
    [Download PDF]

    • Session 2B - Thursday Aug. 8, 11:15-12:30
  • Partial Searchlight Scheduling is Strongly PSPACE-complete
    Giovanni Viglietta
    [Download PDF]
  • Set-Difference Range Queries
    David Eppstein, Michael Goodrich and Joseph A. Simons
    [Download PDF]
  • The Unified Segment Tree and its Application to the Rectangle Intersection Problem
    David P. Wagner
    [Download PDF]

    • Session 3A - Thursday Aug. 8, 13:50-15:05
  • Covering Folded Shapes
    Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, S\'{a}ndor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink and Andrew Winslow
    [Download PDF]
  • Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results
    Joseph O'Rourke
    [Download PDF]
  • Counting Triangulations Approximately
    Victor Alvarez, Karl Bringmann, Saurabh Ray and Raimund Seidel
    [Download PDF]

    • Session 3B - Thursday Aug. 8, 13:50-15:05
  • Aggregate-Max Nearest Neighbor Searching in the Plane
    Haitao Wang
    [Download PDF]
  • Data structures for incremental extreme ray enumeration algorithms
    Blagoy Genov
    [Download PDF]
  • Fault Tolerant Clustering Revisited
    Nirman Kumar and Benjamin Raichel
    [Download PDF]

    • Open Problems Session
  • Open Problems from CCCG 2012
    Joseph S. B. Mitchell
    [Download PDF]

    • Plenary talk - Friday Aug. 9, 9:00-10:00
  • Quantifying Design: the geometric properties behind designer choices and human perception
    Alla Shaffer
    [Download PDF]

    • Session 4A - Friday Aug. 9, 10:00-10:50
  • Universal Point Sets for Planar Graph Drawings with Circular Arcs
    Patrizio Angelini, David Eppstein, Fabrizio Frati, Michael Kaufmann, Sylvain Lazard, Tamara Mchedlidze, Monique Teillaud and Alexander Wolff
    [Download PDF]
  • Weighted Region Problem in Arrangement of Lines
    Amin Gheibi, Anil Maheshwari and J\"{o}rg-R\"{u}diger Sack
    [Download PDF]

    • Session 4B - Friday Aug. 9, 10:00-10:50
  • Combinatorics of Beacon Routing and Coverage
    Michael Biro, Jie Gao, Justin Iwerks, Irina Kostitsyna and Joseph S. B. Mitchell
    [Download PDF]
  • Privacy by Fake Data: A Geometric Approach
    Victor Alvarez, Erin Chambers and L\'{a}szl\'{o} Kozma
    [Download PDF]

    • Session 5A - Friday Aug. 9, 11:20-12:35
  • Stabbing Polygonal Chains with Rays is Hard to Approximate
    Steven Chaplick, Elad Cohen and Gila Morgenstern
    [Download PDF]
  • Heaviest Induced Ancestors and Longest Common Substrings
    Travis Gagie, Pawe\l Gawrychowski and Yakov Nekrich
    [Download PDF]
  • Maximum-Weight Planar Boxes in $O(n^2)$ Time (and Better)
    J\'er\'emy Barbay, Timothy M. Chan, Gonzalo Navarro and Pablo P\'erez-Lantero
    [Download PDF]

    • Session 5B - Friday Aug. 9, 11:20-12:35
  • An Optimal Algorithm Computing Edge-to-Edge Visibility in a Simple Polygon
    Mikkel Abrahamsen
    [Download PDF]
  • Counting Carambolas
    Maarten L\"offler, Andr\'e Schulz and Csaba T\'oth
    [Download PDF]
  • Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane
    Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl
    [Download PDF]

    • Session 6A - Friday Aug. 9, 14:05-15:45
  • Optimal Data Structures for Farthest-Point Queries in Cactus Networks
    Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari and Michiel Smid
    [Download PDF]
  • Cole's Parametric Search Technique Made Practical
    Michael Goodrich and Pawe{\l } Pszona
    [Download PDF]
  • Polynomial Time Algorithms for Label Size Maximization on Rotating Maps
    Yusuke Yokosuka and Keiko Imai
    [Download PDF]
  • Planar Convex Hull Range Query and Related Problems
    Nadeem Moidu, Jatin Agarwal and Kishore Kothapalli
    [Download PDF]

    • Session 6B - Friday Aug. 9, 14:05-15:45
  • Hyperbanana Graphs
    Christopher Clement, Audrey Lee-St.John and Jessica Sidman
    [Download PDF]
  • Theta-3 is connected
    Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, Andr\'e van Renssen, Perouz Taslakian and Sander Verdonschot
    [Download PDF]
  • How to Cover Most of a Point Set with a V-Shape of Minimum Width
    Boris Aronov, John Iacono, \"{O}zg\"{u}r \"{O}zkan and Mark Yagnatinsky
    [Download PDF]
  • Computing Covers of Plane Forests
    Luis Barba, Alexis Beingessner, Prosenjit Bose and Michiel Smid
    [Download PDF]

    • Session 7A - Friday Aug. 9, 16:15-17:55
  • An Efficient Exact Algorithm for the Natural Wireless Localization Problem
    Bruno Crepaldi, Pedro de Rezende and Cid de Souza
    [Download PDF]
  • On k-Enclosing Objects in a Coloured Point Set
    Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala and Mohammad Abdul Wahid
    [Download PDF]
  • On the Rectangle Escape Problem
    Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod and Hamid Zarrabi-Zadeh
    [Download PDF]
  • Grid Proximity Graphs: LOGs, GIGs and GIRLs
    River Allen, Laurie Heyer, Rahnuma Islam Nishat and Sue Whitesides
    [Download PDF]

    • Session 7B - Friday Aug. 9, 16:15-17:55
  • Bounding the Locus of the Center of Mass for a Part with Shape Variation
    Fatemeh Panahi and A. Frank van der Stappen
    [Download PDF]
  • Geometric Separators and the Parabolic Lift
    Donald R. Sheehy
    [Download PDF]
  • How To Place a Point to Maximize Angles
    Boris Aronov and Mark Yagnatinsky
    [Download PDF]
  • Spanning Colored Points with Intervals
    Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam and Mohammad Reza Kazemi
    [Download PDF]

    • Session 8A - Saturday Aug. 10, 9:00-10:40
  • On Fence Patrolling by Mobile Agents
    Ke Chen, Adrian Dumitrescu and Anirban Ghosh
    [Download PDF]
  • Face-Guarding Polyhedra
    Giovanni Viglietta
    [Download PDF]
  • On $k$-Guarding Polygons
    Daniel Busto, William Evans and David Kirkpatrick
    [Download PDF]
  • Geometric Red-Blue Set Cover for Unit Squares and Related Problems
    Timothy M. Chan and Nan Hu
    [Download PDF]

    • Session 8B - Saturday Aug. 10, 9:00-10:15
  • Convex hull alignment through translation
    Michael Hoffmann, Vincent Kusters, G\"unter Rote, Maria Saumell and Rodrigo I. Silveira
    [Download PDF]
  • Faster approximation for Symmetric Min-Power Broadcast
    Gruia Calinescu
    [Download PDF]
  • Drawing some 4-regular planar graphs with integer edge lengths
    Timothy Sun
    [Download PDF]

    • Plenary talk - Saturday Aug. 10, 11:00-12:00
  • What's in a gaze? How to reconstruct a simple polygon from local snapshots
    Peter Widmeyer
    [Download PDF]