This term (Fall 2022), in-person algorithms seminars have resumed. Email Pat Morin if you want to be included in the seminar announcement mailing list. 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, 2015, 2016, 2017, and 2018)

Next seminar

Upcoming seminars

2023-04-28 at 9:30
Pat Morin
Linear Colouring, Centered Colouring, Treedepth, Treewidth, and Grids

Previous seminars

2023-04-21 at 9:30
Tyler Tuttle
Routing on the Yao-four graph
2023-04-14 at 10:00
Karthik Murali
Sensitivity oracle for all-pairs mincuts
2023-03-31 at 10:00
Saeed Odak
Online hitting set and set cover
2023-03-24 at 10:00
Alma Arevalo Loyola
Convex rainbow quadrilaterals
2023-03-17 at 10:00
Saman Bazargani
Geodesic anagram-free coloring of chordal graphs
2023-03-17 at 10:00
Bobby Miraftab
Median-decomposition and their applications
2023-02-26 at 10:00
Yan Garito
Routing in Euclidian Spanners with small diameter
2023-02-13 at 14:00
Therese Biedl
On the complexity of embedding in graph products
2022-10-13 at 10:30
Ian Munro
Finding a majority under the 3-way comparison model
2020-12-10 at 13:00
Pat Morin
Stack-number is not queue-number bounded
2020-11-26 at 13:00
Pilar Cano
Flips in higher order Delaunay triangulations
2020-11-5 at 13:00
Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems
2020-10-29 at 13:00
Anthony D'Angelo
Generalised $k$-Steiner Tree Problems in Normed Planes
2020-10-8 at 13:00
Pat Morin
Optimal adjacency-labelling schemes for planar graphs
2020-2-28 at 11:00
Curtis Bright
SAT solving with computer algebra and its application to graph theory and geometry
2020-2-21 at 11:00
J. Ian Munro
Fast stable sorting, adapting to existing runs
2020-2-14 at 11:00
Bengt Nilsson
The surveillance tour problem
2020-1-17 at 13:30
Rolf Fagerberg
Fragile complexity of comparison-based algorithms
2019-11-08 at 11:00
Arash Nouri
Some remarks on technical interviews
2019-10-25 at 11:00
Anthony D'Angelo
TBA.
2019-10-11 at 11:00
Pilar Cano
Hamiltonicity for convex shape Delaunay and Gabriel graphs
2019-09-27 at 11:00
Sylvain Lazard
Rounding meshes in 3D
2019-09-20 at 13:00
Michiel Smid
Region spanner for disks
2019-08-30 at 11:00
Aurélien Ooms
Sparse regression via range counting
2019-08-02 at 13:00
Fabrizio Frati
How to morph a tree on a small grid
2019-07-26 at 11:00
Birgit Vogtenhuber
Hamiltonian meander paths and cycles on bichromatic point sets
2019-07-19 at 11:00
Luís Fernando Schultz Xavier da Silveira
Results on train scheduling
2019-07-5 at 11:00
Darryl Hill
Intersecting diametral disks of a maximum weight matching
2019-06-14 at 11:00
Anthony D'Angelo
2-approximation for the min. $k$-enclosing geodesic disc in a simple polygon
2019-06-07 at 11:00
Olivier Devillers
Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees
2019-05-31 at 10:30
Therese Biedl
2019-05-24 at 11:00
Pat Morin
Layered partitions of $k$-planar graphs
2019-05-17 at 13:00
Sasanka Roy
Collision-free routing problem with restricted l-path
2019-05-03 at 11:00
Saeed Mehrabi
An FPT algorithm for covering cells with line segments
2019-04-12 at 11:00
Kerry Cerqueira
Spanning ratios for a class of generalized Delaunay graphs
2019-04-05 at 11:00
Anthony D'Angelo
Fast algorithms for computing the smallest k-enclosing circle
2019-03-22 at 11:00
Darryl Hill
Improved spanning ratio of theta-five revisited
2019-03-01 at 10:30
Anil Maheshwari
On locality-sensitive orderings and their applications
2019-02-22 at 11:00
Prosenjit Bose
Piercing disks
2019-02-15 at 11:00
Luís Fernando Schultz Xavier da Silveira
Tripod packing on few layers
2019-02-08 at 11:00
Saeed Mehrabi
robots evacuation in the face-to-face model
2019-02-01 at 11:00
Pat Morin
Dual circumference and free sets
2019-01-25 at 11:15
Nima Hoda
Shortcut graphs and groups
2019-01-11 at 11:00
Michiel Smid
Confirmation sampling