![[topimage]](TopBanner800.jpg)
 |
The project Trade-Offs for Algorithms Facing Uncertainty is funded by a DKK 720,000 grant from the Independent Research Fund Denmark, Natural Sciences, running from January 1, 2025 through December 31, 2027. |
 |
The project is carried out at the Department of Mathematics and Computer Science (IMADA) at the University of Southern Denmark. |
Participants
Environment
The project is carried out at the Department of Mathematics and Computer Science (IMADA) at the University of Southern Denmark. The participants are members of the Algorithms group and are all associated with the Research Training Program in Computer Science as Ph.D. advisors.Activities
Almost all activities on this grant are research related traveling to conferences, meetings by invitation, research collaboration, and hosting guests.Publications
Here we will list project publications when the project starts. Slightly older publications can be found on the page for our previous project. Complete lists for each participant can be found via our individual home pages or via dblp, the standard search engine for Computer Science publications. We link to the official site for published papers using the doi (digital object identifier) of the papers. For open access versions, we refer to each author's own home page.
Acknowledgement:
We are grateful to dblp
(2026-03-13)
for providing data for the publication list.
Peer-Reviewed International Journal Articles
- Online Interval Scheduling with Predictions
- Joan Boyar, Shahin Kamali, Lene M. Favrholdt, Kim S. Larsen.
J. Comput. Syst. Sci..
Accepted for publication
- On the Online Weighted Non-Crossing Matching Problem
- Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov.
Inf. Comput..
Accepted for publication
Peer-Reviewed International Conference Articles
- Complexity Classes for Online Problems with and Without Predictions.
- Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
IJTCS-FAW, Lecture Notes in Computer Science 15828: 49-63, Springer, 2025.
[Frontiers of Algorithmics - 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 - July 2, 2025, Proceedings.]
- Brief Announcement: Distributed Graph Algorithms with Predictions.
- Joan Boyar, Faith Ellen, Kim S. Larsen.
PODC: 322-325, ACM, 2025.
[Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 2025.]
- Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTAS.
- Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior.
APPROX/RANDOM, LIPIcs 353: 26:1-26:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
[Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025, Berkeley, CA, USA, August 11-13, 2025.]