TBA

Last update: August 29

Complete proceedings can be found  (PDF file) here (opens in new window) .

First column, scheduled in ENG103, and second in ENG102.

We will hold registration with the welcome reception.

There will be also registration starting at 8:30am on Day 1, 2 and 3.

Continental breakfast will be available everyday outside ENG103 at 8:30am.

Attention: Make sure to enter ENG building from Church St entrance.

Map to ENG (external link, opens in new window) 

Reception is at 6-8pm on August 24.

Drinks and snacks will be served.

Location: International room, International Living/Learning Centre (ILC)

240 Jarvis St, Toronto, ON M5B 2L1

Map (external link, opens in new window) 

Attention: Make sure to enter from Jarvis St entrance.

*Location: TMU building; SLC (Sheldon & Tracy Levy Student Learning Centre)
341 Yonge St, M5B 1S1

Map (external link, opens in new window) 

**Location: Duke of York
39 Prince Arthur Avenue, M5R 1B2
Light snacks and Drinks

Map (external link, opens in new window) 

***Location: International room, International Living/Learning Centre (ILC), 240 Jarvis St, M5B 2L1

Map (external link, opens in new window) 

Make sure to enter from Jarvis St entrance.

• Ali Mostafavi and Ali Hamzeh. “High-Dimensional Axis-Aligned Bounding Box with Outliers”
• Oliver Chubet. “Maximum Subbarcode Matching and Subbarcode Distance”
• James Freitag, Neshat Mohammadi, Aditya Potukuchi and Lev Reyzin. “On the Geometry of Stable Steiner Tree Instances”
• Jingjin Yu and Mario Szegedy. “Budgeted Steiner Networks: Three Terminals with Equal Path Weights”
• Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai and Ryuhei Uehara. “Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature”
• Sagnik Saha and Erik D. Demaine. “ZHED is NP-complete”
• Elena Arseneva, Erik D. Demaine, Tonan Kamata and Ryuhei Uehara. “Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra”
• Austin Watkins and Jeff Phillips. “Using Existential Theory of the Reals to Bound VC Dimension”
• Randal Tuggle, Davis Murphy and Nicholas Lorch. “A Constant Time Algorithm for Solving Simple Rolling Cube Mazes”
• Loïc Dubois. “A bound for Delaunay flip algorithms on flat tori”
• Erik Krohn, Bengt J. Nilsson and Christiane Schmidt. “Opposing Half Guards”
• Attila Jung. “Quantitative Helly-type Hypergraph Chains”
• Victor Milenkovic and Elisha Sacks. “Efficient Predicate Evaluation using Statistical Degeneracy Detection”
• Therese Biedl. “Drawing complete outer-1-planar graphs in linear area”
• Anna Lubiw and Graeme Stroud. “Computing Realistic Terrains from Imprecise Elevations”
• Hwi Kim, Jaegun Lee and Hee-Kap Ahn. “Uniformly Monotone Partitioning of Polygons Revisited”
• Ovidiu Daescu and Ka Yaw Teo. “Fast Deterministic Approximation of Medoid in R^d.
• Ovidiu Daescu and Ka Yaw Teo. “The Median Line Segment Problem: Computational Complexity and Constrained Variants”
• Giovanni Viglietta. “A Theory of Spherical Diagrams”
• Prosenjit Bose, Guillermo Esteban and Anil Maheshwari. “Weighted shortest path in equilateral triangular meshes”
• Stephane Durocher, Alexandre Leblanc and Sachini Rajapakse. “Computing Batched Depth Queries and the Depth of a Set of Points”
• Gill Barequet, Shion Fukuzawa, Michael Goodrich, David Mount, Martha Osegueda and Evrim Ozel. “Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching”
• David Eppstein. “Reflections in an Octagonal Mirror Maze”
• David Eppstein. “Locked and Unlocked Smooth Embeddings of Surfaces”
• David Eppstein. “Orthogonal Dissection into Few Rectangles”
• Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon and Hee-Kap Ahn. “Approximating Convex Polygons by Histogons”
• Ahmad Biniaz, Prosenjit Bose and Patrick Devaney. “A 13/9-approximation of the average-2π/3-MST”
• Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas Hull, Klara Mundilova and Josef Tkadlec. “Quasi-Twisting Convex Polyhedra”
• Erik D. Demaine, Hiro Ito, Jayson Lynch and Ryuhei Uehara. “Computational Complexity of Flattening Fixed-Angle Orthogonal Chains”
• Josef Minařík. “Unfolding Some Classes of One-Layer Polycubes” 
  
• Stephane Durocher and Spencer Szabados. “Curve Stabbing Depth: Data Depth for Plane Curves”
  
• Mark Keil, Debajyoti Mondal and Ehsan Moradi. “Burning Number for the Points in the Plane” 
• Dániel Garamvölgyi and Tibor Jordan. “Globally linked pairs in braced maximal outerplanar graphs”
• Anna Schenfisch, Brittany Terese Fasy, Samuel Micka, David L. Millman and Lucia Williams. “Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams”
• Ali Mohammad Lavasani, Denis Pankratov and Mohammad Ali Abam. “Maximum Weight Convex Polytope”
  
• Aditya Acharya and David Mount. “Optimally Tracking Labels on an Evolving Tree”
  
• Aya Bernstine and Yehonatan Mizrahi. “Efficiently Enumerating Scaled Copies of Point Set Patterns”
  
• Neeldhara Misra, Harshil M. and Saraswati Nanoti. “Diverse Non Crossing Matchings”
  
• Mohammad Javad Eslami-Bidgoli and Hamid Zarrabi-Zadeh. “Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional Streams”
  
• Alireza Shavali and Hamid Zarrabi-Zadeh. “On the Biplanar and k-Planar Crossing Numbers”
  
• Amirhossein Mozafari, Binay Bhattacharya and Tsunehiko Kameda. “A Sub-quadratic Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic”
  
• Kirby Gordon, Jacob Lezberg and Aaron Williams. “Unstacking Slabs in Megalit is NP-Hard”
  
• Shahin Kamali and Pooya Nikbakht. “Online Square Packing with Rotation”
  
• Robert Barish and Tetsuo Shibuya. “Optimally Confining Lattice Polymers”
  
• Shahin Kamali, Pooya Nikbakht and Arezoo Sajadpour. “A Randomized Algorithm for Non-crossing Matching of Online Points”