In 2018, the algorithms seminar normally took place on Fridays at 11:00-12:00 in room 5345 HP. Anyone with an interest in algorithms was 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, and 2017)

Previous seminars

2018-01-12 11:00
Paz Carmi
On Weighted-Mean Stretch Factor
2018-01-19 11:00
Anthony D'Angelo
Transitions in geometric minimum spanning trees
2018-01-26 11:00
Michiel Smid
Range mode queries, set intersection queries, and colored range queries
2018-02-02 9:00
Darryl Hill
On the Spanning Ratio of Yao 4
2018-02-09 11:00
Arash Nouri
Query shortest paths amidst growing discs
2018-02-16 11:00, in HP 3230B (Office of the Dean of Science)
Sander Verdonschot
Convex Gridgons
2018-02-23 11:00, in HP 4351 (Math seminar room)
Jean-Lou De Carufel
Stabbing Pairwise Intersecting Disks by Five Points
2018-03-02 10:30
Luís Fernando Schultz Xavier da Silveira
Convex grid embeddings of 3-connected planar graphs
2018-04-06 at 11:00
Saeed Mehrabi
Dominating Set on Intersection Graphs of Paths on a Grid
2018-04-13 at 11:00
Karim Abu-Affash
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
2018-04-20 at 11:00
Luís Fernando Schultz Xavier da Silveira
A convex optimization based automated market maker for complex securities.
2018-04-27 at 11:00
Prosenjit Bose
Flip distance in plane perfect bichromatic matching
2018-05-04 at 11:00
Saeed Mehrabi
Boundary Labeling for Rectangular Diagrams
2018-05-11 at 11:00
Farah Chanchary
Range-max queries on uncertain data
2018-05-18 at 11:00
Darryl Hill
Improved Routing on the Delaunay Triangulation
2018-05-25 at 11:00
Arti Pandey
Algorithmic Aspects of Semitotal Domination 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
Dominating Set on Intersection Graphs of Rectangles and L-frames
2018-06-22 at 11:00
Charles Dumenil
Expected Size of the Delaunay Triangulation of random points on a surface
2018-06-29 at 11:30
Anthony D'Angelo
Degree Five Steiner Points Cannot Reduce Network Costs for Planar Sets
2018-07-06 at 11:00
Kerry Cerqueira
Computing Shapley Values in some Geometric Settings
2018-07-13 at 11:00
Joel Faubert
Characterization of k-cop-win graphs
2018-07-27 at 11:00
Saeed Mehrabi
Covering cells with line segments
2018-08-03 at 11:00
Irina Kostitsyna
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region
2018-08-17 at 11:00
Luís Fernando Schultz Xavier da Silveira
Two Variants of Helly's Theorem
2018-08-31 at 11:00
Philipp Kindermann
Drawing Planar Graphs with Few Geometric Primitives: Algorithms and Evaluation
2018-09-07 at 11:00
Michiel Smid
Closest-Pair Queries in Fat Rectangles
2018-09-21 at 11:00
Darryl Hill
On the Spanning Ratio of $\Theta_5$
2018-09-28 at 11:00
Jean-Lou De Carufel
Patrolling a Fence
2018-10-05 at 11:40
Anthony D'Angelo
The 1-Steiner Tree Problem
2018-10-12 at 11:00
Élise Vandomme
Two algorithms to compute the maximal number of leaves in induced subtrees
2018-10-19 at 11:00
Jan Volec
Forcing quasi-randomness in permutations
2018-11-02 at 13:00
Arash Nouri
Shortest Paths Among Transient Obstacles
2018-11-23 at 11:00
Darryl Hill
On the Spanning and Routing Ratio of $\Theta_4$
2018-12-07 at 10:30am
Luís Fernando Schultz Xavier da Silveira
Optimal road placement in a square