Algorithms Seminar
This semester (Fall 2013), the algorithms seminar will normally take
place on Fridays at 11:00-12:00 in room 5345 HP. During the weeks where
an SCS Council meeting is being held, the seminar is scheduled at 15:00-16:00.
The algorithms seminar group is a collection of students and professors
that meets weekly to discuss algorithms. During each meeting a member of
the group gives a 1 hour lecture. Typically, we present recent results
found in conference proceedings, journals, from our own research, or by
visiting researchers.
Any student or professor with an interest in algorithms is encouraged
to attend. The schedule is as follows. (We also have an archive of the
seminars in 2004,
2005,
2006,
2007,
2008,
2009,
2010,
2011,
2012.)
| Upcoming Seminars |
|---|
| 2013-11-29, 11:00 |
Giovanni Viglietta |
Designing pop-up cards |
| 2013-11-15, 11:00 |
Ahmad Binaiz |
Fixed-Orientation Equilateral Triangle Matching of Point Sets |
| 2013-11-08, 15:00 |
Sander Verdonschot |
Theta-3 is connected |
| 2013-11-01, 10:30 |
Jean-Lou De Carufel |
Equidissection |
| 2013-10-25, 10:00 |
Tommy Reddad
Troy Hildebrandt |
Bounds on the Obstacle Number
Improving 3D CSS Layer Sorting in Google Chrome |
| 2013-10-18, 11:00 |
Vinayak Pathak |
Flipping Edge-Labelled Triangulations |
| 2013-10-11, 11:00 |
Michiel Smid |
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem |
| 2013-10-04, 11:00 |
Pat Morin |
Crossings in grid drawings |
| 2013-09-27, 11:00 |
Aritra Banik |
An Existential Proof for the Conjecture on Packing Anchored Rectangles |
| 2013-09-20, 11:00 |
Jit Bose |
Geodesic-Preserving Polygon Simplification |
| 2013-09-13, 15:00 |
André van Renssen |
The Price of Order |
| 2013-05-17, 11:00 |
Jit Bose |
Every triangle-free planar graph can be 3-colored |
| 2013-05-09 & 10 |
Various Speakers |
Discrete Math Days (uOttawa) |
| 2013-05-03, 11:00 |
Matthew Eastman |
Obstacle-avoiding path-existence queries in a simple polygon |
| 2013-04-26, 11:00 |
Alina Shaikhet |
The On-Line Heilbronn's Triangle Problem in d Dimensions |
| 2013-04-19, 11:00 |
Alexis Beingessner |
Shooting Permanent Rays among Disjoint Polygons in the Plane |
| 2013-04-12, 11:00 |
Sander Verdonschot |
The θ5-graph is a spanner |
| 2013-04-05, 13:00 |
Jean-Lou De Carufel |
Revisiting the problem of searching on a line |
| 2013-03-22, 13:00 |
David Wood |
Visibility graphs: Many conjectures and a few theorems |
| 2013-03-08, 11:00 |
Vida Dujmović |
Graph layouts via layered separators |
| 2013-03-01, 11:00 |
Anil Maheshwari |
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications |
| 2013-02-22, 11:00 |
André van Renssen |
Optimal bounds on constrained theta-graphs |
| 2013-02-15, 13:00 |
Pat Morin |
Michiel's problem |
| 2013-02-08, 11:00 |
Giovanni Viglietta |
The art gallery problem for polyhedra |
| 2013-02-01, 11:00 |
Luis Barba |
Bichromatic compatible matchings |
| 2013-01-25, 11:00 |
Michiel Smid |
Pat's problem |