ARCO fall 2026

Thursday 12 November 2026, University of Copenhagen

Photo: Øresund Bridge, Malmö by Richard Dennis, CC BY 2.0.

ARCO (Algorithmic Research Cooperation around Øresund) is a recurring one-day meeting for researchers working on algorithms in the Øresund region. It takes place once or twice a year and moves between universities in the region. This fall it is hosted by BARC at the University of Copenhagen. Everyone interested in algorithms is welcome, including students.

Registration and talks

Registration is done through this form. If you would like to give a talk, you can indicate this in the same form.

Deadline for talk proposals: October 26 (Closed)
Deadline for registration: November 5

Program

09:30–09:55	Arrival
09:55–10:00	Welcome
10:00–11:10	Automata, Strings and Certified Solving Rikke Schjeldrup Jessen (DTU) – Improved Extended Regular Expression Matching Máximo Pérez López (DTU) – Tighter Bounds for Wheeler Determinization Christoffer Krogh (DTU) – Hardness and Approximation for Compressing Deterministic Finite Automata Wietze Koops (Lund and KU) – Certified Graph Colouring
11:10–11:30	Break
11:30–12:40	Complexity Theory Neha Pradip Kuntewar (IIT Madras) – Range Avoidance via Turán-type Bounds Duri Andrea Janett (ITU) – Average-Case Hardness of Binary-Encoded Clique Théo Borém Fabris (KU) – Derandomized Sunflowers and Radical Lower Bounds Varun Ramanathan (KU) – Highly Parallel Circuits for GCD, via Symmetric Polynomials
12:40–13:50	Lunch break (Biocenter canteen)
13:30–13:50	Business meeting (senior researchers should attend) / break (everyone else)
13:50–15:00	Geometry and Covering Simon Bartlmae (KU) – NP-hardness and a PTAS for the Euclidean Steiner Line Problem Roni Sherman (TMU Toronto) – k-Cell Decompositions for Pursuit-Evasion & an Exact k-Visibility Query Framework in Polygons (based on [BS26, BSS26, BSS25]) Egor Bakaev (KU) – Volume Stability of Plank Covers Manolis Vasilakis (SDU) – Parameterized Capacitated Vertex Cover Revisited
15:00–15:20	Break
15:20–16:30	Algorithms with Noisy Information Arsen Vasilyan (AU) – A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube Jens Schlöter (SDU) – Online Scheduling with a Stochastic Signal Matthias Gehnen (SDU) – Graph Exploration with Estimates Sia Sejer (KU) – Privacy by Postprocessing the Discrete Laplace Mechanism

Time and place

Thursday 12 November 2026

Auditorium 5, H. C. Ørsted Institut

Map showing Auditorium 5 at the H. C. Ørsted Institute, next to Nørre Allé

Lunch (12:40–13:50) will be in the canteen of the Biocenter, a short walk from the H. C. Ørsted Institute.

Map with the Biocenter canteen circled in red and a red line showing the walking route from it: past the Lundbeckfond auditorium to the corner of the sports field, then north-east along the path beside it to the entrance of the H. C. Ørsted Institute

Organizers

Rasmus Pagh, University of Copenhagen
Sophus Valentin Willumsgaard, University of Copenhagen