This semester (Fall 2014), the algorithms seminar will normally take place on Fridays at 11:00-12:00 in room 5345 HP. Anyone with an interest in algorithms is encouraged to attend.

(We also have an archive of the seminars in 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013.)

Previous seminars

2014-12-12, 11:00
Ahmad Biniaz
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
2014-11-14, 11:00
Gregory Bint
ρ-Significant Range Queries
2014-11-07, 11:00
Farah Chanchary
Counting Subgraphs in Relational Event Graphs
2014-10-30, 11:00
Jean-Lou De Carufel
Two Drunk Researchers
2014-10-24, 11:00
Darryl Hill
Bounded Degree Planar Spanners
2014-10-17, 11:00
Anthony D'Angelo
Universal Traversal Sequences
2014-10-10, 11:00
Sander Verdonschot
New and Improved Spanning Ratios for Yao Graphs
2014-10-03, 11:00
John Howat
Filling holes in three-dimensional triangular meshes
2014-09-26, 11:00
Christian Scheffer
Approximation algorithms for geometrical distance problems
2014-09-19, 11:00
Subhas Nandy
Facility location problems in the read-only memory with constant work-space
2014-09-12, 11:00
Alexis Beingessner
Robin Hood Hashing
2014-08-01, 11:00
Various Speakers
CCCG Practice Talks
2014-07-16, 11:00
Christian Glacet
The impact of edge deletions on the number of errors in networks
2014-07-11, 11:00
Jean-Lou De Carufel
Towards a General Framework for Searching on a Line and Searching on m Rays
2014-07-04, 11:00
Tommy Reddad
The Shannon Capacity of Graphs
2014-06-06, 10:00
Oliver van Kaik
High-level representations for shape understanding
2014-05-30, 11:00
Ahmad Biniaz
Relative neighborhood graphs help euclidean bottleneck problems
2014-05-23, 11:00
Bahram Kouhestani
Routing in a terrain with the shortest beacon watchtower
2014-05-16, 11:00
Ferran Hurtado
Colored line arrangements
2014-05-09, 11:00
Giovanni Viglietta
Theorems with balls
2014-05-02, 9:00
Various Speakers
Discrete Math Days
2014-05-01, 9:00
Various Speakers
Discrete Math Days
2014-04-30, 11:00
Timo Bolkart
Statistical analysis of 3D faces in motion
2014-04-11, 11:00
Alexis Beingessner
Why Dijkstra's algorithm is slow, and when we can do better
2014-04-04, 14:00
Sander Verdonschot
On the advice complexity of the knapsack problem
2014-03-28, 11:00
Michiel Smid
Path-minimum queries in trees in O(1) time using O(n) space
2014-03-21, 11:00
Alina Shaikhet
A survey on geometric probing
2014-03-07, 11:00
Carsten Grimm
Rappaport's construction of the furthest-disc Voronoi diagram
2014-02-28, 10:00
Gábor Lugosi
Lecture series on algorithms and probability
2014-02-26, 13:00
Gábor Lugosi
Lecture series on algorithms and probability
2014-02-21, 13:00
Gábor Lugosi
Lecture series on algorithms and probability
2014-02-21, 10:00
Derek Bradley
High-quality facial performance capture for realistic computer-generated characters
2014-02-19, 13:00
Gábor Lugosi
Lecture series on algorithms and probability
2014-02-19, 11:00
Carsten Grimm
A survey on the fate of digital footprints after death
2014-02-14, 10:00
Gábor Lugosi
Lecture series on algorithms and probability
2014-02-12, 13:00
Gábor Lugosi
Lecture series on algorithms and probability
Random graphs: Connectivity
2014-02-07, 13:00
Gábor Lugosi
Lecture series on algorithms and probability
Random graphs: Copies of small subgraphs
2014-02-07, 10:00
Dong Wang
Assured information distillation in social sensing
2014-01-31, 10:00
Stacey Scott
Let's play: Exploring interface design challenges of digital tabletops using games
2014-01-24, 11:00
Pat Morin
The average degree of theta graphs
2014-01-17, 11:00
Luis Barba
Detecting intersections between convex polyhedra
2014-01-17, 10:00
Darryl Hill
Bounded degree Delaunay graphs in the constrained setting