This se­mes­ter (Fall 2016), the al­go­rithms sem­i­nar will nor­mally take place on Fri­days at 11:00-12:00 in room 5345 HP. Any­one with an in­ter­est in al­go­rithms is en­cour­aged to at­tend.

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

Pre­vi­ous sem­i­nars

2016-01-15, 11:00
Farah Chan­chary
A pa­ra­me­ter­ized view of match­ing and pack­ing prob­lems
2016-01-22, 11:00
John Goldak
Chal­lenges in the com­pu­ta­tional geom­e­try of man­u­fac­tur­ing
2016-01-29, 11:00
Pat Morin
Turán-type the­o­rems for tri­an­gles in con­vex point sets
2016-02-05, 13:00
Ahmad Biniaz
Flip dis­tance to a non-cross­ing per­fect match­ing
2016-02-26, 11:00
Sander Ver­don­schot
Flips in pseudo-tri­an­gu­la­tions
2016-03-04, 11:00
Dar­ryl Hill
Im­proved rout­ing ratio for the $L^2$ De­lau­nay tri­an­gu­la­tion
2016-04-01, 13:00
Claire Pen­narun
Low-cost elec­tri­cal mon­i­tor­ing: power-dom­i­na­tion in tri­an­gu­la­tions
2016-04-08, 13:00
Michiel Smid
De­com­pos­able search­ing prob­lems
2016-04-15, 11:00
Kumar Murty
ERINDALE: A poly­no­mial based hash func­tion
2016-04-22, 11:00
Jen­nifer Hood
On the re­cent up­date to the Tree of Life: Why it mat­ters, and why a su­per­com­puter was needed to con­struct it
2016-04-29, 11:00
Elena Khramtsova
Stab­bing cir­cles and clus­ter Voronoi di­a­grams
2016-05-06, 11:00, CB 2400
Anil Ma­hesh­wari
Ran­dom­ized dy­namic graph al­go­rithms
2016-05-13, 11:00
Nicola San­toro
Com­put­ing in dy­namic net­works
2016-05-20, 11:00
Jean-Lou De Carufel
In­tro­duc­tion to evac­u­a­tion prob­lems
2016-05-26 and 2016-05-27
Ot­tawa-Car­leton Dis­crete Math Days 2016
2016-06-03, 11:00
Carsten Grimm
Short­cuts for geo­met­ric net­works — part I: paths and cy­cles
2016-06-17, 11:00
Alina Shaikhet
Art gallery tri­lat­er­a­tion prob­lem
Tues­day 2016-06-21, 13:00
May Krisztina Szedlák
Re­dun­dancy de­tec­tion for lin­ear sys­tems with two vari­ables per in­equal­ity
2016-06-24, 11:00, CB 2400
Luis Barba
In­cre­men­tal con­struc­tion of con­vex poly­he­dra and Voronoi di­a­grams
2016-07-08, 11:00
Pros­en­jit Bose
Per­fect Match­ings and Hamil­ton­ian paths in De­lau­nay graphs
2016-07-15, 11:00
Ingo van Duijn
How to use in­ci­dence bounds to cover points with lines
Wednes­day 2016-08-10, 11:00
Aurélien Ooms
Solv­ing $k$-SUM using few lin­ear queries
2016-08-12, 11:00
Sunil Chan­dran
Sep­a­ra­tion di­men­sion of graphs and hyper graphs
2016-08-19, 11:00
Frédérik Par­adis
Local rout­ing in span­ners based on WSPD's
Mon­day 2016-08-22, 11:00
Simon Pratt
Three ap­proaches to build­ing time-win­dowed geo­met­ric data struc­tures
2016-08-26, 11:00
An­thony D'An­gelo
Local rout­ing in mo­not­one pla­nar sub­di­vi­sions with few di­rec­tions
2016-09-02, 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
The tri­pod pack­ing prob­lem
2016-09-09, 13:00
Dar­ryl Hill
The stretch fac­tor of $L_1$- and $L_\infty$-De­lau­nay tri­an­gu­la­tions
Thurs­day 2016-09-15, 13:00
Hugo Ak­i­taya
Multi-col­ored span­ning graphs
2016-10-07, 11:00
Sander Ver­don­schot
Rec­tan­gle-of-in­flu­ence tri­an­gu­la­tions
2016-10-14, 11:00
Michiel Smid
Col­ored range queries
2016-10-21, 11:00
Kim­berly Cros­bie
Pla­nar bichro­matic min­i­mum span­ning trees
2016-10-28, 11:00
Arash Nouri
Ap­prox­i­mat­ing time-de­pen­dent short­est path among grow­ing discs
2016-11-04, 13:00
Ahmad Biniaz
A dif­fer­ent ap­proach to Jit's prob­lem: re­move my Q
2016-11-11, 11:00
Pat Morin
2-trees as sub­graphs of rec­tan­gle in­ter­sec­tion graphs
2016-11-18, 11:00
Farah Chan­chary
Dy­namic Con­nec­tiv­ity and Min­i­mum Span­ning For­est
2016-12-02, 11:00
Se­bas­t­ian S. Szyszkow­icz
Plan­ning Points on the Plane with Geo­met­ric Con­straints