Date 
Speaker 
Topic 
20101130, 11:00 
Anil Maheshwari 
Some results on metric embeddings 
20101116, 11:00 
Carsten Grimm 
A short introduction to frequent pattern mining 
20101109, 11:00 
Pat Morin 
Graph drawings with large crossing angles 
20101005, 11:00 
Jit Bose 
Perfect matchings in Delaunay triangulations 
20100928, 11:00 
Christian WulffNilsen 
Min stcuts in planar graphs 
20100921, 11:00 
Sander Verdonschot 
Optimizing regular edge labelings 
20100914, 11:00 
Andre van Renssen 
The 2x2 simple packing problem 
20100819, 11:00 
Wenping Wang 
Centroidal Voronoi tessellation vs. optimal
Delaunay triangulation

20100623, 11:00 
Joachim Gudmundsson 
Covering visibility regions
with triangles

20100616, 11:00 
Pooya Davoodi 
The 2d range minimum problem 
20100609, 11:00 
Karim Douieb 
Fast catenable dictionaries 
20100602, 11:00 
Dan Chen 
Absolute approximation of Tukey depth: Theory and experiments 
20100526, 11:00 
Pat Morin 
Maximum interference for transmitters uniformly distributed on a segment 
20100519, 11:00 
Michiel Smid 
An optimal algorithm for computing angleconstrained spanners 
20100428, 11:00 
JeanLou De Carufel 
Minimum enclosingarea triangle with a fixed angle 
20100414, 11:00 
Pat Morin 
Oja depth and centers of gravity 
20100407, 11:00 
Craig Dillabaugh 
I/Oefficient algorithms for computing contours on a terrain 
20100331, 11:00 
Jit Bose 
New constructions of lowdegree planar spanners 
20100324, 11:00 
John Howat 
Layered workingset trees 
20100317, 11:00 
Dana Jansens 
Efficient counting 
20100310, 11:00 
Dan Chen 
Memoryless routing in convex subdivisions 
20100303, 11:00 
Anil Maheshwari 
Empty region queries 
20100224, 11:00 
Wolfgang Mulzer 
Delaunay triangulations in O(sort(n)) time and more 
20100224, 10:00 
Maarten Loffler 
Computing similarity between piecewiselinear functions 
20100210, 11:00 
Michiel Smid 
On some combinatorial problems in metric spaces of bounded doubling dimension 
20100203, 11:00 
Giuseppe Prencipe 
Distributed coordination of a set of autonomous mobile robots 
20100127, 11:00 
Dania ElKhechen 
Partitioning a polygon into congruent pieces 
20100120, 11:00 
Karim Douieb 
Maintaining order in a list 
20100113, 11:00 
Vida Dujmovic 
Decompositions preserving minimum feature size 
20100106, 11:00 
Pat Morin 
X/Yfast tries and an open problem 