Magnús M. Halldórsson

311 papers A* 48A 20B 45C 8Misc 6Journal 152Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors. CoRR Maxime Flin, Magnús M. Halldórsson, Manuel Jakob, Yannic Maus
2026	A	`conf`	Unit Interval Selection in Random Order Streams. STACS Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad, Kheeran K. Naidu
2026	J	`jnl`	Unit Interval Selection in Random Order Streams. CoRR Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad, Kheeran K. Naidu
2025	B	`conf`	Approximating Independent Sets in Constant Distributed Rounds. SIROCCO Ravi B. Boppana, Magnús M. Halldórsson
2025	A*	`conf`	Decentralized Distributed Graph Coloring: Cluster Graphs. PODC Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2025	J	`jnl`	Distributed fractional local ratio and independent set approximation. Inf. Comput. Magnús M. Halldórsson, Dror Rawitz
2025	A*	`conf`	Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. ICALP Maxime Flin, Magnús M. Halldórsson
2025	J	`jnl`	Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. CoRR Maxime Flin, Magnús M. Halldórsson
2025	A	`conf`	Streaming Diameter of High-Dimensional Points. ESA Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
2025	J	`jnl`	Streaming Diameter of High-Dimensional Points. CoRR Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
2025	B	`conf`	When MIS and Maximal Matching are Easy in the Congested Clique. SIROCCO Keren Censor-Hillel, Tomer Even, Maxime Flin, Magnús M. Halldórsson
2025	J	`jnl`	When MIS and Maximal Matching are Easy in the Congested Clique. CoRR Keren Censor-Hillel, Tomer Even, Maxime Flin, Magnús M. Halldórsson
2024	A*	`conf`	A Distributed Palette Sparsification Theorem. SODA Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
2024	A	`conf`	Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. DISC Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2024	J	`jnl`	Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs. CoRR Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2024	J	`jnl`	Decentralized Distributed Graph Coloring: Cluster Graphs. CoRR Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2024	A	`conf`	Distributed Delta-Coloring Under Bandwidth Limitations. DISC Magnús M. Halldórsson, Yannic Maus
2024	J	`jnl`	Distributed Delta-Coloring under Bandwidth Limitations. CoRR Yannic Maus, Magnús M. Halldórsson
2024	B	`conf`	Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO Magnús M. Halldórsson, Dror Rawitz
2024	J	`jnl`	Distributed Lovász Local Lemma under Bandwidth Limitations. CoRR Magnús M. Halldórsson, Yannic Maus, Saku Peltonen
2024	J	`jnl`	Online Multiset Submodular Cover. Algorithmica Magnús M. Halldórsson, Dror Rawitz
2023	J	`jnl`	A Distributed Palette Sparsification Theorem. CoRR Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
2023	B	`conf`	Coloring Fast with Broadcasts. SPAA Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
2023	J	`jnl`	Coloring Fast with Broadcasts. CoRR Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin
2023	B	`conf`	Distributed Coloring of Hypergraphs. SIROCCO Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin
2023	A	`conf`	Fast Coloring Despite Congested Relays. DISC Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2023	J	`jnl`	Fast Coloring Despite Congested Relays. CoRR Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
2023	A*	`conf`	Fast Distributed Brooks' Theorem. SODA Manuela Fischer, Magnús M. Halldórsson, Yannic Maus
2023	A*	`ed.`	Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023 PODC Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu
2023	J	`jnl`	SIROCCO Prize for Innovation in Distributed Computing - Laudatio for Boaz Patt-Shamir. Bull. EATCS Magnús M. Halldórsson
2023	J	`jnl`	Superfast coloring in CONGEST via efficient color sampling. Theor. Comput. Sci. Magnús M. Halldórsson, Alexandre Nolin
2022	J	`jnl`	Fast Distributed Brooks' Theorem. CoRR Manuela Fischer, Yannic Maus, Magnús M. Halldórsson
2022	A	`conf`	Fast Distributed Vertex Splitting with Applications. DISC Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin
2022	J	`jnl`	Fast Distributed Vertex Splitting with Applications. CoRR Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin
2022	A*	`conf`	Near-optimal distributed degree+1 coloring. STOC Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan
2022	A*	`conf`	Overcoming Congestion in Distributed Coloring. PODC Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
2022	J	`jnl`	Overcoming Congestion in Distributed Coloring. CoRR Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
2022	J	`jnl`	Posimodular Function Optimization. Algorithmica Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
2021	J	`jnl`	Computing inductive vertex orderings. Inf. Process. Lett. Magnús M. Halldórsson, Tigran Tonoyan
2021	J	`jnl`	Effective Wireless Scheduling via Hypergraph Sketches. SIAM J. Comput. Magnús M. Halldórsson, Tigran Tonoyan
2021	A*	`conf`	Efficient randomized distributed coloring in CONGEST. STOC Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan
2021	B	`conf`	Generalized Disk Graphs. WADS Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan
2021	J	`jnl`	Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 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
2021	J	`jnl`	Near-Optimal Distributed Degree+1 Coloring. CoRR Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan
2021	J	`jnl`	Network Design under General Wireless Interference. Algorithmica Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2021	J	`jnl`	Query minimization under stochastic uncertainty. Theor. Comput. Sci. Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan
2021	J	`jnl`	Query-competitive sorting with uncertainty. Theor. Comput. Sci. Magnús M. Halldórsson, Murilo Santos de Lima
2021	J	`jnl`	Sparse Backbone and Optimal Distributed SINR Algorithms. ACM Trans. Algorithms Magnús M. Halldórsson, Tigran Tonoyan
2021	B	`conf`	Superfast Coloring in CONGEST via Efficient Color Sampling. SIROCCO Magnús M. Halldórsson, Alexandre Nolin
2021	J	`jnl`	Superfast Coloring in CONGEST via Efficient Color Sampling. CoRR Magnús M. Halldórsson, Alexandre Nolin
2021	J	`jnl`	Ultrafast Distributed Coloring of High Degree Graphs. CoRR Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
2020	A	`conf`	Coloring Fast Without Learning Your Neighbors' Colors. DISC Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin
2020	J	`jnl`	Coloring Fast Without Learning Your Neighbors' Colors. CoRR Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin
2020	A*	`conf`	Distance-2 Coloring in the CONGEST Model. PODC Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus
2020	J	`jnl`	Distance-2 Coloring in the CONGEST Model. CoRR Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus
2020	B	`conf`	Distributed Testing of Distance-k Colorings. SIROCCO Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin
2020	J	`jnl`	Efficient Randomized Distributed Coloring in CONGEST. CoRR Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan
2020	J	`jnl`	Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. Theor. Comput. Sci. Magnús M. Halldórsson, Christian Konrad
2020	J	`jnl`	Leader election in SINR model with arbitrary power control. Theor. Comput. Sci. Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou, Nancy A. Lynch
2020	J	`jnl`	Limitations of current wireless link scheduling algorithms. Theor. Comput. Sci. Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan
2020	B	`conf`	Query Minimization Under Stochastic Uncertainty. LATIN Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan
2020	J	`jnl`	Query Minimization under Stochastic Uncertainty. CoRR Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan
2020	J	`jnl`	Query-Competitive Sorting with Uncertainty. CoRR Magnús M. Halldórsson, Murilo Santos de Lima
2020	J	`jnl`	Radio aggregation scheduling. Theor. Comput. Sci. Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
2020	J	`jnl`	Simple and local independent set approximation. Theor. Comput. Sci. Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
2020	B	`conf`	Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan
2020	J	`jnl`	Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. CoRR Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz
2019	A*	`conf`	Distributed Minimum Degree Spanning Trees. PODC Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport
2019	J	`jnl`	Distributed approximation of k-service assignment. Distributed Comput. Magnús M. Halldórsson, Sven Köhler, Dror Rawitz
2019	J	`jnl`	Leveraging multiple channels in ad hoc networks. Distributed Comput. Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu
2019	B	`conf`	Link Scheduling under Correlated Shadowing. WiOpt Magnús M. Halldórsson, Tigran Tonoyan
2019	A*	`conf`	Plain SINR is Enough! PODC Magnús M. Halldórsson, Tigran Tonoyan
2019	B	`conf`	Query-Competitive Sorting with Uncertainty. MFCS Magnús M. Halldórsson, Murilo Santos de Lima
2019	A	`conf`	The Capacity of Smartphone Peer-To-Peer Networks. DISC Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
2019	J	`jnl`	The Capacity of Smartphone Peer-to-Peer Networks. CoRR Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver
2019	—	`ch.`	Wireless Network Algorithmics. Computing and Software Science Magnús M. Halldórsson, Roger Wattenhofer
2018	—	`ch.`	Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. Handbook of Approximation Algorithms and Metaheuristics (1) Magnús M. Halldórsson, Guy Kortsarz
2018	A*	`conf`	Brief Announcement: Simple and Local Independent Set Approximation. PODC Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
2018	J	`jnl`	Computing large independent sets in a single round. Distributed Comput. Magnús M. Halldórsson, Christian Konrad
2018	J	`jnl`	Distributed Algorithms for Minimum Degree Spanning Trees. CoRR Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
2018	J	`jnl`	Distributed backup placement in networks. Distributed Comput. Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz
2018	J	`jnl`	Effective Wireless Scheduling via Hypergraph Sketches. CoRR Magnús M. Halldórsson, Tigran Tonoyan
2018	A*	`conf`	Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. PODC Magnús M. Halldórsson, Tigran Tonoyan
2018	J	`jnl`	Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports Magnús M. Halldórsson, Nicole Megow, Clifford Stein
2018	A*	`conf`	Session details: Session 3C: Coloring. PODC Magnús M. Halldórsson
2018	B	`conf`	Simple and Local Independent Set Approximation. SIROCCO Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
2018	J	`jnl`	Simple and Local Independent Set Approximation. CoRR Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz
2018	A*	`conf`	Spanning Trees With Edge Conflicts and Wireless Connectivity. ICALP Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2018	J	`jnl`	Spanning Trees With Edge Conflicts and Wireless Connectivity. CoRR Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2018	J	`jnl`	Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan. Inf. Comput. Magnús M. Halldórsson, Naoki Kobayashi, Bettina Speckmann
2018	A	`conf`	Wireless Aggregation at Nearly Constant Rate. ICDCS Magnús M. Halldórsson, Tigran Tonoyan
2017	B	`conf`	Aggregation Rate for Compressible Functions. MobiHoc Magnús M. Halldórsson, Tigran Tonoyan
2017	A	`conf`	An Efficient Communication Abstraction for Dense Wireless Networks. DISC Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport
2017	A*	`conf`	Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. PODC Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou
2017	A	`conf`	Dynamic Adaptation in Wireless Networks Under Comprehensive Interference via Carrier Sense. IPDPS Dongxiao Yu, Yuexuan Wang, Tigran Tonoyan, Magnús M. Halldórsson
2017	J	`jnl`	Foundations of Wireless Networking (Dagstuhl Seminar 17271). Dagstuhl Reports Christina Fragouli, Magnús M. Halldórsson, Kyle Jamieson, Bhaskar Krishnamachari
2017	B	`conf`	Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. SIROCCO Magnús M. Halldórsson, Christian Konrad
2017	B	`conf`	Leader Election in SINR Model with Arbitrary Power Control. SIROCCO Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou
2017	J	`jnl`	Max point-tolerance graphs. Discret. Appl. Math. Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
2017	B	`conf`	Posimodular Function Optimization. WADS Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
2017	J	`jnl`	The Power of Oblivious Wireless Power. SIAM J. Comput. Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer
2017	A*	`conf`	Universal Framework for Wireless Scheduling Problems. ICALP Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan
2017	J	`jnl`	Universal Framework for Wireless Scheduling Problems. CoRR Magnús M. Halldórsson, Tigran Tonoyan
2017	J	`jnl`	Wireless Aggregation at Nearly Constant Rate. CoRR Magnús M. Halldórsson, Tigran Tonoyan
2017	B	`conf`	Wireless Link Capacity under Shadowing and Fading. MobiHoc Magnús M. Halldórsson, Tigran Tonoyan
2017	J	`jnl`	Wireless Link Capacity under Shadowing and Fading. CoRR Magnús M. Halldórsson, Tigran Tonoyan
2016	A*	`conf`	Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. PODC Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu
2016	A*	`conf`	Brief Announcement: Local Independent Set Approximation. PODC Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn
2016	J	`jnl`	Data Dissemination in Unified Dynamic Wireless Networks. CoRR Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu
2016	B	`conf`	Invited paper: Models for wireless algorithms. WiOpt Magnús M. Halldórsson
2016	J	`jnl`	Leveraging Multiple Channels in Ad Hoc Networks. CoRR Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu
2016	J	`jnl`	Nearly optimal bounds for distributed wireless scheduling in the SINR model. Distributed Comput. Magnús M. Halldórsson, Pradipta Mitra
2016	J	`jnl`	On the complexity of the shortest-path broadcast problem. Discret. Appl. Math. Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci
2016	J	`jnl`	Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
2016	J	`jnl`	Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
2016	J	`jnl`	Space-Constrained Interval Selection. ACM Trans. Algorithms Yuval Emek, Magnús M. Halldórsson, Adi Rosén
2016	J	`jnl`	Streaming Algorithms for Independent Sets in Sparse Hypergraphs. Algorithmica Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy
2016	J	`jnl`	The minimum vulnerability problem on specific graph classes. J. Comb. Optim. Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2015	A*	`conf`	A Local Broadcast Layer for the SINR Network Model. PODC Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch
2015	J	`jnl`	A Local Broadcast Layer for the SINR Network Model. CoRR Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch
2015	—	`ed.`	Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I ICALP (1) Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
2015	—	`ed.`	Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II ICALP (2) Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
2015	B	`conf`	Distributed Approximation of k-Service Assignment. OPODIS Magnús M. Halldórsson, Sven Köhler, Dror Rawitz
2015	B	`conf`	Distributed Backup Placement in Networks. SPAA Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz
2015	A	`conf`	Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. DISC Magnús M. Halldórsson, Christian Konrad
2015	J	`jnl`	Guest editorial: Structural Information and Communication Complexity. Theor. Comput. Sci. Magnús M. Halldórsson
2015	A*	`conf`	How Well Can Graphs Represent Wireless Interference? STOC Magnús M. Halldórsson, Tigran Tonoyan
2015	A*	`conf`	Leveraging Multiple Channels in Ad Hoc Networks. PODC Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu
2015	C	`conf`	Limitations of Current Wireless Scheduling Algorithms. ALGOSENSORS Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan
2015	J	`jnl`	Max Point-Tolerance Graphs. CoRR Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho
2015	J	`jnl`	On the Impact of Identifiers on Local Decision. CoRR Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2015	B	`conf`	Progress (and Lack Thereof) for Graph Coloring Approximation Problems. SOFSEM Magnús M. Halldórsson
2015	C	`conf`	Radio Aggregation Scheduling. ALGOSENSORS Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
2015	—	`conf`	The Price of Local Power Control in Wireless Scheduling. FSTTCS Magnús M. Halldórsson, Tigran Tonoyan
2015	J	`jnl`	The Price of Local Power Control in Wireless Scheduling. CoRR Magnús M. Halldórsson, Tigran Tonoyan
2015	J	`jnl`	Vertex coloring edge-weighted digraphs. Inf. Process. Lett. Jørgen Bang-Jensen, Magnús M. Halldórsson
2014	A*	`ed.`	ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014 PODC Magnús M. Halldórsson, Shlomi Dolev
2014	J	`jnl`	Algorithms for Wireless Capacity. IEEE/ACM Trans. Netw. Olga Goussevskaia, Magnús M. Halldórsson, Roger Wattenhofer
2014	J	`jnl`	Beyond Geometry : Towards Fully Realistic Wireless Models. CoRR Marijke H. L. Bodlaender, Magnús M. Halldórsson
2014	A*	`conf`	Beyond geometry: towards fully realistic wireless models. PODC Marijke H. L. Bodlaender, Magnús M. Halldórsson
2014	A	`conf`	Distributed Algorithms for Coloring Interval Graphs. DISC Magnús M. Halldórsson, Christian Konrad
2014	J	`jnl`	Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen
2014	A	`conf`	Extending wireless algorithm design to arbitrary environments via metricity. MSWiM Helga Gudmundsdottir, Eyjólfur Ingi Ásgeirsson, Marijke H. L. Bodlaender, Joseph T. Foley, Magnús M. Halldórsson, Ymir Vigfusson
2014	J	`jnl`	How Well Can Graphs Represent Wireless Interference? CoRR Magnús M. Halldórsson, Tigran Tonoyan
2014	J	`jnl`	Making wireless algorithm theory more useful: five ideas from the 2013 workshop on realistic models for algorithms in wireless networks. SIGACT News Magnús M. Halldórsson, Calvin Newport
2014	B	`conf`	Maximum MIMO Flow in wireless networks under the SINR model. WiOpt Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2014	J	`jnl`	Measurement Based Interference Models for Wireless Scheduling Algorithms. CoRR 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
2014	J	`jnl`	Report on Two events at ICE-TCS, Reykjavik University. Bull. EATCS Luca Aceto, Magnús M. Halldórsson, Anna Ingólfsdóttir
2014	B	`ed.`	Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings SIROCCO Magnús M. Halldórsson
2014	C	`conf`	The Minimum Vulnerability Problem on Graphs. COCOA Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2014	J	`jnl`	Wireless capacity with arbitrary gain matrix. Theor. Comput. Sci. Magnús M. Halldórsson, Pradipta Mitra
2013	C	`ed.`	Algorithms for Sensor Systems, 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13-14, 2012. Revised Selected Papers ALGOSENSORS Amotz Bar-Noy, Magnús M. Halldórsson
2013	J	`jnl`	Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theor. Comput. Sci. Tatsuya Akutsu, Daiji Fukagawa, Magnús M. Halldórsson, Atsuhiro Takasu, Keisuke Tanaka
2013	B	`conf`	Brief announcement: locality in wireless scheduling. SPAA Magnús M. Halldórsson
2013	A*	`conf`	Connectivity and aggregation in multihop wireless networks. PODC Marijke H. L. Bodlaender, Magnús M. Halldórsson, Pradipta Mitra
2013	J	`jnl`	Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2013	J	`jnl`	Editorial. Algorithmica Camil Demetrescu, Magnús M. Halldórsson
2013	C	`conf`	Modeling Reality Algorithmically: The Case of Wireless Communication. ALGOSENSORS Magnús M. Halldórsson
2013	J	`jnl`	Online Scheduling with Interval Conflicts. Theory Comput. Syst. Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz
2013	J	`jnl`	Online selection of intervals and t-intervals. Inf. Comput. Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
2013	J	`jnl`	SDP-based algorithms for maximum independent set problems on hypergraphs. Theor. Comput. Sci. Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja
2013	—	`conf`	Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. APPROX-RANDOM Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén
2013	A*	`conf`	The Power of Non-Uniform Wireless Power. SODA Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer
2012	J	`jnl`	A Fully Distributed Algorithm for Throughput Performance in Wireless Networks CoRR Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012	Misc	`conf`	A fully distributed algorithm for throughput performance in wireless networks. CISS Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012	J	`jnl`	Algorithms for Wireless Capacity CoRR Olga Goussevskaia, Magnús M. Halldórsson, Roger Wattenhofer
2012	A*	`conf`	Brief announcement: distributed algorithms for throughput performance in wireless networks. PODC Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012	J	`jnl`	Distributed Connectivity of Wireless Networks CoRR Magnús M. Halldórsson, Pradipta Mitra
2012	A*	`conf`	Distributed connectivity of wireless networks. PODC Magnús M. Halldórsson, Pradipta Mitra
2012	B	`conf`	On the Impact of Identifiers on Local Decision. OPODIS Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman
2012	J	`jnl`	Online Set Packing. SIAM J. Comput. Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz
2012	J	`jnl`	Space-Constrained Interval Selection CoRR Yuval Emek, Magnús M. Halldórsson, Adi Rosén
2012	—	`conf`	Space-Constrained Interval Selection. ICALP (1) Yuval Emek, Magnús M. Halldórsson, Adi Rosén
2012	—	`conf`	Streaming and Communication Complexity of Clique Approximation. ICALP (1) Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy, Chengu Wang
2012	B	`ed.`	Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers SIROCCO Guy Even, Magnús M. Halldórsson
2012	J	`jnl`	The Power of Non-Uniform Wireless Power CoRR Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer
2012	J	`jnl`	Towards Tight Bounds for Local Broadcasting CoRR Magnús M. Halldórsson, Pradipta Mitra
2012	—	`conf`	Towards tight bounds for local broadcasting. FOMC Magnús M. Halldórsson, Pradipta Mitra
2012	J	`jnl`	Wireless Network Stability in the SINR Model CoRR Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012	B	`conf`	Wireless Network Stability in the SINR Model. SIROCCO Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra
2012	A*	`conf`	Wireless capacity and admission control in cognitive radio. INFOCOM Magnús M. Halldórsson, Pradipta Mitra
2012	A*	`conf`	Wireless connectivity and capacity. SODA Magnús M. Halldórsson, Pradipta Mitra
2012	J	`jnl`	Wireless scheduling with power control. ACM Trans. Algorithms Magnús M. Halldórsson
2011	A	`ed.`	Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings ESA Camil Demetrescu, Magnús M. Halldórsson
2011	J	`jnl`	Algorithms for Weighted Capacity and Admission Control in Wireless Networks CoRR Magnús M. Halldórsson, Pradipta Mitra
2011	B	`conf`	Alternation Graphs. WG Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
2011	J	`jnl`	Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model CoRR Magnús M. Halldórsson, Pradipta Mitra
2011	—	`conf`	Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. ICALP (2) Magnús M. Halldórsson, Pradipta Mitra
2011	A	`conf`	Online Scheduling with Interval Conflicts. STACS Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz
2011	J	`jnl`	Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2011	J	`jnl`	Wireless Capacity With Arbitrary Gain Matrix CoRR Magnús M. Halldórsson, Pradipta Mitra
2011	C	`conf`	Wireless Capacity with Arbitrary Gain Matrix. ALGOSENSORS Magnús M. Halldórsson, Pradipta Mitra
2011	A*	`conf`	Wireless Capacity with Oblivious Power in General Metrics. SODA Magnús M. Halldórsson, Pradipta Mitra
2011	J	`jnl`	Wireless Connectivity and Capacity CoRR Magnús M. Halldórsson, Pradipta Mitra
2010	C	`conf`	Graphs Capturing Alternations in Words. Developments in Language Theory Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
2010	J	`jnl`	On spectrum sharing games. Distributed Comput. Magnús M. Halldórsson, Joseph Y. Halpern, Li Erran Li, Vahab S. Mirrokni
2010	—	`conf`	Online Selection of Intervals and SWAT Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai
2010	J	`jnl`	Online coloring of hypergraphs. Inf. Process. Lett. Magnús M. Halldórsson
2010	A*	`conf`	Online set packing and competitive scheduling of multi-part tasks. PODC Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz
2010	Misc	`conf`	Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN Magnús M. Halldórsson, Hadas Shachnai
2010	—	`conf`	Streaming Algorithms for Independent Sets. ICALP (1) Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy
2010	J	`jnl`	Vertex coloring the square of outerplanar graphs of low degree. Discuss. Math. Graph Theory Geir Agnarsson, Magnús M. Halldórsson
2010	J	`jnl`	Wireless Capacity with Oblivious Power in General Metrics CoRR Magnús M. Halldórsson, Pradipta Mitra
2010	J	`jnl`	Wireless Scheduling with Power Control CoRR Magnús M. Halldórsson
2009	J	`jnl`	Approximation algorithms for the weighted independent set problem in sparse graphs. Discret. Appl. Math. Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
2009	A*	`conf`	Capacity of Arbitrary Wireless Networks. INFOCOM Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl
2009	J	`jnl`	Independent sets in bounded-degree hypergraphs. Discret. Appl. Math. Magnús M. Halldórsson, Elena Losievskaja
2009	—	`conf`	SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. ICALP (1) Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja
2009	J	`jnl`	Scheduling with conflicts: online and offline algorithms. J. Sched. Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron
2009	J	`jnl`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2009	—	`conf`	Wireless Communication Is in APX. ICALP (1) Magnús M. Halldórsson, Roger Wattenhofer
2009	A	`conf`	Wireless Scheduling with Power Control. ESA Magnús M. Halldórsson
2008	—	`ed.`	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games ICALP (1) Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008	—	`ed.`	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations ICALP (2) Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz
2008	—	`conf`	Batch Coloring Flat Graphs and Thin. SWAT Magnús M. Halldórsson, Hadas Shachnai
2008	J	`jnl`	Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2008	B	`conf`	Min Sum Edge Coloring in Multigraphs Via Configuration LP. IPCO Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2008	J	`jnl`	Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci. Magnús M. Halldórsson, Takeshi Tokuyama
2008	A*	`conf`	Robust cost colorings. SODA Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2008	J	`jnl`	Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discret. Appl. Math. Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson
2007	—	`conf`	"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
2007	J	`jnl`	Complete partitions of graphs. Comb. Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2007	B	`conf`	Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
2007	J	`jnl`	Improved approximation results for the stable marriage problem. ACM Trans. Algorithms Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2007	B	`conf`	Independent Sets in Bounded-Degree Hypergraphs. WADS Magnús M. Halldórsson, Elena Losievskaja
2007	J	`jnl`	Strongly simplicial vertices of powers of trees. Discret. Math. Geir Agnarsson, Magnús M. Halldórsson
2006	J	`jnl`	Improved results for data migration and open shop scheduling. ACM Trans. Algorithms Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2006	C	`conf`	Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. ALGOSENSORS Magnús M. Halldórsson, Takeshi Tokuyama
2006	J	`jnl`	Scheduling Split Intervals. SIAM J. Comput. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2006	B	`conf`	Strip Graphs: Recognition and Scheduling. WG Magnús M. Halldórsson, Ragnar K. Karlsson
2006	—	`conf`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2005	B	`conf`	Approximation Algorithms for the Weighted Independent Set Problem. WG Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
2005	J	`jnl`	Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson
2004	B	`conf`	Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004	A*	`conf`	Improved Results for Data Migration and Open Shop Scheduling. ICALP Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004	B	`conf`	Multicoloring: Problems and Techniques. MFCS Magnús M. Halldórsson, Guy Kortsarz
2004	A*	`conf`	On colorings of squares of outerplanar graphs. SODA Geir Agnarsson, Magnús M. Halldórsson
2004	A*	`conf`	On spectrum sharing games. PODC Magnús M. Halldórsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni
2004	J	`jnl`	Randomized approximation of the stable marriage problem. Theor. Comput. Sci. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2004	B	`conf`	Strong Colorings of Hypergraphs. WAOA Geir Agnarsson, Magnús M. Halldórsson
2003	J	`jnl`	Approximability results for stable marriage problems with ties. Theor. Comput. Sci. Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott
2003	J	`jnl`	Approximation algorithms for the test cover problem. Math. Program. 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
2003	J	`jnl`	Coloring Powers of Planar Graphs. SIAM J. Discret. Math. Geir Agnarsson, Magnús M. Halldórsson
2003	A	`conf`	Improved Approximation of the Stable Marriage Problem. ESA Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2003	J	`jnl`	Multicoloring trees. Inf. Comput. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2003	J	`jnl`	Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
2003	—	`conf`	Proper Down-Coloring Simple Acyclic Digraphs. AGTIVE Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson
2003	Misc	`conf`	Randomized Approximation of the Stable Marriage Problem. COCOON Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
2003	J	`jnl`	Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2002	J	`jnl`	Approximating the Domatic Number. SIAM J. Comput. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
2002	B	`conf`	Inapproximability Results on Stable Marriage Problems. LATIN Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita
2002	J	`jnl`	Online independent sets. Theor. Comput. Sci. Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
2002	—	`conf`	Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
2002	A*	`conf`	Scheduling split intervals. SODA Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2002	J	`jnl`	Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. J. Algorithms Magnús M. Halldórsson, Guy Kortsarz
2001	J	`jnl`	Approximation Algorithms for Dispersion Problems. J. Algorithms Barun Chandra, Magnús M. Halldórsson
2001	J	`jnl`	Approximations for the general block distribution of a matrix. Theor. Comput. Sci. Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
2001	J	`jnl`	Greedy Local Improvement and Weighted Set Packing Approximation. J. Algorithms Barun Chandra, Magnús M. Halldórsson
2001	—	`conf`	Logical Form Equivalence: the Case of Referring Expressions Generation. EWNLG@ACL Kees van Deemter, Magnús M. Halldórsson
2001	—	`conf`	Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2001	A	`conf`	On the Approximability of the Minimum Test Collection Problem. ESA Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
2000	—	`ed.`	Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings SWAT Magnús M. Halldórsson
2000	A*	`conf`	Approximating the domatic number. STOC Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz
2000	B	`conf`	Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
2000	J	`jnl`	Approximations of Weighted Independent Set and Hereditary Subset Problems. J. Graph Algorithms Appl. Magnús M. Halldórsson
2000	A*	`conf`	Coloring powers of planar graphs. SODA Geir Agnarsson, Magnús M. Halldórsson
2000	J	`jnl`	Guest Editor's Foreword. Nord. J. Comput. Magnús M. Halldórsson
2000	J	`jnl`	Independent Sets with Domination Constraints. Discret. Appl. Math. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
2000	J	`jnl`	Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
2000	J	`jnl`	On the approximation of largest common subtrees and largest common point sets. Theor. Comput. Sci. Tatsuya Akutsu, Magnús M. Halldórsson
2000	J	`jnl`	Online Coloring Known Graphs. Electron. J. Comb. Magnús M. Halldórsson
2000	Misc	`conf`	Online Independent Sets. COCOON Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi
2000	J	`jnl`	Sum Multicoloring of Graphs. J. Algorithms Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
1999	J	`jnl`	A Matched Approximation Bound for the Sum of a Greedy Coloring. Inf. Process. Lett. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz
1999	Misc	`conf`	Approximations of Weighted Independent Set and Hereditary Subset Problems. COCOON Magnús M. Halldórsson
1999	J	`jnl`	Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
1999	A*	`conf`	Greedy Local Improvement and Weighted Set Packing Approximation. SODA Barun Chandra, Magnús M. Halldórsson
1999	B	`conf`	Mod-2 Independence and Domination in Graphs. WG Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1999	Misc	`conf`	Multi-coloring Trees. COCOON Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
1999	—	`conf`	Multicoloring Planar Graphs and Partial k-Trees. RANDOM-APPROX Magnús M. Halldórsson, Guy Kortsarz
1999	A*	`conf`	Online Coloring Known Graphs. SODA Magnús M. Halldórsson
1999	A	`conf`	Sum Multi-coloring of Graphs. ESA Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
1998	J	`jnl`	Approximating Steiner trees in graphs with restricted weights. Networks Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
1998	—	`conf`	Approximations for the General Block Distribution of a Matrix. SWAT Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
1998	—	`conf`	Approximations of Independent Sets in Graphs. APPROX Magnús M. Halldórsson
1998	A*	`conf`	Independent Sets with Domination Constraints. ICALP Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1998	J	`jnl`	On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir
1997	J	`jnl`	Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica Magnús M. Halldórsson, Jaikumar Radhakrishnan
1997	J	`jnl`	Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. J. Graph Algorithms Appl. Magnús M. Halldórsson, Hoong Chuin Lau
1997	J	`jnl`	Parallel and On-Line Graph Coloring. J. Algorithms Magnús M. Halldórsson
1996	B	`conf`	Approximating IPCO Magnús M. Halldórsson
1996	B	`conf`	Approximation and Special Cases of Common Subtrees and Editing Distance. ISAAC Magnús M. Halldórsson, Keisuke Tanaka
1996	—	`conf`	Facility Dispersion and Remote Subgraphs. SWAT Barun Chandra, Magnús M. Halldórsson
1995	A*	`conf`	Approximating Discrete Collections via Local Improvements. SODA Magnús M. Halldórsson
1995	A*	`conf`	Finding Subsets Maximizing Minimum Structures. SODA Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
1995	B	`conf`	Greedy Approximations of Independent Sets in Low Degree Graphs. ISAAC Magnús M. Halldórsson, Kiyohito Yoshihara
1994	A*	`conf`	Greed is good: approximating independent sets in sparse and bounded-degree graphs. STOC Magnús M. Halldórsson, Jaikumar Radhakrishnan
1994	J	`jnl`	Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. Nord. J. Comput. Magnús M. Halldórsson, Jaikumar Radhakrishnan
1994	—	`conf`	Improved Approximations of Independent Sets in Bounded-Degree Graphs. SWAT Magnús M. Halldórsson, Jaikumar Radhakrishnan
1994	J	`jnl`	Lower Bounds for On-Line Graph Coloring. Theor. Comput. Sci. Magnús M. Halldórsson, Mario Szegedy
1994	B	`conf`	On the Approximation of Largest Common Subtrees and Largest Common Point Sets. ISAAC Tatsuya Akutsu, Magnús M. Halldórsson
1993	J	`jnl`	A Still Better Performance Guarantee for Approximate Graph Coloring. Inf. Process. Lett. Magnús M. Halldórsson
1993	J	`jnl`	Approximating the Minimum Maximal Independence Number. Inf. Process. Lett. Magnús M. Halldórsson
1993	J	`jnl`	Approximating the Tree and Tour Covers of a Graph. Inf. Process. Lett. Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin
1993	A*	`conf`	Directed vs. Undirected Monotone Contact Networks for Threshold Functions FOCS Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
1993	—	`conf`	On Some Communication Complexity Problems Related to THreshold Functions. FSTTCS Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam
1992	J	`jnl`	Approximating Maximum Independent Sets by Excluding Subgraphs. BIT Ravi B. Boppana, Magnús M. Halldórsson
1992	A*	`conf`	Lower Bounds for On-Line Graph Coloring. SODA Magnús M. Halldórsson, Mario Szegedy
1992	B	`conf`	Parallel and On-line Graph Coloring Algorithms. ISAAC Magnús M. Halldórsson
1991	—	`conf`	Lower Bounds for On-line Graph Coloring. On-Line Algorithms Magnús M. Halldórsson, Mario Szegedy
1990	—	`conf`	Approximating Maximum Independent Sets by Excluding Subgraphs. SWAT Ravi B. Boppana, Magnús M. Halldórsson