Processing math: 100%

In 2018, 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, 2016, and 2017)

Pre­vi­ous sem­i­nars

2018-01-12 11:00
Paz Carmi
On Weighted-Mean Stretch Fac­tor
2018-01-19 11:00
An­thony D'An­gelo
Tran­si­tions in geo­met­ric min­i­mum span­ning trees
2018-01-26 11:00
Michiel Smid
Range mode queries, set in­ter­sec­tion queries, and col­ored range queries
2018-02-02 9:00
Dar­ryl Hill
On the Span­ning Ratio of Yao 4
2018-02-09 11:00
Arash Nouri
Query short­est paths amidst grow­ing discs
2018-02-16 11:00, in HP 3230B (Of­fice of the Dean of Sci­ence)
Sander Ver­don­schot
Con­vex Grid­gons
2018-02-23 11:00, in HP 4351 (Math sem­i­nar room)
Jean-Lou De Carufel
Stab­bing Pair­wise In­ter­sect­ing Disks by Five Points
2018-03-02 10:30
Luís Fer­nando Schultz Xavier da Sil­veira
Con­vex grid em­bed­dings of 3-con­nected pla­nar graphs
2018-04-06 at 11:00
Saeed Mehrabi
Dom­i­nat­ing Set on In­ter­sec­tion Graphs of Paths on a Grid
2018-04-13 at 11:00
Karim Abu-Af­fash
Ap­prox­i­mat­ing Max­i­mum Di­am­e­ter-Bounded Sub­graph in Unit Disk Graphs
2018-04-20 at 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
A con­vex op­ti­miza­tion based au­to­mated mar­ket maker for com­plex se­cu­ri­ties.
2018-04-27 at 11:00
Pros­en­jit Bose
Flip dis­tance in plane per­fect bichro­matic match­ing
2018-05-04 at 11:00
Saeed Mehrabi
Bound­ary La­bel­ing for Rec­tan­gu­lar Di­a­grams
2018-05-11 at 11:00
Farah Chan­chary
Range-max queries on un­cer­tain data
2018-05-18 at 11:00
Dar­ryl Hill
Im­proved Rout­ing on the De­lau­nay Tri­an­gu­la­tion
2018-05-25 at 11:00
Arti Pandey
Al­go­rith­mic As­pects of Semi­to­tal Dom­i­na­tion in Graphs
2018-06-01 at 11:00
Pat Morin
Every collinear set is free
2018-06-08 at 11:00
Saeed Mehrabi
Local Search
2018-06-15 at 11:00
Saeed Mehrabi
Dom­i­nat­ing Set on In­ter­sec­tion Graphs of Rec­tan­gles and L-frames
2018-06-22 at 11:00
Charles Du­me­nil
Ex­pected Size of the De­lau­nay Tri­an­gu­la­tion of ran­dom points on a sur­face
2018-06-29 at 11:30
An­thony D'An­gelo
De­gree Five Steiner Points Can­not Re­duce Net­work Costs for Pla­nar Sets
2018-07-06 at 11:00
Kerry Cerqueira
Com­put­ing Shap­ley Val­ues in some Geo­met­ric Set­tings
2018-07-13 at 11:00
Joel Faubert
Char­ac­ter­i­za­tion of k-cop-win graphs
2018-07-27 at 11:00
Saeed Mehrabi
Cov­er­ing cells with line seg­ments
2018-08-03 at 11:00
Irina Kos­tit­syna
An Op­ti­mal Al­go­rithm to Com­pute the In­verse Bea­con At­trac­tion Re­gion
2018-08-17 at 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
Two Vari­ants of Helly's The­o­rem
2018-08-31 at 11:00
Philipp Kin­der­mann
Draw­ing Pla­nar Graphs with Few Geo­met­ric Prim­i­tives: Al­go­rithms and Eval­u­a­tion
2018-09-07 at 11:00
Michiel Smid
Clos­est-Pair Queries in Fat Rec­tan­gles
2018-09-21 at 11:00
Dar­ryl Hill
On the Span­ning Ratio of \Theta_5
2018-09-28 at 11:00
Jean-Lou De Carufel
Pa­trolling a Fence
2018-10-05 at 11:40
An­thony D'An­gelo
The 1-Steiner Tree Prob­lem
2018-10-12 at 11:00
Élise Van­domme
Two al­go­rithms to com­pute the max­i­mal num­ber of leaves in in­duced sub­trees
2018-10-19 at 11:00
Jan Volec
Forc­ing quasi-ran­dom­ness in per­mu­ta­tions
2018-11-02 at 13:00
Arash Nouri
Short­est Paths Among Tran­sient Ob­sta­cles
2018-11-23 at 11:00
Dar­ryl Hill
On the Span­ning and Rout­ing Ratio of \Theta_4
2018-12-07 at 10:30am
Luís Fer­nando Schultz Xavier da Sil­veira
Op­ti­mal road place­ment in a square