25th ARCO 2018 at Malmö University

The ARCO Workshop on April 6th, 2016 will be held at Malmö University.
Location: Orkanen (sessions) and Niagara (lunch, comp. sci. offices),
located around Nordenskiöldsgatan, Malmö.

If you intend to participate, please send send a mail to jesper.larsson@mau.se. Registration for lunch/coffee/dinner may be refused at this time, but participation in presentations is still open.


12:00–12:10 Welcome
12:10–13:00 Rasmus Pagh: (longer talk) Hardness and Approximation of High-Dimensional Search Problems
13:00–14:15 Lunch and business meeting
14:15–14:40 Daniel Merkle: Graph Canonicalization Algorithms and their Application in Cheminformatics
14:40–15:05 David Hammer: Multi-way search trees of low height
15:05–15:30 Thore Husfeldt: Extensor-Coding
15:30–16:00 Coffee break
16:00–16:20 Andreas Björklund: Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
16:20–16:50 Radu Curticapean: The complexity of graph motif parameters
16:50–20:00 (ca.) Hang-out and dinner