| 2026 | ICALP | Beyond Brooks: (Δ-1)-Coloring in Semi-Streaming. | Maxime Flin, Magns M. Halldrsson |
| 2026 | STOC | Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors. | Maxime Flin, Magns M. Halldrsson, Manuel Jakob, Yannic Maus |
| 2026 | STACS | Unit Interval Selection in Random Order Streams. | Cezar-Mihail Alexandru, Adithya Diddapur, Magns M. Halldrsson, Christian Konrad, Kheeran K. Naidu |
| 2025 | ESA | Streaming Diameter of High-Dimensional Points. | Magns M. Halldrsson, Nicolaos Matsakis, Pavel Vesel |
| 2025 | ICALP | Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. | Maxime Flin, Magns M. Halldrsson |
| 2025 | PODC | Decentralized Distributed Graph Coloring: Cluster Graphs. | Maxime Flin, Magns M. Halldrsson, Alexandre Nolin |
| 2025 | SIROCCO | Approximating Independent Sets in Constant Distributed Rounds. | Ravi B. Boppana, Magns M. Halldrsson |
| 2025 | SIROCCO | When MIS and Maximal Matching are Easy in the Congested Clique. | Keren Censor-Hillel, Tomer Even, Maxime Flin, Magns M. Halldrsson |
| 2024 | SODA | A Distributed Palette Sparsification Theorem. | Maxime Flin, Mohsen Ghaffari, Magns M. Halldrsson, Fabian Kuhn, Alexandre Nolin |
| 2024 | SIROCCO | Distributed Fractional Local Ratio and Independent Set Approximation. | Magns M. Halldrsson, Dror Rawitz |
| 2023 | SODA | Fast Distributed Brooks' Theorem. | Manuela Fischer, Magns M. Halldrsson, Yannic Maus |
| 2023 | SPAA | Coloring Fast with Broadcasts. | Maxime Flin, Mohsen Ghaffari, Magns M. Halldrsson, Fabian Kuhn, Alexandre Nolin |
| 2023 | SIROCCO | Distributed Coloring of Hypergraphs. | Duncan Adamson, Magns M. Halldrsson, Alexandre Nolin |
| 2022 | PODC | Overcoming Congestion in Distributed Coloring. | Magns M. Halldrsson, Alexandre Nolin, Tigran Tonoyan |
| 2022 | STOC | Near-optimal distributed degree+1 coloring. | Magns M. Halldrsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan |
| 2021 | STOC | Efficient randomized distributed coloring in CONGEST. | Magns M. Halldrsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan |
| 2021 | SIROCCO | Superfast Coloring in CONGEST via Efficient Color Sampling. | Magns M. Halldrsson, Alexandre Nolin |
| 2021 | WADS | Generalized Disk Graphs. | var Marrow Arnrsson, Steven Chaplick, Jkull Snr Gylfason, Magns M. Halldrsson, Jkull Mni Reynisson, Tigran Tonoyan |
| 2020 | LATIN | Query Minimization Under Stochastic Uncertainty. | Steven Chaplick, Magns M. Halldrsson, Murilo Santos de Lima, Tigran Tonoyan |
| 2020 | PODC | Distance-2 Coloring in the CONGEST Model. | Magns M. Halldrsson, Fabian Kuhn, Yannic Maus |
| 2020 | SIROCCO | Distributed Testing of Distance-k Colorings. | Pierre Fraigniaud, Magns M. Halldrsson, Alexandre Nolin |
| 2020 | WAOA | Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. | Magns M. Halldrsson, Guy Kortsarz, Marek Cygan |
| 2019 | MFCS | Query-Competitive Sorting with Uncertainty. | Magns M. Halldrsson, Murilo Santos de Lima |
| 2019 | PODC | Distributed Minimum Degree Spanning Trees. | Michael Dinitz, Magns M. Halldrsson, Taisuke Izumi, Calvin Newport |
| 2019 | PODC | Plain SINR is Enough! | Magns M. Halldrsson, Tigran Tonoyan |
| 2019 | WiOpt | Link Scheduling under Correlated Shadowing. | Magns M. Halldrsson, Tigran Tonoyan |
| 2018 | ICALP | Spanning Trees With Edge Conflicts and Wireless Connectivity. | Magns M. Halldrsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan |
| 2018 | ICDCS | Wireless Aggregation at Nearly Constant Rate. | Magns M. Halldrsson, Tigran Tonoyan |
| 2018 | PODC | Brief Announcement: Simple and Local Independent Set Approximation. | Ravi B. Boppana, Magns M. Halldrsson, Dror Rawitz |
| 2018 | PODC | Session details: Session 3C: Coloring. | Magns M. Halldrsson |
| 2018 | PODC | Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. | Magns M. Halldrsson, Tigran Tonoyan |
| 2018 | SIROCCO | Simple and Local Independent Set Approximation. | Ravi B. Boppana, Magns M. Halldrsson, Dror Rawitz |
| 2017 | ICALP | Universal Framework for Wireless Scheduling Problems. | Eyjlfur Ingi sgeirsson, Magns M. Halldrsson, Tigran Tonoyan |
| 2017 | MOBIHOC | Wireless Link Capacity under Shadowing and Fading. | Magns M. Halldrsson, Tigran Tonoyan |
| 2017 | MOBIHOC | Aggregation Rate for Compressible Functions. | Magns M. Halldrsson, Tigran Tonoyan |
| 2017 | PODC | Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. | Magns M. Halldrsson, Stephan Holzer, Evangelia Anna Markatou |
| 2017 | SIROCCO | Leader Election in SINR Model with Arbitrary Power Control. | Magns M. Halldrsson, Stephan Holzer, Evangelia Anna Markatou |
| 2017 | SIROCCO | Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. | Magns M. Halldrsson, Christian Konrad |
| 2017 | WADS | Posimodular Function Optimization. | Magns M. Halldrsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa |
| 2016 | PODC | Brief Announcement: Local Independent Set Approximation. | Marijke H. L. Bodlaender, Magns M. Halldrsson, Christian Konrad, Fabian Kuhn |
| 2016 | PODC | Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. | Magns M. Halldrsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu |
| 2016 | WiOpt | Invited paper: Models for wireless algorithms. | Magns M. Halldrsson |
| 2015 | Algosensors | Radio Aggregation Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Christian Konrad, Guy Kortsarz, Hoon Oh |
| 2015 | Algosensors | Limitations of Current Wireless Scheduling Algorithms. | Magns M. Halldrsson, Christian Konrad, Tigran Tonoyan |
| 2015 | OPODIS | Distributed Approximation of k-Service Assignment. | Magns M. Halldrsson, Sven Khler, Dror Rawitz |
| 2015 | PODC | A Local Broadcast Layer for the SINR Network Model. | Magns M. Halldrsson, Stephan Holzer, Nancy A. Lynch |
| 2015 | PODC | Leveraging Multiple Channels in Ad Hoc Networks. | Magns M. Halldrsson, Yuexuan Wang, Dongxiao Yu |
| 2015 | STOC | How Well Can Graphs Represent Wireless Interference? | Magns M. Halldrsson, Tigran Tonoyan |
| 2015 | SPAA | Distributed Backup Placement in Networks. | Magns M. Halldrsson, Sven Khler, Boaz Patt-Shamir, Dror Rawitz |
| 2015 | SOFSEM | Progress (and Lack Thereof) for Graph Coloring Approximation Problems. | Magns M. Halldrsson |
| 2014 | COCOA | The Minimum Vulnerability Problem on Graphs. | Yusuke Aoki, Bjarni V. Halldrsson, Magns M. Halldrsson, Takehiro Ito, Christian Konrad, Xiao Zhou |
| 2014 | MSWIM | Extending wireless algorithm design to arbitrary environments via metricity. | Helga Gudmundsdottir, Eyjlfur Ingi sgeirsson, Marijke H. L. Bodlaender, Joseph T. Foley, Magns M. Halldrsson, Ymir Vigfusson |
| 2014 | PODC | Beyond geometry: towards fully realistic wireless models. | Marijke H. L. Bodlaender, Magns M. Halldrsson |
| 2014 | WiOpt | Maximum MIMO Flow in wireless networks under the SINR model. | Eyjlfur Ingi sgeirsson, Magns M. Halldrsson, Pradipta Mitra |
| 2013 | Algosensors | Modeling Reality Algorithmically: The Case of Wireless Communication. | Magns M. Halldrsson |
| 2013 | PODC | Connectivity and aggregation in multihop wireless networks. | Marijke H. L. Bodlaender, Magns M. Halldrsson, Pradipta Mitra |
| 2013 | SODA | The Power of Non-Uniform Wireless Power. | Magns M. Halldrsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer |
| 2013 | SPAA | Brief announcement: locality in wireless scheduling. | Magns M. Halldrsson |
| 2012 | CISS | A fully distributed algorithm for throughput performance in wireless networks. | Eyjolfur Ingi Asgeirsson, Magns M. Halldrsson, Pradipta Mitra |
| 2012 | ICALP | Space-Constrained Interval Selection. | Yuval Emek, Magns M. Halldrsson, Adi Rosn |
| 2012 | ICALP | Streaming and Communication Complexity of Clique Approximation. | Magns M. Halldrsson, Xiaoming Sun, Mario Szegedy, Chengu Wang |
| 2012 | INFOCOM | Wireless capacity and admission control in cognitive radio. | Magns M. Halldrsson, Pradipta Mitra |
| 2012 | OPODIS | On the Impact of Identifiers on Local Decision. | Pierre Fraigniaud, Magns M. Halldrsson, Amos Korman |
| 2012 | PODC | Brief announcement: distributed algorithms for throughput performance in wireless networks. | Eyjolfur Ingi Asgeirsson, Magns M. Halldrsson, Pradipta Mitra |
| 2012 | PODC | Distributed connectivity of wireless networks. | Magns M. Halldrsson, Pradipta Mitra |
| 2012 | SODA | Wireless connectivity and capacity. | Magns M. Halldrsson, Pradipta Mitra |
| 2012 | SIROCCO | Wireless Network Stability in the SINR Model. | Eyjolfur Ingi Asgeirsson, Magns M. Halldrsson, Pradipta Mitra |
| 2011 | Algosensors | Wireless Capacity with Arbitrary Gain Matrix. | Magns M. Halldrsson, Pradipta Mitra |
| 2011 | ICALP | Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. | Magns M. Halldrsson, Pradipta Mitra |
| 2011 | SODA | Wireless Capacity with Oblivious Power in General Metrics. | Magns M. Halldrsson, Pradipta Mitra |
| 2011 | STACS | Online Scheduling with Interval Conflicts. | Magns M. Halldrsson, Boaz Patt-Shamir, Dror Rawitz |
| 2011 | WG | Alternation Graphs. | Magns M. Halldrsson, Sergey Kitaev, Artem V. Pyatkin |
| 2010 | DLT | Graphs Capturing Alternations in Words. | Magns M. Halldrsson, Sergey Kitaev, Artem V. Pyatkin |
| 2010 | FUN | Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. | Magns M. Halldrsson, Hadas Shachnai |
| 2010 | ICALP | Streaming Algorithms for Independent Sets. | Bjarni V. Halldrsson, Magns M. Halldrsson, Elena Losievskaja, Mario Szegedy |
| 2010 | PODC | Online set packing and competitive scheduling of multi-part tasks. | Yuval Emek, Magns M. Halldrsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
| 2009 | ESA | Wireless Scheduling with Power Control. | Magns M. Halldrsson |
| 2009 | ICALP | SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. | Geir Agnarsson, Magns M. Halldrsson, Elena Losievskaja |
| 2009 | ICALP | Wireless Communication Is in APX. | Magns M. Halldrsson, Roger Wattenhofer |
| 2009 | INFOCOM | Capacity of Arbitrary Wireless Networks. | Olga Goussevskaia, Roger Wattenhofer, Magns M. Halldrsson, Emo Welzl |
| 2008 | IPCO | Min Sum Edge Coloring in Multigraphs Via Configuration LP. | Magns M. Halldrsson, Guy Kortsarz, Maxim Sviridenko |
| 2008 | SODA | Robust cost colorings. | Takuro Fukunaga, Magns M. Halldrsson, Hiroshi Nagamochi |
| 2007 | WADS | Fixed-Parameter Tractability for Non-Crossing Spanning Trees. | Magns M. Halldrsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama |
| 2007 | WADS | Independent Sets in Bounded-Degree Hypergraphs. | Magns M. Halldrsson, Elena Losievskaja |
| 2006 | Algosensors | Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. | Magns M. Halldrsson, Takeshi Tokuyama |
| 2006 | WG | Strip Graphs: Recognition and Scheduling. | Magns M. Halldrsson, Ragnar K. Karlsson |
| 2005 | WG | Approximation Algorithms for the Weighted Independent Set Problem. | Akihisa Kako, Takao Ono, Tomio Hirata, Magns M. Halldrsson |
| 2004 | ICALP | Improved Results for Data Migration and Open Shop Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2004 | MFCS | Multicoloring: Problems and Techniques. | Magns M. Halldrsson, Guy Kortsarz |
| 2004 | PODC | On spectrum sharing games. | Magns M. Halldrsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni |
| 2004 | SODA | On colorings of squares of outerplanar graphs. | Geir Agnarsson, Magns M. Halldrsson |
| 2004 | WAOA | Strong Colorings of Hypergraphs. | Geir Agnarsson, Magns M. Halldrsson |
| 2004 | WAOA | Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2003 | COCOON | Randomized Approximation of the Stable Marriage Problem. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2003 | ESA | Improved Approximation of the Stable Marriage Problem. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa |
| 2002 | LATIN | Inapproximability Results on Stable Marriage Problems. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita |
| 2002 | SODA | Scheduling split intervals. | Reuven Bar-Yehuda, Magns M. Halldrsson, Joseph Naor, Hadas Shachnai, Irina Shapira |
| 2001 | ESA | On the Approximability of the Minimum Test Collection Problem. | Bjarni V. Halldrsson, Magns M. Halldrsson, R. Ravi |
| 2000 | COCOON | Online Independent Sets. | Magns M. Halldrsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi |
| 2000 | ISAAC | Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. | Takao Asano, Magns M. Halldrsson, Kazuo Iwama, Takeshi Matsuda |
| 2000 | SODA | Coloring powers of planar graphs. | Geir Agnarsson, Magns M. Halldrsson |
| 2000 | STOC | Approximating the domatic number. | Uriel Feige, Magns M. Halldrsson, Guy Kortsarz |
| 1999 | COCOON | Approximations of Weighted Independent Set and Hereditary Subset Problems. | Magns M. Halldrsson |
| 1999 | COCOON | Multi-coloring Trees. | Magns M. Halldrsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
| 1999 | ESA | Sum Multi-coloring of Graphs. | Amotz Bar-Noy, Magns M. Halldrsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
| 1999 | SODA | Greedy Local Improvement and Weighted Set Packing Approximation. | Barun Chandra, Magns M. Halldrsson |
| 1999 | SODA | Online Coloring Known Graphs. | Magns M. Halldrsson |
| 1999 | WG | Mod-2 Independence and Domination in Graphs. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | ICALP | Independent Sets with Domination Constraints. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1996 | IPCO | Approximating | Magns M. Halldrsson |
| 1996 | ISAAC | Approximation and Special Cases of Common Subtrees and Editing Distance. | Magns M. Halldrsson, Keisuke Tanaka |
| 1995 | ISAAC | Greedy Approximations of Independent Sets in Low Degree Graphs. | Magns M. Halldrsson, Kiyohito Yoshihara |
| 1995 | SODA | Approximating Discrete Collections via Local Improvements. | Magns M. Halldrsson |
| 1995 | SODA | Finding Subsets Maximizing Minimum Structures. | Magns M. Halldrsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama |
| 1994 | ISAAC | On the Approximation of Largest Common Subtrees and Largest Common Point Sets. | Tatsuya Akutsu, Magns M. Halldrsson |
| 1994 | STOC | Greed is good: approximating independent sets in sparse and bounded-degree graphs. | Magns M. Halldrsson, Jaikumar Radhakrishnan |
| 1993 | FOCS | Directed vs. Undirected Monotone Contact Networks for Threshold Functions | Magns M. Halldrsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam |
| 1992 | ISAAC | Parallel and On-line Graph Coloring Algorithms. | Magns M. Halldrsson |
| 1992 | SODA | Lower Bounds for On-Line Graph Coloring. | Magns M. Halldrsson, Mario Szegedy |