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-1.5 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.)
| Date |
Speaker |
Topic |
| 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 |