Wednesday, Aug 7

7:00pm - 8:30pm Welcome Reception - Wild Rose Room

Thursday, Aug 8

8:15 - 8:50 Continental Breakfast - Hallway
8:50 - 9:00 Welcome and Opening Remarks - Aurora Room
9:00 - 10:00 Paul Erdős Memorial Lecture - Aurora Room
Vida Dujmovic - Graph Drawing via Layered Partitions
10:00 - 10:30 Coffee Break
10:30 - 11:45 Session 1A - Aurora Room
Chair - Zac Friggstad
  • Morten Eskildsen, Matias Frank Jensen, Sebastian Kolby and Jesper Steensgaard.
    Maintaining a Centerpoint with Amortized Optimal Logarithmic Insertions
  • Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly and Rahul Shah.
    I/O Optimal Data Structures for Categorical Range Skyline Queries
 Session 1B - Prairie Room
Chair - Pilar Cano
  • David Eppstein.
    Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
  • Ahmad Biniaz, Prosenjit Bose, Jean Cardinal and Michael Payne.
    Three-Coloring Three-Dimensional Uniform Hypergraphs
  • Alyxander Burns, Peter Klemperer, Jaemarie Solyst and Audrey St. John.
    Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations
11:45 - 1:30 Lunch (on your own)
1:30 - 2:45 Session 2A - Aurora Room
Chair - Jean-Lou De Carufel
  • Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore and Leonardo Martínez-Sandoval.
    Geometric Systems of Unbiased Representatives
  • Jean Cardinal, Ruy Fabila-Monroy and Carlos Hidalgo-Toscano.
    Chirotopes of Random Points in Space are Realizable on a Small Integer Grid
  • Luis Polanco and Jose Perea.
    Coordinatizing Data With Lens Spaces and Persistent Cohomology
 Session 2B - Prairie Room
Chair - Saeed Mehrabi
  • Ovidiu Daescu and Ka Yaw Teo.
    Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
  • Bengt J. Nilsson and Paweł Żyliński.
    The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains
  • Shimin Li, Zhongjiang Yan and Jingru Zhang.
    An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a Line
2:50 Group Photo
Immediately following group photo Excursion
Royal Alberta Museum
5:30 Dinner at Craft Beer Garden

Friday, Aug 9

8:15 - 9:00 Continental Breakfast - Hallway
9:00 - 10:00 Distinguished Lecture - Aurora Room
Joseph O'Rourke - Unfolding Polyhedra
10:00 - 10:30 Coffee Break
10:30 - 11:45 Session 3A - Aurora Room
Chair - Frank Staals
  • Alejandro Flores-Velazco and David Mount.
    Guarantees on Nearest-Neighbor Condensation heuristics
  • Soroush Ebadian and Hamid Zarrabi-Zadeh.
    A Simple Randomized Algorithm for All Nearest Neighbors
  • Kevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers and Menelaos Karavelas.
    Hardness results on Voronoi, Laguerre and Apollonius diagrams
 Session 3B - Prairie Room
Chair - Sander Verdonchot
  • Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford and Paweł Żyliński.
    A Note on Guarding Staircase Polygons
  • Prosenjit Bose and Thomas Shermer.
    Attraction-convexity and Normal Visibility
  • Sepideh Aghamolaei, Mohammad Ghodsi and Seyyedhamid Miri.
    A MapReduce Algorithm for Metric Anonymity Problems
11:45 - 1:30 Lunch (on your own)
1:30 - 3:10 Session 4A - Aurora Room
Chair - Mark Keil
  • Loic Crombez, Guilherme D. Da Fonseca and Yan Gerard.
    Peeling Digital Potatoes
  • Arun Kumar Das, Sandip Das and Joydeep Mukherjee.
    Largest Triangle inside a Terrain
  • Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen Merkel and Anurag Murty Naredla.
    Reconstructing a Polyhedron between Polygons in Parallel Slices
  • Thomas Schibler, Ambuj Singh and Subhash Suri.
    On Multi-Dimensional Team Formation
 Session 4B - Prairie Room
Chair - Joseph O'Rourke
  • Guoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara and Takeaki Uno.
    Simple Fold and Cut Problem for Line Segments
  • Martin L. Demaine, Robert Hearn, Jason S. Ku and Ryuhei Uehara.
    Rectangular Unfoldings of Polycubes
  • Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova and Christiane Schmidt.
    Folding Polyominoes with Holes into a Cube
  • Koji Ouchi and Ryuhei Uehara.
    Minimum Forcing Sets for Single-Vertex Crease Pattern
3:10 - 3:40 Coffee Break
3:40 - 4:55 Session 5A - Aurora Room
Chair - Jean-Lou De Carufel
  • Fabian Klute, Irene Parada, Takashi Horiyama, Matias Korman, Ryuhei Uehara and Katsuhisa Yamanaka.
    Efficient Segment Folding is Hard
  • Chuzo Iwamoto and Tatsuya Ide.
    Nurimisaki and Sashigane are NP-complete
  • Sayan Bandyapadhyay and Saeed Mehrabi.
    Constrained Orthogonal Segment Stabbing
 Session 5B - Prairie Room
Chair - Ahmad Biniaz
  • Yeganeh Bahoo, Prosenjit Bose and Stephane Durocher.
    Watchtower for k-crossing Visibility
  • Hugo Akitaya, Leonie Ryvkin and Csaba Toth.
    Rock Climber Distance: Frogs versus Dogs
  • Bin Fu, Robert Schweller and Tim Wylie.
    Discrete Planar Map Matching
4:55 - 5:30 Open Problem Session
5:30 - 6:15 Business Meeting

Saturday, August 10

8:15 - 9:00 Continental Breakfast - Hallway
9:00 - 10:00 Ferran Hurtado Memorial Lecture - Aurora Room
Mark de Berg - ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators
10:00 - 10:30 Coffee Break
10:30 - 12:10 Session 6A - Aurora Room
Chair - Zac Friggstad
  • Therese Biedl, Ahmad Biniaz and Anna Lubiw.
    Minimum Ply Covering of Points with Disks and Squares
  • Kian Mirjalali, Seyed Ali Tabatabaee and Hamid Zarrabi-Zadeh.
    Distributed Unit Clustering
  • Tanmay Inamdar.
    Local Search for Geometric Partial Covering Problems
 Session 6B - Prairie Room
Chair - Ian Munro
  • Prosenjit Bose, Pilar Cano and Rodrigo I. Silveira.
    Affine invariant triangulations
  • Sander Verdonschot.
    Flipping in Spirals
  • Saad Quader and Alexander Russell.
    Graph Realization on a Random Embedding
  • Mathijs Wintraecken and Gert Vegter.
    The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds