Parallel and On-line Graph Coloring Algorithms. - Magnús M. Halldórsson (ISAAC, 1992)

Approximating Maximum Independent Sets by Excluding Subgraphs. - Ravi B. Boppana; Magnús M. Halldórsson (BIT, 1992)

Directed vs. Undirected Monotone Contact Networks for Threshold Functions - Magnús M. Halldórsson; Jaikumar Radhakrishnan; K. V. Subrahmanyam 001 (FOCS, 1993)

On Some Communication Complexity Problems Related to THreshold Functions. - Magnús M. Halldórsson; Jaikumar Radhakrishnan; K. V. Subrahmanyam 001 (FSTTCS, 1993)

Approximating the Tree and Tour Covers of a Graph. - Esther M. Arkin; Magnús M. Halldórsson; Refael Hassin (Inf. Process. Lett., 1993)

A Still Better Performance Guarantee for Approximate Graph Coloring. - Magnús M. Halldórsson (Inf. Process. Lett., 1993)

Approximating the Minimum Maximal Independence Number. - Magnús M. Halldórsson (Inf. Process. Lett., 1993)

Improved Approximations of Independent Sets in Bounded-Degree Graphs. - Magnús M. Halldórsson; Jaikumar Radhakrishnan (SWAT, 1994)

Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. - Magnús M. Halldórsson; Jaikumar Radhakrishnan (Nord. J. Comput., 1994)

Lower Bounds for On-Line Graph Coloring. - Magnús M. Halldórsson; Mario Szegedy (Theor. Comput. Sci., 1994)

Greedy Approximations of Independent Sets in Low Degree Graphs. - Magnús M. Halldórsson; Kiyohito Yoshihara (ISAAC, 1995)

Approximating Discrete Collections via Local Improvements. - Magnús M. Halldórsson (SODA, 1995)

Approximating k-Set Cover and Complementary Graph Coloring. - Magnús M. Halldórsson (IPCO, 1996)

Approximation and Special Cases of Common Subtrees and Editing Distance. - Magnús M. Halldórsson; Keisuke Tanaka (ISAAC, 1996)

Facility Dispersion and Remote Subgraphs. - Barun Chandra; Magnús M. Halldórsson (SWAT, 1996)

Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. - Magnús M. Halldórsson; Jaikumar Radhakrishnan (Algorithmica, 1997)

Parallel and On-Line Graph Coloring. - Magnús M. Halldórsson (J. Algorithms, 1997)

Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. - Magnús M. Halldórsson; Hoong Chuin Lau (J. Graph Algorithms Appl., 1997)

Approximations of Independent Sets in Graphs. - Magnús M. Halldórsson (APPROX, 1998)

On Chromatic Sums and Distributed Resource Allocation. - Amotz Bar-Noy; Mihir Bellare; Magnús M. Halldórsson; Hadas Shachnai; Tami Tamir (Inf. Comput., 1998)

Approximating Steiner trees in graphs with restricted weights. - Magnús M. Halldórsson; Shuichi Ueno; Hiroshi Nakao; Yoji Kajitani (Networks, 1998)

Multi-coloring Trees. - Magnús M. Halldórsson; Guy Kortsarz; Andrzej Proskurowski; Ravit Salman; Hadas Shachnai; Jan Arne Telle (COCOON, 1999)

Sum Multi-coloring of Graphs. - Amotz Bar-Noy; Magnús M. Halldórsson; Guy Kortsarz; Ravit Salman; Hadas Shachnai (ESA, 1999)

Multicoloring Planar Graphs and Partial k-Trees. - Magnús M. Halldórsson; Guy Kortsarz (RANDOM-APPROX, 1999)

A Matched Approximation Bound for the Sum of a Greedy Coloring. - Amotz Bar-Noy; Magnús M. Halldórsson; Guy Kortsarz (Inf. Process. Lett., 1999)

Finding Subsets Maximizing Minimum Structures. - Magnús M. Halldórsson; Kazuo Iwano; Naoki Katoh; Takeshi Tokuyama (SIAM J. Discret. Math., 1999)

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. - Takao Asano; Magnús M. Halldórsson; Kazuo Iwama; Takeshi Matsuda (ISAAC, 2000)

Approximating the domatic number. - Uriel Feige; Magnús M. Halldórsson; Guy Kortsarz (STOC, 2000)

Online Coloring Known Graphs. - Magnús M. Halldórsson (Electron. J. Comb., 2000)

Independent Sets with Domination Constraints. - Magnús M. Halldórsson; Jan Kratochvíl; Jan Arne Telle (Discret. Appl. Math., 2000)

Mod-2 Independence and Domination in Graphs. - Magnús M. Halldórsson; Jan Kratochvíl; Jan Arne Telle (Int. J. Found. Comput. Sci., 2000)

Sum Multicoloring of Graphs. - Amotz Bar-Noy; Magnús M. Halldórsson; Guy Kortsarz; Ravit Salman; Hadas Shachnai (J. Algorithms, 2000)

Approximations of Weighted Independent Set and Hereditary Subset Problems. - Magnús M. Halldórsson (J. Graph Algorithms Appl., 2000)

Guest Editor's Foreword. - Magnús M. Halldórsson (Nord. J. Comput., 2000)

On the approximation of largest common subtrees and largest common point sets. - Tatsuya Akutsu; Magnús M. Halldórsson (Theor. Comput. Sci., 2000)

Logical Form Equivalence: the Case of Referring Expressions Generation. - Kees van Deemter; Magnús M. Halldórsson (EWNLG@ACL, 2001)

On the Approximability of the Minimum Test Collection Problem. - Bjarni V. Halldórsson; Magnús M. Halldórsson; R. Ravi 001 (ESA, 2001)

Minimizing Average Completion of Dedicated Tasks and Interval Graphs. - Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (RANDOM-APPROX, 2001)

Approximation Algorithms for Dispersion Problems. - Barun Chandra; Magnús M. Halldórsson (J. Algorithms, 2001)

Greedy Local Improvement and Weighted Set Packing Approximation. - Barun Chandra; Magnús M. Halldórsson (J. Algorithms, 2001)

Approximations for the general block distribution of a matrix. - Bengt Aspvall; Magnús M. Halldórsson; Fredrik Manne (Theor. Comput. Sci., 2001)

Inapproximability Results on Stable Marriage Problems. - Magnús M. Halldórsson; Kazuo Iwama; Shuichi Miyazaki; Yasufumi Morita (LATIN, 2002)

Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. - Magnús M. Halldórsson; Guy Kortsarz (J. Algorithms, 2002)

Approximating the Domatic Number. - Uriel Feige; Magnús M. Halldórsson; Guy Kortsarz; Aravind Srinivasan (SIAM J. Comput., 2002)

Online independent sets. - Magnús M. Halldórsson; Kazuo Iwama; Shuichi Miyazaki; Shiro Taketomi (Theor. Comput. Sci., 2002)

Proper Down-Coloring Simple Acyclic Digraphs. - Geir Agnarsson; Ágúst S. Egilsson; Magnús M. Halldórsson (AGTIVE, 2003)

Improved Approximation of the Stable Marriage Problem. - Magnús M. Halldórsson; Kazuo Iwama; Shuichi Miyazaki; Hiroki Yanagisawa (ESA, 2003)

Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. - Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (Algorithmica, 2003)

Powers of geometric intersection graphs and dispersion algorithms. - Geir Agnarsson; Peter Damaschke; Magnús M. Halldórsson (Discret. Appl. Math., 2003)

Multicoloring trees. - Magnús M. Halldórsson; Guy Kortsarz; Andrzej Proskurowski; Ravit Salman; Hadas Shachnai; Jan Arne Telle (Inf. Comput., 2003)

Approximation algorithms for the test cover problem. - Koen M. J. De Bontridder; Bjarni V. Halldórsson; Magnús M. Halldórsson; Cor A. J. Hurkens; Jan Karel Lenstra; R. Ravi 001; Leen Stougie (Math. Program., 2003)

Coloring Powers of Planar Graphs. - Geir Agnarsson; Magnús M. Halldórsson (SIAM J. Discret. Math., 2003)

Approximability results for stable marriage problems with ties. - Magnús M. Halldórsson; Robert W. Irving; Kazuo Iwama; David F. Manlove; Shuichi Miyazaki; Yasufumi Morita; Sandy Scott (Theor. Comput. Sci., 2003)

Multicoloring: Problems and Techniques. - Magnús M. Halldórsson; Guy Kortsarz (MFCS, 2004)

On colorings of squares of outerplanar graphs. - Geir Agnarsson; Magnús M. Halldórsson (SODA, 2004)

Strong Colorings of Hypergraphs. - Geir Agnarsson; Magnús M. Halldórsson (WAOA, 2004)

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (WAOA, 2004)

Randomized approximation of the stable marriage problem. - Magnús M. Halldórsson; Kazuo Iwama; Shuichi Miyazaki; Hiroki Yanagisawa (Theor. Comput. Sci., 2004)

Approximation Algorithms for the Weighted Independent Set Problem. - Akihisa Kako; Takao Ono; Tomio Hirata; Magnús M. Halldórsson (WG, 2005)

Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. - Artur Czumaj; Magnús M. Halldórsson; Andrzej Lingas; Johan Nilsson (Inf. Process. Lett., 2005)

Strip Graphs: Recognition and Scheduling. - Magnús M. Halldórsson; Ragnar K. Karlsson (WG, 2006)

Scheduling Split Intervals. - Reuven Bar-Yehuda; Magnús M. Halldórsson; Joseph Naor; Hadas Shachnai; Irina Shapira (SIAM J. Comput., 2006)

Improved results for data migration and open shop scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2006)

"Rent-or-Buy" Scheduling and Cost Coloring Problems. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (FSTTCS, 2007)

Fixed-Parameter Tractability for Non-Crossing Spanning Trees. - Magnús M. Halldórsson; Christian Knauer; Andreas Spillner 001; Takeshi Tokuyama (WADS, 2007)

Complete partitions of graphs. - Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Sivasubramanian (Comb., 2007)

Strongly simplicial vertices of powers of trees. - Geir Agnarsson; Magnús M. Halldórsson (Discret. Math., 2007)

Improved approximation results for the stable marriage problem. - Magnús M. Halldórsson; Kazuo Iwama; Shuichi Miyazaki; Hiroki Yanagisawa (ACM Trans. Algorithms, 2007)

Min Sum Edge Coloring in Multigraphs Via Configuration LP. - Magnús M. Halldórsson; Guy Kortsarz; Maxim Sviridenko (IPCO, 2008)

Robust cost colorings. - Takuro Fukunaga; Magnús M. Halldórsson; Hiroshi Nagamochi (SODA, 2008)

Batch Coloring Flat Graphs and Thin. - Magnús M. Halldórsson; Hadas Shachnai (SWAT, 2008)

Vertex coloring acyclic digraphs and their corresponding hypergraphs. - Geir Agnarsson; Ágúst S. Egilsson; Magnús M. Halldórsson (Discret. Appl. Math., 2008)

Improved bounds for scheduling conflicting jobs with minsum criteria. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2008)

Minimizing interference of a wireless ad-hoc network in a plane. - Magnús M. Halldórsson; Takeshi Tokuyama (Theor. Comput. Sci., 2008)

Wireless Communication Is in APX. - Magnús M. Halldórsson; Roger Wattenhofer (ICALP (1), 2009)

Capacity of Arbitrary Wireless Networks. - Olga Goussevskaia; Roger Wattenhofer; Magnús M. Halldórsson; Emo Welzl (INFOCOM, 2009)

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. - Leah Epstein; Magnús M. Halldórsson; Asaf Levin; Hadas Shachnai (Algorithmica, 2009)

Independent sets in bounded-degree hypergraphs. - Magnús M. Halldórsson; Elena Losievskaja (Discret. Appl. Math., 2009)

Approximation algorithms for the weighted independent set problem in sparse graphs. - Akihisa Kako; Takao Ono; Tomio Hirata; Magnús M. Halldórsson (Discret. Appl. Math., 2009)

Scheduling with conflicts: online and offline algorithms. - Guy Even; Magnús M. Halldórsson; Lotem Kaplan; Dana Ron (J. Sched., 2009)

Graphs Capturing Alternations in Words. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Developments in Language Theory, 2010)

Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. - Magnús M. Halldórsson; Hadas Shachnai (FUN, 2010)

Streaming Algorithms for Independent Sets. - Bjarni V. Halldórsson; Magnús M. Halldórsson; Elena Losievskaja; Mario Szegedy (ICALP (1), 2010)

Online set packing and competitive scheduling of multi-part tasks. - Yuval Emek; Magnús M. Halldórsson; Yishay Mansour; Boaz Patt-Shamir; Jaikumar Radhakrishnan; Dror Rawitz (PODC, 2010)

Online Selection of Intervals and t-Intervals. - Unnar Th. Bachmann; Magnús M. Halldórsson; Hadas Shachnai (SWAT, 2010)

On spectrum sharing games. - Magnús M. Halldórsson; Joseph Y. Halpern; Li Erran Li; Vahab S. Mirrokni (Distributed Comput., 2010)

Vertex coloring the square of outerplanar graphs of low degree. - Geir Agnarsson; Magnús M. Halldórsson (Discuss. Math. Graph Theory, 2010)

Online coloring of hypergraphs. - Magnús M. Halldórsson (Inf. Process. Lett., 2010)

Wireless Capacity with Oblivious Power in General Metrics. - Magnús M. Halldórsson; Pradipta Mitra (SODA, 2011)

Alternation Graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (WG, 2011)

Algorithms for Weighted Capacity and Admission Control in Wireless Networks - Magnús M. Halldórsson; Pradipta Mitra (CoRR, 2011)

Sum edge coloring of multigraphs via configuration LP. - Magnús M. Halldórsson; Guy Kortsarz; Maxim Sviridenko (ACM Trans. Algorithms, 2011)

A fully distributed algorithm for throughput performance in wireless networks. - Eyjolfur Ingi Asgeirsson; Magnús M. Halldórsson; Pradipta Mitra (CISS, 2012)

Towards tight bounds for local broadcasting. - Magnús M. Halldórsson; Pradipta Mitra (FOMC, 2012)

Streaming and Communication Complexity of Clique Approximation. - Magnús M. Halldórsson; Xiaoming Sun 001; Mario Szegedy; Chengu Wang (ICALP (1), 2012)

Wireless capacity and admission control in cognitive radio. - Magnús M. Halldórsson; Pradipta Mitra (INFOCOM, 2012)

On the Impact of Identifiers on Local Decision. - Pierre Fraigniaud; Magnús M. Halldórsson; Amos Korman (OPODIS, 2012)

Brief announcement: distributed algorithms for throughput performance in wireless networks. - Eyjolfur Ingi Asgeirsson; Magnús M. Halldórsson; Pradipta Mitra (PODC, 2012)

Distributed connectivity of wireless networks. - Magnús M. Halldórsson; Pradipta Mitra (PODC, 2012)

Wireless Network Stability in the SINR Model. - Eyjolfur Ingi Asgeirsson; Magnús M. Halldórsson; Pradipta Mitra (SIROCCO, 2012)

Wireless connectivity and capacity. - Magnús M. Halldórsson; Pradipta Mitra (SODA, 2012)

Online Set Packing. - Yuval Emek; Magnús M. Halldórsson; Yishay Mansour; Boaz Patt-Shamir; Jaikumar Radhakrishnan; Dror Rawitz (SIAM J. Comput., 2012)

Wireless scheduling with power control. - Magnús M. Halldórsson (ACM Trans. Algorithms, 2012)

Modeling Reality Algorithmically: The Case of Wireless Communication. - Magnús M. Halldórsson (ALGOSENSORS, 2013)

Connectivity and aggregation in multihop wireless networks. - Marijke H. L. Bodlaender; Magnús M. Halldórsson; Pradipta Mitra (PODC, 2013)

The Power of Non-Uniform Wireless Power. - Magnús M. Halldórsson; Stephan Holzer; Pradipta Mitra; Roger Wattenhofer (SODA, 2013)

Brief announcement: locality in wireless scheduling. - Magnús M. Halldórsson (SPAA, 2013)

Editorial. - Camil Demetrescu; Magnús M. Halldórsson (Algorithmica, 2013)

Online selection of intervals and t-intervals. - Unnar Th. Bachmann; Magnús M. Halldórsson; Hadas Shachnai (Inf. Comput., 2013)

Online Scheduling with Interval Conflicts. - Magnús M. Halldórsson; Boaz Patt-Shamir; Dror Rawitz (Theory Comput. Syst., 2013)

Corrigendum: Improved results for data migration and open shop scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai (ACM Trans. Algorithms, 2013)

SDP-based algorithms for maximum independent set problems on hypergraphs. - Geir Agnarsson; Magnús M. Halldórsson; Elena Losievskaja (Theor. Comput. Sci., 2013)

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. - Tatsuya Akutsu; Daiji Fukagawa; Magnús M. Halldórsson; Atsuhiro Takasu; Keisuke Tanaka (Theor. Comput. Sci., 2013)

The Minimum Vulnerability Problem on Graphs. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (COCOA, 2014)

Extending wireless algorithm design to arbitrary environments via metricity. - Helga Gudmundsdottir; Eyjólfur Ingi Ásgeirsson; Marijke H. L. Bodlaender; Joseph T. Foley; Magnús M. Halldórsson; Ymir Vigfusson (MSWiM, 2014)

Beyond geometry: towards fully realistic wireless models. - Marijke H. L. Bodlaender; Magnús M. Halldórsson (PODC, 2014)

Distributed Algorithms for Coloring Interval Graphs. - Magnús M. Halldórsson; Christian Konrad 001 (DISC, 2014)

Maximum MIMO Flow in wireless networks under the SINR model. - Eyjólfur Ingi Ásgeirsson; Magnús M. Halldórsson; Pradipta Mitra (WiOpt, 2014)

Measurement Based Interference Models for Wireless Scheduling Algorithms. - Helga Gudmundsdottir; Eyjólfur Ingi Ásgeirsson; Marijke H. L. Bodlaender; Joseph T. Foley; Magnús M. Halldórsson; Geir M. Järvelä; Henning Úlfarsson; Ymir Vigfusson (CoRR, 2014)

Report on Two events at ICE-TCS, Reykjavik University. - Luca Aceto; Magnús M. Halldórsson; Anna Ingólfsdóttir (Bull. EATCS, 2014)

Making wireless algorithm theory more useful: five ideas from the 2013 workshop on realistic models for algorithms in wireless networks. - Magnús M. Halldórsson; Calvin Newport (SIGACT News, 2014)

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. - Amotz Bar-Noy; Thomas Erlebach; Magnús M. Halldórsson; Sotiris E. Nikoletseas; Pekka Orponen (Theor. Comput. Sci., 2014)

Wireless capacity with arbitrary gain matrix. - Magnús M. Halldórsson; Pradipta Mitra (Theor. Comput. Sci., 2014)

Algorithms for Wireless Capacity. - Olga Goussevskaia; Magnús M. Halldórsson; Roger Wattenhofer (IEEE/ACM Trans. Netw., 2014)

Limitations of Current Wireless Scheduling Algorithms. - Magnús M. Halldórsson; Christian Konrad 001; Tigran Tonoyan (ALGOSENSORS, 2015)

The Price of Local Power Control in Wireless Scheduling. - Magnús M. Halldórsson; Tigran Tonoyan (FSTTCS, 2015)

A Local Broadcast Layer for the SINR Network Model. - Magnús M. Halldórsson; Stephan Holzer; Nancy A. Lynch (PODC, 2015)

Progress (and Lack Thereof) for Graph Coloring Approximation Problems. - Magnús M. Halldórsson (SOFSEM, 2015)

How Well Can Graphs Represent Wireless Interference? - Magnús M. Halldórsson; Tigran Tonoyan (STOC, 2015)

Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. - Magnús M. Halldórsson; Christian Konrad 001 (DISC, 2015)

Vertex coloring edge-weighted digraphs. - Jørgen Bang-Jensen; Magnús M. Halldórsson (Inf. Process. Lett., 2015)

Guest editorial: Structural Information and Communication Complexity. - Magnús M. Halldórsson (Theor. Comput. Sci., 2015)

Brief Announcement: Local Independent Set Approximation. - Marijke H. L. Bodlaender; Magnús M. Halldórsson; Christian Konrad 001; Fabian Kuhn (PODC, 2016)

Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. - Magnús M. Halldórsson; Tigran Tonoyan; Yuexuan Wang; Dongxiao Yu (PODC, 2016)

Invited paper: Models for wireless algorithms. - Magnús M. Halldórsson (WiOpt, 2016)

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. - Pierre Fraigniaud; Magnús M. Halldórsson; Boaz Patt-Shamir; Dror Rawitz; Adi Rosén (Algorithmica, 2016)

Streaming Algorithms for Independent Sets in Sparse Hypergraphs. - Bjarni V. Halldórsson; Magnús M. Halldórsson; Elena Losievskaja; Mario Szegedy (Algorithmica, 2016)

Data Dissemination in Unified Dynamic Wireless Networks. - Magnús M. Halldórsson; Tigran Tonoyan; Yuexuan Wang; Dongxiao Yu (CoRR, 2016)

On the complexity of the shortest-path broadcast problem. - Pierluigi Crescenzi; Pierre Fraigniaud; Magnús M. Halldórsson; Hovhannes A. Harutyunyan; Chiara Pierucci; Andrea Pietracaprina; Geppino Pucci (Discret. Appl. Math., 2016)

Semi-transitive orientations and word-representable graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2016)

Nearly optimal bounds for distributed wireless scheduling in the SINR model. - Magnús M. Halldórsson; Pradipta Mitra (Distributed Comput., 2016)

The minimum vulnerability problem on specific graph classes. - Yusuke Aoki; Bjarni V. Halldórsson; Magnús M. Halldórsson; Takehiro Ito; Christian Konrad 001; Xiao Zhou 001 (J. Comb. Optim., 2016)

Space-Constrained Interval Selection. - Yuval Emek; Magnús M. Halldórsson; Adi Rosén (ACM Trans. Algorithms, 2016)

Universal Framework for Wireless Scheduling Problems. - Eyjólfur Ingi Ásgeirsson; Magnús M. Halldórsson; Tigran Tonoyan (ICALP, 2017)

Dynamic Adaptation in Wireless Networks Under Comprehensive Interference via Carrier Sense. - Dongxiao Yu; Yuexuan Wang; Tigran Tonoyan; Magnús M. Halldórsson (IPDPS, 2017)

Wireless Link Capacity under Shadowing and Fading. - Magnús M. Halldórsson; Tigran Tonoyan (MobiHoc, 2017)

Aggregation Rate for Compressible Functions. - Magnús M. Halldórsson; Tigran Tonoyan (MobiHoc, 2017)

Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. - Magnús M. Halldórsson; Stephan Holzer; Evangelia Anna Markatou (PODC, 2017)

Leader Election in SINR Model with Arbitrary Power Control. - Magnús M. Halldórsson; Stephan Holzer; Evangelia Anna Markatou (SIROCCO, 2017)

An Efficient Communication Abstraction for Dense Wireless Networks. - Magnús M. Halldórsson; Fabian Kuhn; Nancy A. Lynch; Calvin Newport (DISC, 2017)

Universal Framework for Wireless Scheduling Problems. - Magnús M. Halldórsson; Tigran Tonoyan (CoRR, 2017)

Foundations of Wireless Networking (Dagstuhl Seminar 17271). - Christina Fragouli; Magnús M. Halldórsson; Kyle Jamieson; Bhaskar Krishnamachari (Dagstuhl Reports, 2017)

Max point-tolerance graphs. - Daniele Catanzaro; Steven Chaplick; Stefan Felsner; Bjarni V. Halldórsson; Magnús M. Halldórsson; Thomas Hixon; Juraj Stacho (Discret. Appl. Math., 2017)

The Power of Oblivious Wireless Power. - Magnús M. Halldórsson; Stephan Holzer; Pradipta Mitra; Roger Wattenhofer (SIAM J. Comput., 2017)

Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. - Magnús M. Halldórsson; Guy Kortsarz (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Spanning Trees With Edge Conflicts and Wireless Connectivity. - Magnús M. Halldórsson; Guy Kortsarz; Pradipta Mitra; Tigran Tonoyan (ICALP, 2018)

Wireless Aggregation at Nearly Constant Rate. - Magnús M. Halldórsson; Tigran Tonoyan (ICDCS, 2018)

Brief Announcement: Simple and Local Independent Set Approximation. - Ravi B. Boppana; Magnús M. Halldórsson; Dror Rawitz (PODC, 2018)

Session details: Session 3C: Coloring. - Magnús M. Halldórsson (PODC, 2018)

Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. - Magnús M. Halldórsson; Tigran Tonoyan (PODC, 2018)

Distributed Algorithms for Minimum Degree Spanning Trees. - Michael Dinitz; Magnús M. Halldórsson; Calvin Newport (CoRR, 2018)

Scheduling (Dagstuhl Seminar 18101). - Magnús M. Halldórsson; Nicole Megow; Clifford Stein 001 (Dagstuhl Reports, 2018)

Computing large independent sets in a single round. - Magnús M. Halldórsson; Christian Konrad 001 (Distributed Comput., 2018)

Distributed backup placement in networks. - Magnús M. Halldórsson; Sven Köhler 001; Boaz Patt-Shamir; Dror Rawitz (Distributed Comput., 2018)

Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan. - Magnús M. Halldórsson; Naoki Kobayashi 001; Bettina Speckmann (Inf. Comput., 2018)

Distributed Minimum Degree Spanning Trees. - Michael Dinitz; Magnús M. Halldórsson; Taisuke Izumi; Calvin Newport (PODC, 2019)

Plain SINR is Enough! - Magnús M. Halldórsson; Tigran Tonoyan (PODC, 2019)

The Capacity of Smartphone Peer-To-Peer Networks. - Michael Dinitz; Magnús M. Halldórsson; Calvin Newport; Alex Weaver (DISC, 2019)

Link Scheduling under Correlated Shadowing. - Magnús M. Halldórsson; Tigran Tonoyan (WiOpt, 2019)

Distributed approximation of k-service assignment. - Magnús M. Halldórsson; Sven Köhler 001; Dror Rawitz (Distributed Comput., 2019)

Leveraging multiple channels in ad hoc networks. - Magnús M. Halldórsson; Yuexuan Wang; Dongxiao Yu (Distributed Comput., 2019)

Wireless Network Algorithmics. - Magnús M. Halldórsson; Roger Wattenhofer (Computing and Software Science, 2019)

Distance-2 Coloring in the CONGEST Model. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus (PODC, 2020)

Distributed Testing of Distance-k Colorings. - Pierre Fraigniaud; Magnús M. Halldórsson; Alexandre Nolin (SIROCCO, 2020)

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. - Magnús M. Halldórsson; Guy Kortsarz; Marek Cygan (WAOA, 2020)

Coloring Fast Without Learning Your Neighbors' Colors. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus; Alexandre Nolin (DISC, 2020)

Simple and local independent set approximation. - Ravi B. Boppana; Magnús M. Halldórsson; Dror Rawitz (Theor. Comput. Sci., 2020)

Radio aggregation scheduling. - Rajiv Gandhi; Magnús M. Halldórsson; Christian Konrad 001; Guy Kortsarz; Hoon Oh (Theor. Comput. Sci., 2020)

Leader election in SINR model with arbitrary power control. - Magnús M. Halldórsson; Stephan Holzer; Evangelia Anna Markatou; Nancy A. Lynch (Theor. Comput. Sci., 2020)

Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. - Magnús M. Halldórsson; Christian Konrad 001 (Theor. Comput. Sci., 2020)

Limitations of current wireless link scheduling algorithms. - Magnús M. Halldórsson; Christian Konrad 001; Tigran Tonoyan (Theor. Comput. Sci., 2020)

Efficient randomized distributed coloring in CONGEST. - Magnús M. Halldórsson; Fabian Kuhn; Yannic Maus; Tigran Tonoyan (STOC, 2021)

Generalized Disk Graphs. - Ívar Marrow Arnþórsson; Steven Chaplick; Jökull Snær Gylfason; Magnús M. Halldórsson; Jökull Máni Reynisson; Tigran Tonoyan (WADS, 2021)

Network Design under General Wireless Interference. - Magnús M. Halldórsson; Guy Kortsarz; Pradipta Mitra; Tigran Tonoyan (Algorithmica, 2021)

Ultrafast Distributed Coloring of High Degree Graphs. - Magnús M. Halldórsson; Alexandre Nolin; Tigran Tonoyan (CoRR, 2021)

Computing inductive vertex orderings. - Magnús M. Halldórsson; Tigran Tonoyan (Inf. Process. Lett., 2021)

Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. - Koen M. J. De Bontridder; Bjarni V. Halldórsson; Magnús M. Halldórsson; Cor A. J. Hurkens; Jan Karel Lenstra; R. Ravi 001; Leen Stougie (Oper. Res. Lett., 2021)

Effective Wireless Scheduling via Hypergraph Sketches. - Magnús M. Halldórsson; Tigran Tonoyan (SIAM J. Comput., 2021)

Sparse Backbone and Optimal Distributed SINR Algorithms. - Magnús M. Halldórsson; Tigran Tonoyan (ACM Trans. Algorithms, 2021)

Query minimization under stochastic uncertainty. - Steven Chaplick; Magnús M. Halldórsson; Murilo S. de Lima; Tigran Tonoyan (Theor. Comput. Sci., 2021)

Query-competitive sorting with uncertainty. - Magnús M. Halldórsson; Murilo Santos de Lima (Theor. Comput. Sci., 2021)

Overcoming Congestion in Distributed Coloring. - Magnús M. Halldórsson; Alexandre Nolin; Tigran Tonoyan (PODC, 2022)

Near-optimal distributed degree+1 coloring. - Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin; Tigran Tonoyan (STOC, 2022)

Fast Distributed Vertex Splitting with Applications. - Magnús M. Halldórsson; Yannic Maus; Alexandre Nolin (DISC, 2022)

Posimodular Function Optimization. - Magnús M. Halldórsson; Toshimasa Ishii; Kazuhisa Makino; Kenjiro Takazawa (Algorithmica, 2022)

Distributed Coloring of Hypergraphs. - Duncan Adamson; Magnús M. Halldórsson; Alexandre Nolin (SIROCCO, 2023)

Fast Distributed Brooks' Theorem. - Manuela Fischer; Magnús M. Halldórsson; Yannic Maus (SODA, 2023)

Coloring Fast with Broadcasts. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SPAA, 2023)

Fast Coloring Despite Congested Relays. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2023)

SIROCCO Prize for Innovation in Distributed Computing - Laudatio for Boaz Patt-Shamir. - Magnús M. Halldórsson (Bull. EATCS, 2023)

Superfast coloring in CONGEST via efficient color sampling. - Magnús M. Halldórsson; Alexandre Nolin (Theor. Comput. Sci., 2023)

A Distributed Palette Sparsification Theorem. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SODA, 2024)

Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2024)

Distributed Delta-Coloring Under Bandwidth Limitations. - Magnús M. Halldórsson; Yannic Maus (DISC, 2024)

Distributed Lovász Local Lemma under Bandwidth Limitations. - Magnús M. Halldórsson; Yannic Maus; Saku Peltonen (CoRR, 2024)

Online Multiset Submodular Cover. - Magnús M. Halldórsson; Dror Rawitz (Algorithmica, 2024)

Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. - Maxime Flin; Magnús M. Halldórsson (ICALP, 2025)

Decentralized Distributed Graph Coloring: Cluster Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (PODC, 2025)

Approximating Independent Sets in Constant Distributed Rounds. - Ravi B. Boppana; Magnús M. Halldórsson (SIROCCO, 2025)

When MIS and Maximal Matching are Easy in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Maxime Flin; Magnús M. Halldórsson (SIROCCO, 2025)

Distributed fractional local ratio and independent set approximation. - Magnús M. Halldórsson; Dror Rawitz (Inf. Comput., 2025)

Streaming Diameter of High-Dimensional Points. - Magnús M. Halldórsson; Nicolaos Matsakis; Pavel Veselý 001 (CoRR, 2025)