Noon seminar

The informal research seminar of the ALGO and AGA groups. Talks last roughly 25 minutes, with five extra minutes allocated for discussion. Many presentations are focussed on recent conference presentations, or practice talks for upcoming conferences. New members are often asked to give an overview of their field of research. Talks given by invited speakers may take up to 45-60 minutes including questions.

To be kept up-to-date about noon seminar presentations, please subscribe to the algoseminar-l mailing list.

All noon seminar schedules: 2018 · 2017 · 2016 · 2015 · 2014 · 2013 · 2012 · 2011 · 2010 · 2009 · 2008 · 2007 · 2006 · 2005

 

Upcoming Talks:

No Upcoming Talks

Previous Talks:

Quartile 2:
Time: Tuesday 12:45-13:15

Date Room Speaker Title
Dec 4 Monday
12:00-12:30
MF 3 Leo van Gansewinkel Discovering Audibly Recognizable Patterns within Tune Families
Dec 5 Tuesday MF 12 Mark de Berg Removing depth-order cycles among triangles: An efficient algorithm generating triangular fragments.
Dec 12 Tuesday
15:00-15:30
FLUX 1.07 Jeroen van Oorschot CANCELLED
Dec 12 Tuesday MF 13 Arthur van Goethem CANCELLED

Quartile 1:
Time: Tuesday 12:45-13:15

Date Room Speaker Title
Sep 14 Thursday
13:15-13:45
MF 3 Jules Wulms The Painters Problem: covering a grid with colored connected polygons
Sep 14 Thursday
12:45
MF 3 Max Sondag Stable Treemaps via Local Moves
Sep 21 Thursday
12:45
MF 3 Tom van Diggelen Efficient trajectory queries under the Fréchet distance (GIS Cup)
Oct 10 Tuesday MF 14 Mehran Mehr Range-Clustering Queries
Oct 24 Tuesday MF 14 Sándor Kisfaludi-Bak ETH-tight algorithmic and lower bound framework in geometric intersection graphs
Nov 7 Tuesday MF 15 Aleksandar Markovic Dynamic Conflict-Free Coloring in the Plane

Quartile 4:
Time: Tuesday 12:45-13:15

Date Room Speaker Title
May 23 Tuesday MF 13 Kevin Buchin Folding Free-Space Diagrams
May 31 Wednesday
12:45
MF 3 Wouter Meulemans Map LineUps: effects of spatial structure on graphical inference
Jun 9 Friday
11:45-12:15
MF 6.131 Willem Sonke Computing Representative Networks for Braided Rivers
Jun 9 Friday
11:00-11:30
MF 6.131 Tim Ophelders Sweeping Surfaces using Short Curves
Jun 13 Tuesday MF 13 Max Konzack Visual Exploration of Migration Patterns
Jun 15 Thursday
12:45-13:30
MF 6.131 Luuk van Hulten Map matching in cartographic schematization
Jul 19 Wednesday
13:00-13:30
MF 4 Huib Donkers Feed Link Placement in Euclidean Graphs
Jul 27 Thursday
13:00-13:30
MF 4 Wim Reddingius Progressive Minimum-Link Simplification of Polygonal Curves
Aug 25 Friday
12:45
MF 12 Astrid Pieterse Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials

Quartile 3:
Time: Tuesday 12:30-13:00

Date Room Speaker Title
Feb 9 Thursday
15:00-15:30
MF 3 Marc van Kreveld Competitive Analysis of the Pokemon Go Search Problem
Feb 20 Monday
15:00-15:30
MF 4 Ralph C. Bottesch Oracle Machines and Interactive Proofs in Parameterized Complexity
Mar 9 Thursday
10:45-11:15
MF 6.131 Sander Beekhuis On k-sided rectangular duals
Mar 14 Tuesday
13:00-13:30
MF 3 Giordano Da Lozzo Intersection-Link Representations of Graphs
Mar 20 Monday
12:30-13:15
MF 11 Manfred Scheucher A superlinear lower bound on the number of 5-holes
Mar 21 Tuesday
13:00-13:30
MF 3 Quirijn Bouts Complexity Measures for Mosaic Drawings
Mar 22 Wednesday
12:45-13:30
MF 3 Marcel Radermacher How To Draw a Planarization
Mar 28 Tuesday
13:00-14:30
MF 3 Sándor, Aleks, and Ali EuroCG practice talks
Mar 29 Wednesday
14:30-15:30
MF 6.131 Tim, and Willem EuroCG practice talks
Apr 18 Tuesday
14:00-14:30
MF 3 Sándor Kisfaludi-Bak On the Exact Complexity of Hamiltonian Cycle and q-Coloring in Disk Graphs

Quartile 2:
Time: Tuesday 12:30-13:00

Date Room Speaker Title
Jan 24 Tuesday MF 3 Ignaz Rutter Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings