This semester (Fall 2015), the algorithms seminar will normally take place on Fridays at 10:30-11:30 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, 2014.)

Previous seminars

2015-01-16, 11:00
Lucas Rioux Maldague
Facial nonrepetitive colorings of biconnected outerplanar graphs
2015-01-23, 11:00
Medha Vasanth
Reordering buffer management - algorithms and experiments
2015-01-30, 11:00
Vida Dujmović
Non-repetitive colouring of planar and other proper minor-closed classes of graphs
2015-02-06, 13:00
Pat Morin
Compatible connectivity-augmentation
2015-02-13, 10:00
Arthur Zimek
Ensemble learning for outlier detection: Challenges and solutions
2015-02-20, 11:00
Michiel Smid
The well-separated pair decomposition for the unit-disk graph metric
2015-02-27, 10:00
Olga Baysal
Leveraging data analytics to support software development decisions
2015-03-02, 10:00
Yuhong Guo
Generalized information adaptation: Reducing annotation effort in data analysis
2015-03-06, 11:00
Anil Maheshwari
Shortest paths in unit disk graphs
2015-03-20, 11:00
David Wood
Monotone expanders and applications
2015-03-27, 11:00
Prosenjit Bose
Geometric encompassing graphs
2015-04-10, 13:00
Alina Shaikhet
Edge-constraint proximity graphs and their relations
2015-04-17, 11:00
Mahsa Moghaddam
Eigenvalue problems: Isospectrality and inverse eigenvalue problems
2015-04-24, 11:00
Tommy Reddad
Analytic combinatorics & applications
2015-05-15
Michael D Henschel
Ground movement from satellite interferometry and some problems in interconnectedness
2015-05-29, 11:00
Ahmad Biniaz
An optimal algorithm for plane matchings in multipartite geometric graphs
2015-06-12, 11:00
Micha Danny Krautter
Registration of human shapes in 3d: a geometric approach to landmark detection
2015-07-24, 11:00, Macphail room (HP 4351)
Chris Hoedemakers
The Kirkpatrick graph: a new type of spanner with small diameter
2015-08-14, 11:00
Wolfgang Mulzer
Approximability of the Discrete Fréchet Distance
Wednesday 2015-08-19, 11:00
Paul Seiferth
Spanners and Reachability Oracles for Directed Transmission Graphs
Wednesday 2015-08-19, 11:30
Yannik Stein
Computational Aspects of the Colorful Carathéodory Theorem
2015-08-21, 13:00
André van Renssen
Competitive Local Routing with Constraints
2015-09-11, 10:30
Alexis Beingessner
Ownership, Trust, and Data Structures
2015-09-18, 10:30
Carsten Grimm
Ben-Or's theorem: lower bounds in the algebraic computation tree model
Wednesday 2015-09-23, 12:30
George Kesidis
Network calculus for parallel processing
2015-09-25, 10:30, HP 4369
Anthony D'Angelo
Local Routing in Planar Orthogonal Subdivisions
Thursday 2015-10-01, 10:00
Michael Atkinson
Additive number theory and computer science
2015-10-02, 13:00
Sander Verdonschot
Flips in edge-labelled triangulations
2015-10-07, 12:30
Arnaud Labourel
Fault tolerant rendezvous in networks
2015-10-09, 10:30
Mahdi Amani
Cache-Efficient Balanced Search Trees Through Core Partitioning
2015-10-23, 10:30
Luis Barba
Dynamic graph coloring
2015-10-30, 10:30
Darryl Hill
On the spanning ratio of Theta 4
2015-11-06, 10:30
Jean-Lou De Carufel
Online routing on Delaunay triangulations
2015-11-13, 10:30
Carsten Grimm
A lower bound on supporting predecessor search in $k$ sorted arrays
2015-11-20, 10:30
Therese Biedl
Optimum-width upward drawings of trees
2015-11-27, 10:30
Joseph Peters
Spreading influence in social networks with time constraints
2015-12-04, 13:00
Michiel Smid
Lower Bounds for Computing Geometric Spanners
2015-12-11, 11:00
Anil Maheshwari
Some Results on Metric Embeddings - Part II