Processing math: 100%

This term (Fall 2022), in-per­son al­go­rithms sem­i­nars have re­sumed. Email Pat Morin if you want to be in­cluded in the sem­i­nar an­nounce­ment mail­ing list. 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, 2015, 2016, 2017, and 2018)

Next sem­i­nar

Up­com­ing sem­i­nars

2023-04-28 at 9:30
Pat Morin
Lin­ear Colour­ing, Cen­tered Colour­ing, Treedepth, Treewidth, and Grids

Pre­vi­ous sem­i­nars

2023-04-21 at 9:30
Tyler Tut­tle
Rout­ing on the Yao-four graph
2023-04-14 at 10:00
Karthik Mu­rali
Sen­si­tiv­ity or­a­cle for all-pairs min­cuts
2023-03-31 at 10:00
Saeed Odak
On­line hit­ting set and set cover
2023-03-24 at 10:00
Alma Arevalo Loy­ola
Con­vex rain­bow quadri­lat­er­als
2023-03-17 at 10:00
Saman Bazargani
Ge­o­desic ana­gram-free col­or­ing of chordal graphs
2023-03-17 at 10:00
Bobby Mi­raftab
Me­dian-de­com­po­si­tion and their ap­pli­ca­tions
2023-02-26 at 10:00
Yan Gar­ito
Rout­ing in Eu­clid­ian Span­ners with small di­am­e­ter
2023-02-13 at 14:00
Therese Biedl
On the com­plex­ity of em­bed­ding in graph prod­ucts
2022-10-13 at 10:30
Ian Munro
Find­ing a ma­jor­ity under the 3-way com­par­i­son model
2020-12-10 at 13:00
Pat Morin
Stack-num­ber is not queue-num­ber bounded
2020-11-26 at 13:00
Pilar Cano
Flips in higher order De­lau­nay tri­an­gu­la­tions
2020-11-5 at 13:00
Sayan Bandya­pad­hyay
Im­proved Bounds for Met­ric Ca­pac­i­tated Cov­er­ing Prob­lems
2020-10-29 at 13:00
An­thony D'An­gelo
Gen­er­alised k-Steiner Tree Prob­lems in Normed Planes
2020-10-8 at 13:00
Pat Morin
Op­ti­mal ad­ja­cency-la­belling schemes for pla­nar graphs
2020-2-28 at 11:00
Cur­tis Bright
SAT solv­ing with com­puter al­ge­bra and its ap­pli­ca­tion to graph the­ory and geom­e­try
2020-2-21 at 11:00
J. Ian Munro
Fast sta­ble sort­ing, adapt­ing to ex­ist­ing runs
2020-2-14 at 11:00
Bengt Nils­son
The sur­veil­lance tour prob­lem
2020-1-17 at 13:30
Rolf Fager­berg
Frag­ile com­plex­ity of com­par­i­son-based al­go­rithms
2019-11-08 at 11:00
Arash Nouri
Some re­marks on tech­ni­cal in­ter­views
2019-10-25 at 11:00
An­thony D'An­gelo
TBA.
2019-10-11 at 11:00
Pilar Cano
Hamil­tonic­ity for con­vex shape De­lau­nay and Gabriel graphs
2019-09-27 at 11:00
Syl­vain Lazard
Round­ing meshes in 3D
2019-09-20 at 13:00
Michiel Smid
Re­gion span­ner for disks
2019-08-30 at 11:00
Aurélien Ooms
Sparse re­gres­sion via range count­ing
2019-08-02 at 13:00
Fab­rizio Frati
How to morph a tree on a small grid
2019-07-26 at 11:00
Bir­git Vogten­hu­ber
Hamil­ton­ian me­an­der paths and cy­cles on bichro­matic point sets
2019-07-19 at 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
Re­sults on train sched­ul­ing
2019-07-5 at 11:00
Dar­ryl Hill
In­ter­sect­ing di­ame­tral disks of a max­i­mum weight match­ing
2019-06-14 at 11:00
An­thony D'An­gelo
2-ap­prox­i­ma­tion for the min. k-en­clos­ing ge­o­desic disc in a sim­ple poly­gon
2019-06-07 at 11:00
Olivier Dev­illers
Array-based com­pact data struc­tures for tri­an­gu­la­tions: Prac­ti­cal so­lu­tions with the­o­ret­i­cal guar­an­tees
2019-05-31 at 10:30
Therese Biedl
2019-05-24 at 11:00
Pat Morin
Lay­ered par­ti­tions of k-pla­nar graphs
2019-05-17 at 13:00
Sasanka Roy
Col­li­sion-free rout­ing prob­lem with re­stricted l-path
2019-05-03 at 11:00
Saeed Mehrabi
An FPT al­go­rithm for cov­er­ing cells with line seg­ments
2019-04-12 at 11:00
Kerry Cerqueira
Span­ning ra­tios for a class of gen­er­al­ized De­lau­nay graphs
2019-04-05 at 11:00
An­thony D'An­gelo
Fast al­go­rithms for com­put­ing the small­est k-en­clos­ing cir­cle
2019-03-22 at 11:00
Dar­ryl Hill
Im­proved span­ning ratio of theta-five re­vis­ited
2019-03-01 at 10:30
Anil Ma­hesh­wari
On lo­cal­ity-sen­si­tive or­der­ings and their ap­pli­ca­tions
2019-02-22 at 11:00
Pros­en­jit Bose
Pierc­ing disks
2019-02-15 at 11:00
Luís Fer­nando Schultz Xavier da Sil­veira
Tri­pod pack­ing on few lay­ers
2019-02-08 at 11:00
Saeed Mehrabi
ro­bots evac­u­a­tion in the face-to-face model
2019-02-01 at 11:00
Pat Morin
Dual cir­cum­fer­ence and free sets
2019-01-25 at 11:15
Nima Hoda
Short­cut graphs and groups
2019-01-11 at 11:00
Michiel Smid
Con­fir­ma­tion sam­pling