| Date | Speaker | Topic |
|---|---|---|
| 2008-11-19, 14:00 | Michiel Smid | Spanning trees with O(1) average stretch factor |
| 2008-11-12, 14:00 | Perouz Taslakian | Point Set Reconstruction Problems |
| 2008-11-05, 14:00 | Karim Douieb | Constant Approximation Hotlink Assignment Algorithm |
| 2008-10-23, 14:00 | Gordon Wilfong | A Fractional Model of the Border Gateway Protocol (BGP) |
| 2008-10-22, 14:00 | Meng He | Succinct Geometric Indexes Supporting Point Location Queries |
| 2008-10-15, 14:00 | Craig Dillabaugh | Succinct and I/O Efficient Data Structures for Traversal in Trees |
| 2008-10-08, 14:00 | Mohamad Farshi | The Semi-Separated Pair Decomposition |
| 2008-10-01, 14:00 | Anil Maheshwari | Diffused Reflection Paths |
| 2008-09-24, 14:00 | John Howat | Languages and generating functions |
| 2008-09-17, 14:00 | Dana Jansens | I/O Efficient Sorting in the Cache Oblivious Model: Quicker than Quick |
| 2008-09-10, 14:00 | Matt Duckham | "Non-convex" hulls: Characterizing the shape of a set of points in the plane |
| 2008-09-04, 15:00 | Mohamad Abam | A Simple and Efficient Kinetic Spanner |
| 2008-09-03, 14:00 | Arezou Mohammadi | TBA |
| 2008-08-27, 14:00 | Mike Atkinson | Stacks, deques, and permutations |
| 2008-08-21, 11:00 | Stefan Langerman | Colorful stuff, part deux |
| 2008-08-20, 14:00 | Sebastien Collette | Highway hull revisited |
| 2008-08-19, 14:00 | Karim Abu Affash | Improved bounds on the average distance to the Fermat-Weber center of a convex object |
| 2008-07-23, 14:00 | John Howat | Two results on distribution-sensitive data structures |
| 2008-07-16, 14:00 | Nadia Benbernou | Efficient reconfiguration of pivoting tiles |
| 2008-07-09, 14:00 | Yurai Rodriguez | Distributed computation of Voronoi diagrams in wireless networks |
| 2008-06-25, 14:00 | Michiel Smid | Partitioning the edges of the complete graph into complete bipartite graphs II |
| 2008-06-18, 14:00 | Mohamad Farshi | Computing the greedy spanner in near-quadratic time |
| 2008-06-11, 14:00 | Michiel Smid | Partitioning the edges of the complete graph into complete bipartite graphs I |
| 2008-06-04, 14:00 | Prosenjit Bose | On coloring planar graphs |
| 2008-05-28, 14:00 | Pat Morin | Logarithmic lower bounds in the cell-probe model |
| 2008-05-22, 11:00 | Glenn Hickey | NAPX: A polynomial approximation scheme for the Noah's ark problem |
| 2008-05-15, 11:00 | Karoly Bezdek | Ball-polyhedra in small dimensions |
| 2008-05-01, 11:00 | Matya Katz | TBA |
| 2008-04-24, 11:00 | Carlos Seara | Moving points to reach linear separability |
| 2008-04-17, 11:00 | Faith Ellen | The space complexity of unbounded timestamps |
| 2008-04-03, 11:00 | Carleton-MITACS Wireless Security Day | |
| 2008-03-27, 11:00 | Eric Chen | In-place 2-D nearest neighbor search |
| 2008-03-20, 11:00 | John Howat | Quicker queries: Queaps and the queueish property |
| 2008-03-13, 11:00 | Meng He | Wavelet trees |
| 2008-03-06, 11:00 | Mohamad Farshi | Dilation-optimal edge augmentation of geometric networks |
| 2008-03-03, 14:00 | Stephane Durocher | On routing with guaranteed delivery in three-dimensional ad hoc wireless networks |
| 2008-02-28, 11:00 | Paz Carmi | On bounded degree planar geometric spanners |
| 2008-02-14, 11:00 | Stefan Langerman | Coloring geometric range spaces |