Efficient Recomputation for Changeful Problems

Project: Research

Theoretical Computer Science -> Algorithm Design and Analysis

The Complexity of Stackelberg Pricing Games
Grüne, C., Henke, D., Rotenberg, E. & Wulf, L., 25 Aug 2026, 34th Annual European Symposium on Algorithms (ESA 2026). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 141:1-141:16 17 p. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 388).
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Open Access
File
The Gallai Vertex Problem is $Θ_2^p$-Complete
Nikabadi, A., Rotenberg, E. & Wulf, L., 13 May 2026, arXiv, p. 1-17, 17 p.
Research output: Working paper › Preprint

Open Access
A Dynamic Piecewise-Linear Geometric Index with Worst-Case Guarantees.
Gæde, E. T., van der Hoog, I., Rotenberg, E. & Stordalen, T., 2025, 33rd Annual European Symposium on Algorithms: ESA 2025, September 15–17, 2025, Warsaw, Poland. Benoit, A., Kaplan, H., Wild, S. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 64:1-64:18 19 p. 64. (Leibniz International Proceedings in Informatics).
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Open Access

Project Details