Magnús M. Halldórsson

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 100

Top Venues

Publications

Magnús M. Halldórsson, Dror Rawitz
Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO (2024)
Yannic Maus, Magnús M. Halldórsson
Distributed Delta-Coloring under Bandwidth Limitations. CoRR (2024)
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
A Distributed Palette Sparsification Theorem. SODA (2024)
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
Decentralized Distributed Graph Coloring: Cluster Graphs. CoRR (2024)
Magnús M. Halldórsson, Dror Rawitz
Online Multiset Submodular Cover. Algorithmica 86 (7) (2024)
Magnús M. Halldórsson, Yannic Maus, Saku Peltonen
Distributed Lovász Local Lemma under Bandwidth Limitations. CoRR (2024)
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
Fast Coloring Despite Congested Relays. CoRR (2023)
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
Fast Coloring Despite Congested Relays. DISC (2023)
Magnús M. Halldórsson, Alexandre Nolin
Superfast coloring in CONGEST via efficient color sampling. Theor. Comput. Sci. 948 (2023)
Manuela Fischer, Magnús M. Halldórsson, Yannic Maus
Fast Distributed Brooks' Theorem. SODA (2023)
Magnús M. Halldórsson
SIROCCO Prize for Innovation in Distributed Computing - Laudatio for Boaz Patt-Shamir. Bull. EATCS 141 (2023)
Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin
Distributed Coloring of Hypergraphs. SIROCCO (2023)
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
Coloring Fast with Broadcasts. SPAA (2023)
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
Coloring Fast with Broadcasts. CoRR (2023)
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
A Distributed Palette Sparsification Theorem. CoRR (2023)
Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
Overcoming Congestion in Distributed Coloring. PODC (2022)
Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan
Near-optimal distributed degree+1 coloring. STOC (2022)
Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin
Fast Distributed Vertex Splitting with Applications. CoRR (2022)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. Algorithmica 84 (4) (2022)
Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin
Fast Distributed Vertex Splitting with Applications. DISC (2022)
Manuela Fischer, Yannic Maus, Magnús M. Halldórsson
Fast Distributed Brooks' Theorem. CoRR (2022)
Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
Overcoming Congestion in Distributed Coloring. CoRR (2022)
Magnús M. Halldórsson, Tigran Tonoyan
Sparse Backbone and Optimal Distributed SINR Algorithms. ACM Trans. Algorithms 17 (2) (2021)
Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
Ultrafast Distributed Coloring of High Degree Graphs. CoRR (2021)
Magnús M. Halldórsson, Alexandre Nolin
Superfast Coloring in CONGEST via Efficient Color Sampling. CoRR (2021)
Magnús M. Halldórsson, Murilo Santos de Lima
Query-competitive sorting with uncertainty. Theor. Comput. Sci. 867 (2021)
Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan
Generalized Disk Graphs. WADS (2021)
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
Network Design under General Wireless Interference. Algorithmica 83 (11) (2021)
Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan
Near-Optimal Distributed Degree+1 Coloring. CoRR (2021)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan
Efficient randomized distributed coloring in CONGEST. STOC (2021)
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49 (1) (2021)
Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan
Query minimization under stochastic uncertainty. Theor. Comput. Sci. 895 (2021)
Magnús M. Halldórsson, Tigran Tonoyan
Computing inductive vertex orderings. Inf. Process. Lett. 172 (2021)
Magnús M. Halldórsson, Alexandre Nolin
Superfast Coloring in CONGEST via Efficient Color Sampling. SIROCCO (2021)
Magnús M. Halldórsson, Tigran Tonoyan
Effective Wireless Scheduling via Hypergraph Sketches. SIAM J. Comput. 50 (2) (2021)
Magnús M. Halldórsson, Christian Konrad
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. Theor. Comput. Sci. 811 (2020)
Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
Simple and local independent set approximation. Theor. Comput. Sci. 846 (2020)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin
Coloring Fast Without Learning Your Neighbors' Colors. DISC (2020)
Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan
Limitations of current wireless link scheduling algorithms. Theor. Comput. Sci. 840 (2020)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin
Coloring Fast Without Learning Your Neighbors' Colors. CoRR (2020)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan
Efficient Randomized Distributed Coloring in CONGEST. CoRR (2020)
Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan
Query Minimization Under Stochastic Uncertainty. LATIN (2020)
Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin
Distributed Testing of Distance-k Colorings. SIROCCO (2020)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus
Distance-2 Coloring in the CONGEST Model. CoRR (2020)
Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou, Nancy A. Lynch
Leader election in SINR model with arbitrary power control. Theor. Comput. Sci. 811 (2020)
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus
Distance-2 Coloring in the CONGEST Model. PODC (2020)
Magnús M. Halldórsson, Murilo Santos de Lima
Query-Competitive Sorting with Uncertainty. CoRR (2020)
Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan
Query Minimization under Stochastic Uncertainty. CoRR (2020)
Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. CoRR (2020)
Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA (2020)
Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
Radio aggregation scheduling. Theor. Comput. Sci. 840 (2020)
Magnús M. Halldórsson, Tigran Tonoyan
Plain SINR is Enough! PODC (2019)
Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport
Distributed Minimum Degree Spanning Trees. PODC (2019)
Magnús M. Halldórsson, Murilo Santos de Lima
Query-Competitive Sorting with Uncertainty. MFCS (2019)
Magnús M. Halldórsson, Sven Köhler, Dror Rawitz
Distributed approximation of k-service assignment. Distributed Comput. 32 (1) (2019)
Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu
Leveraging multiple channels in ad hoc networks. Distributed Comput. 32 (2) (2019)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
The Capacity of Smartphone Peer-To-Peer Networks. DISC (2019)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
The Capacity of Smartphone Peer-to-Peer Networks. CoRR (2019)
Magnús M. Halldórsson, Tigran Tonoyan
Link Scheduling under Correlated Shadowing. WiOpt (2019)
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
Spanning Trees With Edge Conflicts and Wireless Connectivity. CoRR (2018)
Magnús M. Halldórsson
Session details: Session 3C: Coloring. PODC (2018)
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
Spanning Trees With Edge Conflicts and Wireless Connectivity. ICALP (2018)
Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
Simple and Local Independent Set Approximation. SIROCCO (2018)
Magnús M. Halldórsson, Tigran Tonoyan
Effective Wireless Scheduling via Hypergraph Sketches. CoRR (2018)
Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
Simple and Local Independent Set Approximation. CoRR (2018)
Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz
Distributed backup placement in networks. Distributed Comput. 31 (2) (2018)
Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
Brief Announcement: Simple and Local Independent Set Approximation. PODC (2018)
Magnús M. Halldórsson, Nicole Megow, Clifford Stein
Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports 8 (3) (2018)
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
Distributed Algorithms for Minimum Degree Spanning Trees. CoRR (2018)
Magnús M. Halldórsson, Christian Konrad
Computing large independent sets in a single round. Distributed Comput. 31 (1) (2018)
Magnús M. Halldórsson, Naoki Kobayashi, Bettina Speckmann
Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan. Inf. Comput. 261 (2018)
Magnús M. Halldórsson, Tigran Tonoyan
Wireless Aggregation at Nearly Constant Rate. ICDCS (2018)
Magnús M. Halldórsson, Tigran Tonoyan
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. PODC (2018)
Magnús M. Halldórsson, Christian Konrad
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. SIROCCO (2017)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. WADS (2017)
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
Max point-tolerance graphs. Discret. Appl. Math. 216 (2017)
Magnús M. Halldórsson, Tigran Tonoyan
Wireless Link Capacity under Shadowing and Fading. CoRR (2017)
Magnús M. Halldórsson, Tigran Tonoyan
Aggregation Rate for Compressible Functions. MobiHoc (2017)
Magnús M. Halldórsson, Tigran Tonoyan
Wireless Link Capacity under Shadowing and Fading. MobiHoc (2017)
Magnús M. Halldórsson, Tigran Tonoyan
Universal Framework for Wireless Scheduling Problems. CoRR (2017)
Christina Fragouli, Magnús M. Halldórsson, Kyle Jamieson, Bhaskar Krishnamachari
Foundations of Wireless Networking (Dagstuhl Seminar 17271). Dagstuhl Reports 7 (7) (2017)
Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer
The Power of Oblivious Wireless Power. SIAM J. Comput. 46 (3) (2017)
Dongxiao Yu, Yuexuan Wang, Tigran Tonoyan, Magnús M. Halldórsson
Dynamic Adaptation in Wireless Networks Under Comprehensive Interference via Carrier Sense. IPDPS (2017)
Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport
An Efficient Communication Abstraction for Dense Wireless Networks. DISC (2017)
Magnús M. Halldórsson, Tigran Tonoyan
Wireless Aggregation at Nearly Constant Rate. CoRR (2017)
Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou
Leader Election in SINR Model with Arbitrary Power Control. SIROCCO (2017)
Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. PODC (2017)
Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan
Universal Framework for Wireless Scheduling Problems. ICALP (2017)
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32 (4) (2016)
Yuval Emek, Magnús M. Halldórsson, Adi Rosén
Space-Constrained Interval Selection. ACM Trans. Algorithms 12 (4) (2016)
Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu
Leveraging Multiple Channels in Ad Hoc Networks. CoRR (2016)
Magnús M. Halldórsson, Pradipta Mitra
Nearly optimal bounds for distributed wireless scheduling in the SINR model. Distributed Comput. 29 (2) (2016)
Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu
Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. PODC (2016)
Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn
Brief Announcement: Local Independent Set Approximation. PODC (2016)
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. 201 (2016)
Magnús M. Halldórsson
Invited paper: Models for wireless algorithms. WiOpt (2016)
Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica 74 (4) (2016)
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. 199 (2016)
Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu
Data Dissemination in Unified Dynamic Wireless Networks. CoRR (2016)
Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy
Streaming Algorithms for Independent Sets in Sparse Hypergraphs. Algorithmica 76 (2) (2016)

Magnús M. Halldórsson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Magnús M. Halldórsson