This semester (Winter 2012), the algorithms seminar will normally take place on Fridays at 11:00-12:00 in room 5345 HP.
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.)
| Upcoming Seminars | ||
|---|---|---|
| 2012-04-27, 11:00 | Pat Morin | Robust geometric spanners |
| 2012-04-20, 13:00 | Aritra Banik | A survey on the discrete Voronoi game |
| 2012-04-13, 13:00 | Jasine Babu | An approximation algorithm for the boxicity of circular arc graphs |
| 2012-03-30, 11:00 | Bodhayan Roy | Point visibility graphs |
| 2012-03-23, 11:00 | Michiel Smid | Dumbell trees, Part B |
| 2012-03-16, 11:00 | Michiel Smid | Dumbell trees, Part I |
| 2012-03-09, 11:00 | Jit Bose | The stretch factor of L1- and L∞-Delaunay triangulations |
| 2012-02-17, 11:00 | Pat Morin | Interference |
| 2012-02-03, 11:00 | Bob Fraser | The discrete unit disk cover problem |
| 2012-01-27, 11:00 | Matthew Eastman | Aperiodic tilings |
| 2012-01-20, 11:00 | Dan Chen | On approximate range counting and depth |
| 2011-12-09, 11:00 | Jean-Lou de Carufel | Everything you always wanted to know about polynomial equation solving (but were afraid to ask) |
| 2011-11-25, 11:00 | Prosenjit Bose | Every 4-connect planar graph has a Hamiltonian cycle |
| 2011-11-18, 11:00 | Carsten Grimm | Multiple-source shortest paths in planar graphs |
| 2011-11-11, 11:00 | Sander Verdonschot | Monte-Carlo tree search in computer Go |
| 2011-10-28, 11:00 | John Howat | Biased predecessor search |
| 2011-10-21, 11:00 | André van Renssen | On plane bounded-degree spanners |
| 2011-10-14, 11:00 | Anil Maheshwari | Minimum spanning trees |
| 2011-09-30, 11:00 | Stephane Durocher | Linear-space data structures for range mode query in arrays |
| 2011-09-23, |
Lino Demasi | Rooted minors and delta wye transformations |
| 2011-09-16, 11:00 | Michiel Smid | An Ω(nlog n) lower bound for computing the sum of even-ranked elements |
| 2011-08-30, 11:00 | Summer Students | TBA |
| 2011-08-23, 11:00 | Carsten Grimm | The flow path problem |
| 2011-08-02, 11:00 | Several speakers | CCCG practice talks |
| 2011-07-26, 11:00 | Andre van Renssen | Competitive routing in the half-θ6-graph |
| 2011-07-19, 11:00 | Dan Chen | Algorithms for bivariate majority depth |
| 2011-07-12, 11:00 | Christian Wulff-Nilsen | Distance oracles with near-linear preprocessing time for undirected graphs |
| 2011-07-05, 11:00 | John Howat | Range queries on grids |
| 2011-06-28, 11:00 | Dana Jansens | Efficient delta-universal and strongly-universal hashing |
| 2011-06-21, 11:00 | Sander Verdonschott | Making triangulations 4-connected using flips |
| 2011-06-14, 11:00 | Rolf Fagerberg | Some new results on the dynamic optimality problem |
| 2011-06-07, 11:00 | Jit Bose | Short Proofs of Kuratowski's and Fáry's Theorems |
| 2011-05-31, 11:00 | Michiel Smid | Colored range searching |
| 2011-05-24, 11:00 | Pat Morin | An overview of practical and provably good hash functions |
| 2011-02-09, 11:00 | Michiel Smid | A randomized construction of fault-tolerant spanners |
| 2011-01-04, 11:00 | Svetlana Stolpner | Medial axis for shape representation |
| 2010-11-30, 11:00 | Anil Maheshwari | Some results on metric embeddings |
| 2010-11-16, 11:00 | Carsten Grimm | A short introduction to frequent pattern mining |
| 2010-11-09, 11:00 | Pat Morin | Graph drawings with large crossing angles |
| 2010-10-05, 11:00 | Jit Bose | Perfect matchings in Delaunay triangulations |
| 2010-09-28, 11:00 | Christian Wulff-Nilsen | Min st-cuts in planar graphs |
| 2010-09-21, 11:00 | Sander Verdonschot | Optimizing regular edge labelings |
| 2010-09-14, 11:00 | Andre van Renssen | The 2x2 simple packing problem |
| 2010-08-19, 11:00 | Wenping Wang | Centroidal Voronoi tessellation vs. optimal Delaunay triangulation |
| 2010-06-23, 11:00 | Joachim Gudmundsson | Covering visibility regions with triangles |
| 2010-06-16, 11:00 | Pooya Davoodi | The 2-d range minimum problem |
| 2010-06-09, 11:00 | Karim Douieb | Fast catenable dictionaries |
| 2010-06-02, 11:00 | Dan Chen | Absolute approximation of Tukey depth: Theory and experiments |
| 2010-05-26, 11:00 | Pat Morin | Maximum interference for transmitters uniformly distributed on a segment |
| 2010-05-19, 11:00 | Michiel Smid | An optimal algorithm for computing angle-constrained spanners |
| 2010-04-28, 11:00 | Jean-Lou De Carufel | Minimum enclosing-area triangle with a fixed angle |
| 2010-04-14, 11:00 | Pat Morin | Oja depth and centers of gravity |
| 2010-04-07, 11:00 | Craig Dillabaugh | I/O-efficient algorithms for computing contours on a terrain |
| 2010-03-31, 11:00 | Jit Bose | New constructions of low-degree planar spanners |
| 2010-03-24, 11:00 | John Howat | Layered working-set trees |
| 2010-03-17, 11:00 | Dana Jansens | Efficient counting |
| 2010-03-10, 11:00 | Dan Chen | Memoryless routing in convex subdivisions |
| 2010-03-03, 11:00 | Anil Maheshwari | Empty region queries |
| 2010-02-24, 11:00 | Wolfgang Mulzer | Delaunay triangulations in O(sort(n)) time and more |
| 2010-02-24, 10:00 | Maarten Loffler | Computing similarity between piecewise-linear functions |
| 2010-02-10, 11:00 | Michiel Smid | On some combinatorial problems in metric spaces of bounded doubling dimension |
| 2010-02-03, 11:00 | Giuseppe Prencipe | Distributed coordination of a set of autonomous mobile robots |
| 2010-01-27, 11:00 | Dania El-Khechen | Partitioning a polygon into congruent pieces |
| 2010-01-20, 11:00 | Karim Douieb | Maintaining order in a list |
| 2010-01-13, 11:00 | Vida Dujmovic | Decompositions preserving minimum feature size |
| 2010-01-06, 11:00 | Pat Morin | X/Y-fast tries and an open problem |