2026-07-28T17:18:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27492 2026-07-28T08:37:34Z ddc:004 open_access

Online Algorithms beyond Competitive Analysis (Dagstuhl Seminar 25471) Im, Sungjin Megow, Nicole Panigrahi, Debmalya Singla, Sahil Shahkarami, Golnoosh algorithms under uncertainty beyond worst-case algorithm design online algorithms This report documents the program and the outcomes of Dagstuhl Seminar 25471: "Online Algorithms beyond Competitive Analysis". This seminar brought 45 leading researchers in online algorithms and related areas together for a discussion of the recent progress and challenges in various aspects of online algorithms. The seminar included several talks of varying lengths and an open problem session. In addition, sufficient time was set aside for research discussions and collaborations. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sungjin Im and Nicole Megow and Debmalya Panigrahi and Sahil Singla and Golnoosh Shahkarami 2026 Is Part Of Dagstuhl Reports, Volume 15, Issue 11 (2026) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.15.11.114 urn:nbn:de:0030-drops-274926 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.11.114 eng https://creativecommons.org/licenses/by/4.0/legalcode