Talks

  • @1/2016: Simple, Faster Solutions to Kinetic Proximity Problems, Department of Computer Science, University of Manitoba, Winnipeg, Canada
  • @8/2015: Approximating the Min Closest Pair Distance and Nearet Neighbor Distances of Linearly Moving Points, The 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Canada
  • @8/2015: Touring a Sequence of Line Segments in Polygonal Domain Fences, The 27th Canadian Conference on Computational Geometry (CCCG 2015), Kingston, Canada
  • @1/2015: Kinetic Proximity Problems, Algorithms Group Seminar, Dept. of Comp. Eng., Sharif Univ. of Technology, Tehran, Iran
  • @11/2014: Simple, Faster Kinetic Data Structures, Algorithms & Complexity Group Seminar, School of Comp. Sci., Univ. of Waterloo, Waterloo, Canada
  • @8/2014: Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d, The 26th Canadian Conference on Computational Geometry (CCCG 2014), Halifax, Canada
  • @6/2013: Data Structures for All Nearest Neighbors and Closest Pair in the Plane, The 29th ACM Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil
  • @7/2012: Kinetic Pie Delaunay Graph and its Applications, The 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), Helsinki, Finland
  • @2/2010: Euclidean Minimum Spanning Tree of Moving Points in the Plane, The 15th International CSI Computer Conference (CSICC 2010), Tehran, Iran