Algorithmic Research Cooperation, ARCO, is a collaboration between computer science departments at universities in the Öresund region.

ARCO was established in 2011 with the mission to foster collaboration, innovation, to facilitate knowledge exchange, and research partnerships in the area of algorithmic research around the Öresund region.

Workshops

ARCO organises workshops every autumn and spring to give researchers and, above all, doctoral students the opportunity to disseminate their research results within the network.

29th ARCO 2023

SDU Odense, 24 November 2023.

Programme

09:00 – 10:00 Welcome and coffee
10:00 – 10:20 Kevin Schewior (SDU): Threshold Testing and Semi-Online Prophet Inequalities
10:20 – 10:40 Sudarshan Shyam (AU): Envy-Freeness under Generalized Assignment Constraints
10:40 – 11:00 Noel Arteche (Lund): Quantum Automatability
11:00 – 11:15 Coffee Break
11:15 – 11:35 Aniket Basu Roy (AU): Packing Fréchet Balls
11:35 – 11:55 Anna Brötzner (Malmö): m Watchmen’s Routes in Minbar Polygons
11:55 – 12:15 Camilla Okkels (ITU): Multi-Level Locality-Sensitive Hashing for Sub-Quadratic Time DBSCAN Clustering
12:15 – 13:00 Lunch Break (sandwiches provided)
13:00 – 13:20 Arthur da Cunha (AU): Revisiting the Random Subset Sum Problem
13:20 – 13:40 Jens Kristian Refsgaard Schou (AU): Functional Point Location
13:40 – 14:00 Coffee Break
14:00 – 14:20 Mingmou Liu (KU): Sparsity-Dimension Trade-Offs for Oblivious Subspace Embeddings
14:20 – 14:40 George Osipov (Linköping): Almost Satisfiable Systems of Linear Equations
14:40 – 15:10 Coffee Break with Cake
15:10 – 15:30 Hao Wu (KU): Tight Data Access Bounds for Private Top-k Selection
15:30 – 15:50 Teresa Anna Steiner (DTU): Differential Privacy with Strings Attached
15:50 – 16:10 Joel Daniel Andersson (KU): A Smooth Binary Mechanism for Efficient Private Continual Observation
16:10 – 16:30 Coffee Break
16:30 – 16:50 Daniel Rutschmann (DTU): Triangulations Admit Dominating Sets of Size 2n/7
16:50 – 17:10 Jonas Conneryd (Lund): Graph Colouring Is Hard on Average for Polynomial Calculus
17:10 – 17:30 Anders Yeo (SDU): Digraph Partitioning Generalizing Max-Cut
17:30 – 20:00 Dinner (pizza provided)

28th ARCO 2023

KU Copenhagen 21 April 2023.

Programme

09:30 – 10:00 Arrivals and welcome (Coffee served)
10:00 – 10:20 Riko Jacob: Universal Sorting: Finding a DAG using Priced Comparisons
10:20 – 10:40 Niv Dayan: Scaling Database Storage Engines
10:40 – 11:00 Tamalika Mukherjee: Differentially Private L2-Heavy Hitters in the Sliding Window Model
11:00 – 11:20 Coffee break
11:20 – 11:40 Magnus Berg: Online Minimum Spanning Trees with Weight Predictions
11:40 – 12:00 Bengt J. Nilsson: Online Bin Covering of Vectors with a Little Advice
12:00 – 13:00 Lunch
13:00 – 13:20 Mikkel Abrahamsen: Partitioning a Polygon Into Small Pieces
13:20 – 13:40 Aniket Basu Roy: Covering Orthogonal Polygons with Rectangles
13:40 – 14:00 Coffee break
14:00 – 14:20 Hanwen Zhang: Minimum Star Partitions of Simple Polygons in Polynomial Time
14:20 – 14:40 Marcin Pilipczuk: On metric embeddings of planar graphs
14:40 – 15:00 Coffee break
15:00 – 15:20 Mingmou Liu: Lower Bounds for Sparse Oblivious Subspace Embeddings
15:20 – 15:40 Zhile Jiang: Computing better approximate pure Nash equilibria in cut games via semidefinite programming
16:30 – Pizza and Open Problems

27th ARCO 2022

 Malmö University, 6 May 2022.

Programme

10:30 – 11:00 Welcome and coffee
11:00 – 11:30 Matti Karppa: HyperLogLogLog: Cardinality Estimation With One Log More
11:30 – 12:00 Tord Stordalen: Predecessor on the Ultra-Wide Word RAM
12:00 – 13:40 Lunch
13.40 – 14:00 Ioana Bercea: Daisy Bloom Filters
14:00 – 14:30 Erik Krohn: Local Search, More Powerful Than You Thought
14:30 – 15:00 Riko Jacob: On the Complexity of List Ranking in the Parallel External Memory Model
15:00 – 15:40 Coffee break
15:40 – 16:10 Kilian Risse: The Minimum Circuit Size Problem is hard for Sum of Squares
16:10 – 16:30 Aleksander Bjørn Grodt Christiansen: Maintaining smaller out-orientations
17:30 – Dinner

Steering committee