![[topimage]](https://imada.sdu.dk/u/kslarsen/BannerWithSDULogo.jpg)
- Relaxing the Irrevocability Requirement for Online Graph Algorithms.
- Joan Boyar, Lene M. Favrholdt, Michal Kotrbčík, and Kim S. Larsen.
In Fifteenth International Algorithms and Data Structures Symposium (WADS), volume 10389 of Lecture Notes in Computer Science, pages 217-228. Springer, 2017.
- other publications
- Other publications by the author.
