This semester (Fall 2016), the algorithms seminar will normally take place on Fridays at 11:00-12:00 in room 5345 HP. Anyone with an interest in algorithms is encouraged to attend.

(We also have an archive of the seminars in 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, and 2015.)

Previous seminars

2016-01-15, 11:00
Farah Chanchary
A parameterized view of matching and packing problems
2016-01-22, 11:00
John Goldak
Challenges in the computational geometry of manufacturing
2016-01-29, 11:00
Pat Morin
Turán-type theorems for triangles in convex point sets
2016-02-05, 13:00
Ahmad Biniaz
Flip distance to a non-crossing perfect matching
2016-02-26, 11:00
Sander Verdonschot
Flips in pseudo-triangulations
2016-03-04, 11:00
Darryl Hill
Improved routing ratio for the $L^2$ Delaunay triangulation
2016-04-01, 13:00
Claire Pennarun
Low-cost electrical monitoring: power-domination in triangulations
2016-04-08, 13:00
Michiel Smid
Decomposable searching problems
2016-04-15, 11:00
Kumar Murty
ERINDALE: A polynomial based hash function
2016-04-22, 11:00
Jennifer Hood
On the recent update to the Tree of Life: Why it matters, and why a supercomputer was needed to construct it
2016-04-29, 11:00
Elena Khramtsova
Stabbing circles and cluster Voronoi diagrams
2016-05-06, 11:00, CB 2400
Anil Maheshwari
Randomized dynamic graph algorithms
2016-05-13, 11:00
Nicola Santoro
Computing in dynamic networks
2016-05-20, 11:00
Jean-Lou De Carufel
Introduction to evacuation problems
2016-05-26 and 2016-05-27
Ottawa-Carleton Discrete Math Days 2016
2016-06-03, 11:00
Carsten Grimm
Shortcuts for geometric networks — part I: paths and cycles
2016-06-17, 11:00
Alina Shaikhet
Art gallery trilateration problem
Tuesday 2016-06-21, 13:00
May Krisztina Szedlák
Redundancy detection for linear systems with two variables per inequality
2016-06-24, 11:00, CB 2400
Luis Barba
Incremental construction of convex polyhedra and Voronoi diagrams
2016-07-08, 11:00
Prosenjit Bose
Perfect Matchings and Hamiltonian paths in Delaunay graphs
2016-07-15, 11:00
Ingo van Duijn
How to use incidence bounds to cover points with lines
Wednesday 2016-08-10, 11:00
Aurélien Ooms
Solving $k$-SUM using few linear queries
2016-08-12, 11:00
Sunil Chandran
Separation dimension of graphs and hyper graphs
2016-08-19, 11:00
Frédérik Paradis
Local routing in spanners based on WSPD's
Monday 2016-08-22, 11:00
Simon Pratt
Three approaches to building time-windowed geometric data structures
2016-08-26, 11:00
Anthony D'Angelo
Local routing in monotone planar subdivisions with few directions
2016-09-02, 11:00
Luís Fernando Schultz Xavier da Silveira
The tripod packing problem
2016-09-09, 13:00
Darryl Hill
The stretch factor of $L_1$- and $L_\infty$-Delaunay triangulations
Thursday 2016-09-15, 13:00
Hugo Akitaya
Multi-colored spanning graphs
2016-10-07, 11:00
Sander Verdonschot
Rectangle-of-influence triangulations
2016-10-14, 11:00
Michiel Smid
Colored range queries
2016-10-21, 11:00
Kimberly Crosbie
Planar bichromatic minimum spanning trees
2016-10-28, 11:00
Arash Nouri
Approximating time-dependent shortest path among growing discs
2016-11-04, 13:00
Ahmad Biniaz
A different approach to Jit's problem: remove my Q
2016-11-11, 11:00
Pat Morin
2-trees as subgraphs of rectangle intersection graphs
2016-11-18, 11:00
Farah Chanchary
Dynamic Connectivity and Minimum Spanning Forest
2016-12-02, 11:00
Sebastian S. Szyszkowicz
Planning Points on the Plane with Geometric Constraints