| No. |
Title |
Author |
Year |
| 1 |
Fast Coloring Despite Congested Relays |
Flin, Maxime et al. |
2023 |
| 2 |
Fast Distributed Vertex Splitting with Applications |
Halldórsson, Magnús M. et al. |
2022 |
| 3 |
Coloring Fast Without Learning Your Neighbors' Colors |
Halldórsson, Magnús M. et al. |
2020 |
| 4 |
Query-Competitive Sorting with Uncertainty |
Halldórsson, Magnús M. et al. |
2019 |
| 5 |
The Capacity of Smartphone Peer-To-Peer Networks |
Dinitz, Michael et al. |
2019 |
| 6 |
Spanning Trees With Edge Conflicts and Wireless Connectivity |
Halldórsson, Magnús M. et al. |
2018 |
| 7 |
An Efficient Communication Abstraction for Dense Wireless Networks |
Halldórsson, Magnús M. et al. |
2017 |
| 8 |
Universal Framework for Wireless Scheduling Problems |
Ásgeirsson, Eyjólfur I. et al. |
2017 |
| 9 |
Distributed Approximation of k-Service Assignment |
Halldórsson, Magnús M. et al. |
2016 |
| 10 |
The Price of Local Power Control in Wireless Scheduling |
Halldórsson, Magnús M. et al. |
2015 |
| 11 |
Online Scheduling with Interval Conflicts |
Halldorsson, Magnus M. et al. |
2011 |
