22nd ARCO Meeting 2016 SDU
The main event takes place from 10:00 - 16:15, with morning coffee before that and dinner at a downtown restaurant afterwards.
Find more information on the meeting (participants, travel information etc.) on the IMADA SDU website.
|9:30–9:59||Coffee and rolls|
|9:59–10:00||The unbearably long welcome speech|
|10:00–10:30||Christian Wulff-Nilsen: Polynomially Faster Las-Vegas Worst-Case Dynamic Connectivity|
|10:30–11:00||Eva Rotenberg: A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time|
|11:15–11:45||Bengt J. Nilsson: An Approximation Algorithm for the Two-Watchman Route in a Simple Polygon|
|11:45–12:15||Rolf Fagerberg: On Routing in Geometric Spanners|
|12:15–13:45||Lunch and Business Meeting|
|13:45–14:15||Michal Kotrbčík: Online Dominating Set|
|14:15–14:45||Frederik Rye Skjoldjensen: Subsequence Automata with Default Transitions|
|14:45–15:15||Coffee and cake|
|15:15–15:45||Jyrki Katajainen: Worst-Case-Efficient Dynamic Arrays in Practice|
|15:45–16:15||Martin Aumüller: Multi-Pivot Quicksort: Comparison-Optimal Algorithms and Beyond|
|16:15–16:45||Open problems and/or beer and soft drink session|
|Post Workshop Event|
|16:45–17:30||Guided transportation to downtown|
For registering, please e-mail Joan Boyar (firstname.lastname@example.org) - no later than 24 March - indicating your name and affiliation, and whether or not you would like to stay for dinner.