Processing math: 100%

In 2017, the al­go­rithms sem­i­nar nor­mally took place on Fri­days at 11:00-12:00 in room 5345 HP. Any­one with an in­ter­est in al­go­rithms was 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, 2015, and 2016)

Pre­vi­ous sem­i­nars

2017-01-20, 10:00
Pat Morin
Grow­ing a ran­dom span­ning tree
2017-01-27, 10:00
Hugo Trem­blay
Poly­omino de­com­po­si­tion
2017-02-03, 13:00
Dar­ryl Hill
Local Rout­ing on De­lau­nay Tri­an­gu­la­tions
2017-02-10, 10:00
An­thony D'An­gelo
On pla­nar greedy draw­ings of 3-con­nected pla­nar graphs
2017-02-17, 10:00
Olivier Dev­illers
Geo­met­ric al­go­rithms, analy­sis under prob­a­bilis­tic hy­pothe­ses
2017-02-24, 10:00, in HP 3230B (Of­fice of the Dean of Sci­ence)
Michiel Smid
A vari­ant of the greedy span­ner
2017-03-24, 10:00
María del Pilar Cano Vila
Rain­bow span­ning sub­graphs in bounded edge-col­or­ings of graphs with large min­i­mum de­gree
2017-03-31, 10:00
Chris Sax­ton
Com­pu­ta­tional Geom­e­try Ed­tior
2017-04-07, 13:30, in Macphail Room (4351HP)
William J. Cook
The trav­el­ing sales­man prob­lem with road dis­tances
2017-04-21, 11:00
Anil Ma­hesh­wari
Lo­cal­ity Sen­si­tive Hash­ing
2017-04-28, 11:00
Kim­berly Cros­bie
Op­ti­mal Bichro­matic Plane Span­ning Trees on Spe­cial Point Sets
2017-05-19, 11:00
Pros­en­jit Bose
k-an­gu­la­tions
2017-06-09, 11:00
Frédérik Par­adis
Local Rout­ing in Span­ners Based on WSPDs
2017-06-23, 11:00
Sander Ver­don­schot
Gen­er­at­ing ran­dom con­vex poly­gons
2017-07-07, 11:00
Ahmad Biniaz
Com­pat­ibe 4-Holes in Point Sets
2017-07-14, 11:00
Alina Shaikhet
Op­ti­mal Art Gallery Lo­cal­iza­tion is NP-hard
2017-07-21, 11:00
André van Renssen
Pack­ing Short Plane Span­ning Trees in Com­plete Geo­met­ric Graphs
2017-08-11, 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
Rad­i­cal sums
2017-08-18, 11:00
Ro­drigo I. Sil­veira
Ge­o­mask­ing through Per­tur­ba­tion, or Count­ing Points in Cir­cles
2017-08-25, 11:00
John Howat
In­tro­duc­tion to Sup­ply Plan­ning
2017-10-13 11:00
Nima Hoda
An in­vi­ta­tion to com­bi­na­to­r­ial group the­ory
2017-10-20, 11:00
Jan Volec
On de­gree thresh­olds of cy­cles in ori­ented graphs
2017-11-10 11:00, in HP 3230B (Of­fice of the Dean of Sci­ence)
Igor Shinkar
A graph-the­o­retic ap­proach to mul­ti­task­ing
2017-11-17 11:00
Pat Morin
Gen­er­al­ized ob­sta­cle rep­re­sen­ta­tions of graphs
2017-11-24 11:00
Farah Chan­chary
Time win­dowed data struc­tures
2017-12-01 11:00
Pilar Cano
Se­quences of square-trees
2017-12-08 11:00
Saeed Mehrabi
On Or­thog­o­nally Guard­ing Or­thog­o­nal Poly­gons with Bounded Treewidth