default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnús M. Halldórsson
Person information
- affiliation: Reykjavík University, Iceland
- affiliation (former): Rutgers University, New Brunswick, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j96]Magnús M. Halldórsson
, Dror Rawitz:
Distributed fractional local ratio and independent set approximation. Inf. Comput. 303: 105238 (2025)- 2024
- [j95]Magnús M. Halldórsson, Dror Rawitz:
Online Multiset Submodular Cover. Algorithmica 86(7): 2393-2411 (2024) - [c140]Magnús M. Halldórsson, Dror Rawitz:
Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO 2024: 281-299 - [c139]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. SODA 2024: 4083-4123 - [c138]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. DISC 2024: 24:1-24:22 - [c137]Magnús M. Halldórsson, Yannic Maus:
Distributed Delta-Coloring Under Bandwidth Limitations. DISC 2024: 31:1-31:22 - [i51]Magnús M. Halldórsson, Yannic Maus, Saku Peltonen:
Distributed Lovász Local Lemma under Bandwidth Limitations. CoRR abs/2405.07353 (2024) - [i50]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring: Cluster Graphs. CoRR abs/2405.07725 (2024) - [i49]Yannic Maus, Magnús M. Halldórsson:
Distributed Delta-Coloring under Bandwidth Limitations. CoRR abs/2405.09975 (2024) - [i48]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs. CoRR abs/2408.11041 (2024) - 2023
- [j94]Magnús M. Halldórsson:
SIROCCO Prize for Innovation in Distributed Computing - Laudatio for Boaz Patt-Shamir. Bull. EATCS 141 (2023) - [j93]Magnús M. Halldórsson, Alexandre Nolin:
Superfast coloring in CONGEST via efficient color sampling. Theor. Comput. Sci. 948: 113711 (2023) - [c136]Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Coloring of Hypergraphs. SIROCCO 2023: 89-111 - [c135]Manuela Fischer, Magnús M. Halldórsson, Yannic Maus:
Fast Distributed Brooks' Theorem. SODA 2023: 2567-2588 - [c134]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. SPAA 2023: 455-465 - [c133]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. DISC 2023: 19:1-19:24 - [e11]Rotem Oshman, Alexandre Nolin, Magnús M. Halldórsson, Alkida Balliu:
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023. ACM 2023 [contents] - [i47]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. CoRR abs/2301.06457 (2023) - [i46]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. CoRR abs/2304.09844 (2023) - [i45]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Fast Coloring Despite Congested Relays. CoRR abs/2308.01359 (2023) - 2022
- [j92]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. Algorithmica 84(4): 1107-1131 (2022) - [c132]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Overcoming Congestion in Distributed Coloring. PODC 2022: 26-36 - [c131]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-optimal distributed degree+1 coloring. STOC 2022: 450-463 - [c130]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. DISC 2022: 26:1-26:24 - [i44]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Overcoming Congestion in Distributed Coloring. CoRR abs/2205.14478 (2022) - [i43]Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin:
Fast Distributed Vertex Splitting with Applications. CoRR abs/2208.08119 (2022) - [i42]Manuela Fischer, Yannic Maus, Magnús M. Halldórsson:
Fast Distributed Brooks' Theorem. CoRR abs/2211.07606 (2022) - 2021
- [j91]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan:
Network Design under General Wireless Interference. Algorithmica 83(11): 3469-3490 (2021) - [j90]Magnús M. Halldórsson, Tigran Tonoyan:
Computing inductive vertex orderings. Inf. Process. Lett. 172: 106159 (2021) - [j89]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): 62-68 (2021) - [j88]Magnús M. Halldórsson, Tigran Tonoyan:
Effective Wireless Scheduling via Hypergraph Sketches. SIAM J. Comput. 50(2): 718-759 (2021) - [j87]Magnús M. Halldórsson, Tigran Tonoyan:
Sparse Backbone and Optimal Distributed SINR Algorithms. ACM Trans. Algorithms 17(2): 17:1-17:34 (2021) - [j86]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-competitive sorting with uncertainty. Theor. Comput. Sci. 867: 50-67 (2021) - [j85]Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima, Tigran Tonoyan:
Query minimization under stochastic uncertainty. Theor. Comput. Sci. 895: 75-95 (2021) - [c129]Magnús M. Halldórsson, Alexandre Nolin:
Superfast Coloring in CONGEST via Efficient Color Sampling. SIROCCO 2021: 68-83 - [c128]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient randomized distributed coloring in CONGEST. STOC 2021: 1180-1193 - [c127]Í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: 115-128 - [i41]Magnús M. Halldórsson, Alexandre Nolin:
Superfast Coloring in CONGEST via Efficient Color Sampling. CoRR abs/2102.04546 (2021) - [i40]Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan:
Ultrafast Distributed Coloring of High Degree Graphs. CoRR abs/2105.04700 (2021) - [i39]Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan:
Near-Optimal Distributed Degree+1 Coloring. CoRR abs/2112.00604 (2021) - 2020
- [j84]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: 21-28 (2020) - [j83]Magnús M. Halldórsson, Christian Konrad:
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees. Theor. Comput. Sci. 811: 29-41 (2020) - [j82]Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio aggregation scheduling. Theor. Comput. Sci. 840: 143-153 (2020) - [j81]Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan:
Limitations of current wireless link scheduling algorithms. Theor. Comput. Sci. 840: 154-165 (2020) - [j80]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and local independent set approximation. Theor. Comput. Sci. 846: 27-37 (2020) - [c126]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization Under Stochastic Uncertainty. LATIN 2020: 181-193 - [c125]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. PODC 2020: 233-242 - [c124]Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Testing of Distance-k Colorings. SIROCCO 2020: 275-290 - [c123]Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA 2020: 159-173 - [c122]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. DISC 2020: 39:1-39:17 - [i38]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus:
Distance-2 Coloring in the CONGEST Model. CoRR abs/2005.06528 (2020) - [i37]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin:
Coloring Fast Without Learning Your Neighbors' Colors. CoRR abs/2008.04303 (2020) - [i36]Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. CoRR abs/2008.05374 (2020) - [i35]Steven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan:
Query Minimization under Stochastic Uncertainty. CoRR abs/2010.03517 (2020) - [i34]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-Competitive Sorting with Uncertainty. CoRR abs/2012.09475 (2020) - [i33]Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan:
Efficient Randomized Distributed Coloring in CONGEST. CoRR abs/2012.14169 (2020)
2010 – 2019
- 2019
- [j79]Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed approximation of k-service assignment. Distributed Comput. 32(1): 27-40 (2019) - [j78]Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
Leveraging multiple channels in ad hoc networks. Distributed Comput. 32(2): 159-172 (2019) - [c121]Magnús M. Halldórsson, Murilo Santos de Lima:
Query-Competitive Sorting with Uncertainty. MFCS 2019: 7:1-7:15 - [c120]Magnús M. Halldórsson, Tigran Tonoyan:
Plain SINR is Enough! PODC 2019: 127-136 - [c119]Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport:
Distributed Minimum Degree Spanning Trees. PODC 2019: 511-520 - [c118]Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver:
The Capacity of Smartphone Peer-To-Peer Networks. DISC 2019: 14:1-14:17 - [c117]Magnús M. Halldórsson, Tigran Tonoyan:
Link Scheduling under Correlated Shadowing. WiOpt 2019: 1-8 - [p2]Magnús M. Halldórsson, Roger Wattenhofer:
Wireless Network Algorithmics. Computing and Software Science 2019: 141-160 - [i32]Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, Alex Weaver:
The Capacity of Smartphone Peer-to-Peer Networks. CoRR abs/1908.01894 (2019) - 2018
- [j77]Magnús M. Halldórsson, Christian Konrad:
Computing large independent sets in a single round. Distributed Comput. 31(1): 69-82 (2018) - [j76]Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed backup placement in networks. Distributed Comput. 31(2): 83-98 (2018) - [j75]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: 159 (2018) - [c116]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan:
Spanning Trees With Edge Conflicts and Wireless Connectivity. ICALP 2018: 158:1-158:15 - [c115]Magnús M. Halldórsson, Tigran Tonoyan:
Wireless Aggregation at Nearly Constant Rate. ICDCS 2018: 753-763 - [c114]Magnús M. Halldórsson, Tigran Tonoyan:
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast. PODC 2018: 85-93 - [c113]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Brief Announcement: Simple and Local Independent Set Approximation. PODC 2018: 163-165 - [c112]Magnús M. Halldórsson:
Session details: Session 3C: Coloring. PODC 2018 - [c111]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. SIROCCO 2018: 88-101 - [p1]Magnús M. Halldórsson, Guy Kortsarz:
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 671-684 - [i31]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. CoRR abs/1803.00786 (2018) - [i30]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan:
Spanning Trees With Edge Conflicts and Wireless Connectivity. CoRR abs/1803.04578 (2018) - [i29]Michael Dinitz, Magnús M. Halldórsson, Calvin Newport:
Distributed Algorithms for Minimum Degree Spanning Trees. CoRR abs/1806.03365 (2018) - [i28]Magnús M. Halldórsson, Tigran Tonoyan:
Effective Wireless Scheduling via Hypergraph Sketches. CoRR abs/1806.10964 (2018) - [i27]Magnús M. Halldórsson, Nicole Megow, Clifford Stein:
Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports 8(3): 1-20 (2018) - 2017
- [j74]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: 84-97 (2017) - [j73]Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer:
The Power of Oblivious Wireless Power. SIAM J. Comput. 46(3): 1062-1086 (2017) - [c110]Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan:
Universal Framework for Wireless Scheduling Problems. ICALP 2017: 129:1-129:15 - [c109]Dongxiao Yu, Yuexuan Wang, Tigran Tonoyan, Magnús M. Halldórsson:
Dynamic Adaptation in Wireless Networks Under Comprehensive Interference via Carrier Sense. IPDPS 2017: 337-346 - [c108]Magnús M. Halldórsson, Tigran Tonoyan:
Wireless Link Capacity under Shadowing and Fading. MobiHoc 2017: 27:1-27:10 - [c107]Magnús M. Halldórsson, Tigran Tonoyan:
Aggregation Rate for Compressible Functions. MobiHoc 2017: 31:1-31:2 - [c106]Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou:
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control. PODC 2017: 203-205 - [c105]Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou:
Leader Election in SINR Model with Arbitrary Power Control. SIROCCO 2017: 3-14 - [c104]Magnús M. Halldórsson, Christian Konrad:
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. SIROCCO 2017: 247-262 - [c103]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. WADS 2017: 437-448 - [c102]Magnús M. Halldórsson, Fabian Kuhn, Nancy A. Lynch, Calvin Newport:
An Efficient Communication Abstraction for Dense Wireless Networks. DISC 2017: 25:1-25:16 - [i26]Magnús M. Halldórsson, Tigran Tonoyan:
Universal Framework for Wireless Scheduling Problems. CoRR abs/1705.10104 (2017) - [i25]Magnús M. Halldórsson, Tigran Tonoyan:
Wireless Link Capacity under Shadowing and Fading. CoRR abs/1706.05269 (2017) - [i24]Magnús M. Halldórsson, Tigran Tonoyan:
Wireless Aggregation at Nearly Constant Rate. CoRR abs/1712.03053 (2017) - [i23]Christina Fragouli, Magnús M. Halldórsson, Kyle Jamieson, Bhaskar Krishnamachari:
Foundations of Wireless Networking (Dagstuhl Seminar 17271). Dagstuhl Reports 7(7): 1-21 (2017) - 2016
- [j72]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): 1205-1223 (2016) - [j71]Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy:
Streaming Algorithms for Independent Sets in Sparse Hypergraphs. Algorithmica 76(2): 490-501 (2016) - [j70]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: 101-109 (2016) - [j69]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. 201: 164-171 (2016) - [j68]Magnús M. Halldórsson, Pradipta Mitra:
Nearly optimal bounds for distributed wireless scheduling in the SINR model. Distributed Comput. 29(2): 77-88 (2016) - [j67]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): 1288-1304 (2016) - [j66]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ACM Trans. Algorithms 12(4): 51:1-51:32 (2016) - [c101]Marijke H. L. Bodlaender, Magnús M. Halldórsson, Christian Konrad, Fabian Kuhn:
Brief Announcement: Local Independent Set Approximation. PODC 2016: 93-95 - [c100]Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu:
Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks. PODC 2016: 199-201 - [c99]Magnús M. Halldórsson:
Invited paper: Models for wireless algorithms. WiOpt 2016: 377-381 - [i22]Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
Leveraging Multiple Channels in Ad Hoc Networks. CoRR abs/1604.07182 (2016) - [i21]Magnús M. Halldórsson, Tigran Tonoyan, Yuexuan Wang, Dongxiao Yu:
Data Dissemination in Unified Dynamic Wireless Networks. CoRR abs/1605.02474 (2016) - 2015
- [j65]Jørgen Bang-Jensen, Magnús M. Halldórsson:
Vertex coloring edge-weighted digraphs. Inf. Process. Lett. 115(10): 791-796 (2015) - [j64]Magnús M. Halldórsson:
Guest editorial: Structural Information and Communication Complexity. Theor. Comput. Sci. 608: 199-200 (2015) - [c98]Magnús M. Halldórsson, Christian Konrad, Tigran Tonoyan:
Limitations of Current Wireless Scheduling Algorithms. ALGOSENSORS 2015: 71-84 - [c97]Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio Aggregation Scheduling. ALGOSENSORS 2015: 169-182 - [c96]Magnús M. Halldórsson, Tigran Tonoyan:
The Price of Local Power Control in Wireless Scheduling. FSTTCS 2015: 529-542 - [c95]Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed Approximation of k-Service Assignment. OPODIS 2015: 11:1-11:16 - [c94]Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch:
A Local Broadcast Layer for the SINR Network Model. PODC 2015: 129-138 - [c93]Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
Leveraging Multiple Channels in Ad Hoc Networks. PODC 2015: 431-440 - [c92]Magnús M. Halldórsson:
Progress (and Lack Thereof) for Graph Coloring Approximation Problems. SOFSEM 2015: 14-23 - [c91]Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed Backup Placement in Networks. SPAA 2015: 274-283 - [c90]Magnús M. Halldórsson, Tigran Tonoyan:
How Well Can Graphs Represent Wireless Interference? STOC 2015: 635-644 - [c89]Magnús M. Halldórsson, Christian Konrad:
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs. DISC 2015: 559-572 - [e10]Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann:
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9134, Springer 2015, ISBN 978-3-662-47671-0 [contents] - [e9]Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann:
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9135, Springer 2015, ISBN 978-3-662-47665-9 [contents] - [i20]Magnús M. Halldórsson, Tigran Tonoyan:
The Price of Local Power Control in Wireless Scheduling. CoRR abs/1502.05279 (2015) - [i19]Magnús M. Halldórsson, Stephan Holzer, Nancy A. Lynch:
A Local Broadcast Layer for the SINR Network Model. CoRR abs/1505.04514 (2015) - [i18]Daniele Catanzaro, Steven Chaplick, Stefan Felsner, Bjarni V. Halldórsson, Magnús M. Halldórsson, Thomas Hixon, Juraj Stacho:
Max Point-Tolerance Graphs. CoRR abs/1508.03810 (2015) - [i17]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. CoRR abs/1512.06989 (2015) - 2014
- [j63]Luca Aceto, Magnús M. Halldórsson, Anna Ingólfsdóttir:
Report on Two events at ICE-TCS, Reykjavik University. Bull. EATCS 114 (2014) - [j62]Magnús M. Halldórsson, Calvin Newport:
Making wireless algorithm theory more useful: five ideas from the 2013 workshop on realistic models for algorithms in wireless networks. SIGACT News 45(3): 72-74 (2014) - [j61]Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen:
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553: 1 (2014) - [j60]Magnús M. Halldórsson, Pradipta Mitra:
Wireless capacity with arbitrary gain matrix. Theor. Comput. Sci. 553: 57-63 (2014) - [j59]Olga Goussevskaia, Magnús M. Halldórsson, Roger Wattenhofer:
Algorithms for Wireless Capacity. IEEE/ACM Trans. Netw. 22(3): 745-755 (2014) - [c88]Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The Minimum Vulnerability Problem on Graphs. COCOA 2014: 299-313 - [c87]Helga Gudmundsdottir, Eyjólfur Ingi Ásgeirsson, Marijke H. L. Bodlaender, Joseph T. Foley, Magnús M. Halldórsson, Ymir Vigfusson:
Extending wireless algorithm design to arbitrary environments via metricity. MSWiM 2014: 275-284 - [c86]Marijke H. L. Bodlaender, Magnús M. Halldórsson:
Beyond geometry: towards fully realistic wireless models. PODC 2014: 347-356 - [c85]Magnús M. Halldórsson, Christian Konrad:
Distributed Algorithms for Coloring Interval Graphs. DISC 2014: 454-468 - [c84]Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Maximum MIMO Flow in wireless networks under the SINR model. WiOpt 2014: 295-302 - [e8]Magnús M. Halldórsson, Shlomi Dolev:
ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014. ACM 2014, ISBN 978-1-4503-2944-6 [contents] - [e7]Magnús M. Halldórsson:
Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings. Lecture Notes in Computer Science 8576, Springer 2014, ISBN 978-3-319-09619-3 [contents] - [i16]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:
Measurement Based Interference Models for Wireless Scheduling Algorithms. CoRR abs/1401.1723 (2014) - [i15]Marijke H. L. Bodlaender, Magnús M. Halldórsson:
Beyond Geometry : Towards Fully Realistic Wireless Models. CoRR abs/1402.5003 (2014) - [i14]Magnús M. Halldórsson, Tigran Tonoyan:
How Well Can Graphs Represent Wireless Interference? CoRR abs/1411.1263 (2014) - 2013
- [j58]Camil Demetrescu, Magnús M. Halldórsson:
Editorial. Algorithmica 67(4): 449-450 (2013) - [j57]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online selection of intervals and t-intervals. Inf. Comput. 233: 1-11 (2013) - [j56]Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. Theory Comput. Syst. 53(2): 300-317 (2013) - [j55]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4): 34:1-34:7 (2013) - [j54]Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja:
SDP-based algorithms for maximum independent set problems on hypergraphs. Theor. Comput. Sci. 470: 1-9 (2013) - [j53]Tatsuya Akutsu, Daiji Fukagawa, Magnús M. Halldórsson, Atsuhiro Takasu, Keisuke Tanaka:
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theor. Comput. Sci. 470: 10-22 (2013) - [c83]Magnús M. Halldórsson:
Modeling Reality Algorithmically: The Case of Wireless Communication. ALGOSENSORS 2013: 1-5 - [c82]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. APPROX-RANDOM 2013: 158-172 - [c81]Marijke H. L. Bodlaender, Magnús M. Halldórsson, Pradipta Mitra:
Connectivity and aggregation in multihop wireless networks. PODC 2013: 355-364 - [c80]Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer:
The Power of Non-Uniform Wireless Power. SODA 2013: 1595-1606 - [c79]Magnús M. Halldórsson:
Brief announcement: locality in wireless scheduling. SPAA 2013: 97-98 - [e6]Amotz Bar-Noy, Magnús M. Halldórsson:
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. Lecture Notes in Computer Science 7718, Springer 2013, ISBN 978-3-642-36091-6 [contents] - 2012
- [j52]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online Set Packing. SIAM J. Comput. 41(4): 728-746 (2012) - [j51]Magnús M. Halldórsson:
Wireless scheduling with power control. ACM Trans. Algorithms 9(1): 7:1-7:20 (2012) - [c78]Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
A fully distributed algorithm for throughput performance in wireless networks. CISS 2012: 1-5 - [c77]Magnús M. Halldórsson, Pradipta Mitra:
Towards tight bounds for local broadcasting. FOMC 2012: 2 - [c76]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. ICALP (1) 2012: 302-313 - [c75]Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy, Chengu Wang:
Streaming and Communication Complexity of Clique Approximation. ICALP (1) 2012: 449-460 - [c74]Magnús M. Halldórsson, Pradipta Mitra:
Wireless capacity and admission control in cognitive radio. INFOCOM 2012: 855-863 - [c73]Pierre Fraigniaud, Magnús M. Halldórsson, Amos Korman:
On the Impact of Identifiers on Local Decision. OPODIS 2012: 224-238 - [c72]Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Brief announcement: distributed algorithms for throughput performance in wireless networks. PODC 2012: 89-90 - [c71]Magnús M. Halldórsson, Pradipta Mitra:
Distributed connectivity of wireless networks. PODC 2012: 205-214 - [c70]Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Wireless Network Stability in the SINR Model. SIROCCO 2012: 123-134 - [c69]Magnús M. Halldórsson, Pradipta Mitra:
Wireless connectivity and capacity. SODA 2012: 516-526 - [e5]Guy Even, Magnús M. Halldórsson:
Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7355, Springer 2012, ISBN 978-3-642-31103-1 [contents] - [i13]Yuval Emek, Magnús M. Halldórsson, Adi Rosén:
Space-Constrained Interval Selection. CoRR abs/1202.4326 (2012) - [i12]Olga Goussevskaia, Magnús M. Halldórsson, Roger Wattenhofer:
Algorithms for Wireless Capacity. CoRR abs/1203.0536 (2012) - [i11]Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
A Fully Distributed Algorithm for Throughput Performance in Wireless Networks. CoRR abs/1203.3962 (2012) - [i10]Magnús M. Halldórsson, Pradipta Mitra:
Distributed Connectivity of Wireless Networks. CoRR abs/1205.5164 (2012) - [i9]Magnús M. Halldórsson, Pradipta Mitra:
Towards Tight Bounds for Local Broadcasting. CoRR abs/1207.1836 (2012) - [i8]Magnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer:
The Power of Non-Uniform Wireless Power. CoRR abs/1210.3371 (2012) - [i7]Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson, Pradipta Mitra:
Wireless Network Stability in the SINR Model. CoRR abs/1210.4446 (2012) - 2011
- [j50]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2): 22:1-22:21 (2011) - [c68]Magnús M. Halldórsson, Pradipta Mitra:
Wireless Capacity with Arbitrary Gain Matrix. ALGOSENSORS 2011: 215-224 - [c67]Magnús M. Halldórsson, Pradipta Mitra:
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. ICALP (2) 2011: 625-636 - [c66]Magnús M. Halldórsson, Pradipta Mitra:
Wireless Capacity with Oblivious Power in General Metrics. SODA 2011: 1538-1548 - [c65]Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. STACS 2011: 472-483 - [c64]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Alternation Graphs. WG 2011: 191-202 - [e4]Camil Demetrescu, Magnús M. Halldórsson:
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Lecture Notes in Computer Science 6942, Springer 2011, ISBN 978-3-642-23718-8 [contents] - [i6]Magnús M. Halldórsson, Pradipta Mitra:
Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. CoRR abs/1104.5200 (2011) - [i5]Magnús M. Halldórsson, Pradipta Mitra:
Wireless Capacity With Arbitrary Gain Matrix. CoRR abs/1108.1055 (2011) - [i4]Magnús M. Halldórsson, Pradipta Mitra:
Wireless Connectivity and Capacity. CoRR abs/1110.0938 (2011) - [i3]Magnús M. Halldórsson, Pradipta Mitra:
Algorithms for Weighted Capacity and Admission Control in Wireless Networks. CoRR abs/1111.5200 (2011) - 2010
- [j49]Magnús M. Halldórsson, Joseph Y. Halpern, Li Erran Li, Vahab S. Mirrokni:
On spectrum sharing games. Distributed Comput. 22(4): 235-248 (2010) - [j48]Geir Agnarsson, Magnús M. Halldórsson:
Vertex coloring the square of outerplanar graphs of low degree. Discuss. Math. Graph Theory 30(4): 619-636 (2010) - [j47]Magnús M. Halldórsson:
Online coloring of hypergraphs. Inf. Process. Lett. 110(10): 370-372 (2010) - [c63]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Graphs Capturing Alternations in Words. Developments in Language Theory 2010: 436-437 - [c62]Magnús M. Halldórsson, Hadas Shachnai:
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN 2010: 237-248 - [c61]Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy:
Streaming Algorithms for Independent Sets. ICALP (1) 2010: 641-652 - [c60]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online set packing and competitive scheduling of multi-part tasks. PODC 2010: 440-449 - [c59]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online Selection of Intervals and t-Intervals. SWAT 2010: 383-394 - [i2]Magnús M. Halldórsson:
Wireless Scheduling with Power Control. CoRR abs/1010.3427 (2010) - [i1]Magnús M. Halldórsson, Pradipta Mitra:
Wireless Capacity with Oblivious Power in General Metrics. CoRR abs/1010.4249 (2010)
2000 – 2009
- 2009
- [j46]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009) - [j45]Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson:
Approximation algorithms for the weighted independent set problem in sparse graphs. Discret. Appl. Math. 157(4): 617-626 (2009) - [j44]Magnús M. Halldórsson, Elena Losievskaja:
Independent sets in bounded-degree hypergraphs. Discret. Appl. Math. 157(8): 1773-1786 (2009) - [j43]Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron:
Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2): 199-224 (2009) - [c58]Magnús M. Halldórsson:
Wireless Scheduling with Power Control. ESA 2009: 361-372 - [c57]Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja:
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. ICALP (1) 2009: 12-23 - [c56]Magnús M. Halldórsson, Roger Wattenhofer:
Wireless Communication Is in APX. ICALP (1) 2009: 525-536 - [c55]Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl:
Capacity of Arbitrary Wireless Networks. INFOCOM 2009: 1872-1880 - 2008
- [j42]Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson:
Vertex coloring acyclic digraphs and their corresponding hypergraphs. Discret. Appl. Math. 156(10): 1918-1928 (2008) - [j41]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008) - [j40]Magnús M. Halldórsson, Takeshi Tokuyama:
Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci. 402(1): 29-42 (2008) - [c54]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Min Sum Edge Coloring in Multigraphs Via Configuration LP. IPCO 2008: 359-373 - [c53]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
Robust cost colorings. SODA 2008: 1204-1212 - [c52]Magnús M. Halldórsson, Hadas Shachnai:
Batch Coloring Flat Graphs and Thin. SWAT 2008: 198-209 - [e3]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
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. Lecture Notes in Computer Science 5125, Springer 2008, ISBN 978-3-540-70574-1 [contents] - [e2]Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz:
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. Lecture Notes in Computer Science 5126, Springer 2008, ISBN 978-3-540-70582-6 [contents] - 2007
- [j39]Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
Complete partitions of graphs. Comb. 27(5): 519-550 (2007) - [j38]Geir Agnarsson, Magnús M. Halldórsson:
Strongly simplicial vertices of powers of trees. Discret. Math. 307(21): 2647-2652 (2007) - [j37]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3): 30 (2007) - [c51]Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS 2007: 84-95 - [c50]Magnús M. Halldórsson, Elena Losievskaja:
Independent Sets in Bounded-Degree Hypergraphs. WADS 2007: 263-274 - [c49]Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees. WADS 2007: 410-421 - 2006
- [j36]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006) - [j35]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 2(1): 116-129 (2006) - [c48]Magnús M. Halldórsson, Takeshi Tokuyama:
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. ALGOSENSORS 2006: 71-82 - [c47]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM 2006: 116-127 - [c46]Magnús M. Halldórsson, Ragnar K. Karlsson:
Strip Graphs: Recognition and Scheduling. WG 2006: 137-146 - 2005
- [j34]Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson:
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. 94(2): 49-53 (2005) - [c45]Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson:
Approximation Algorithms for the Weighted Independent Set Problem. WG 2005: 341-350 - 2004
- [j33]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325(3): 439-465 (2004) - [c44]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669 - [c43]Magnús M. Halldórsson, Guy Kortsarz:
Multicoloring: Problems and Techniques. MFCS 2004: 25-41 - [c42]Magnús M. Halldórsson, Joseph Y. Halpern, Li (Erran) Li, Vahab S. Mirrokni:
On spectrum sharing games. PODC 2004: 107-114 - [c41]Geir Agnarsson, Magnús M. Halldórsson:
On colorings of squares of outerplanar graphs. SODA 2004: 244-253 - [c40]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA 2004: 68-82 - [c39]Geir Agnarsson, Magnús M. Halldórsson:
Strong Colorings of Hypergraphs. WAOA 2004: 253-266 - 2003
- [j32]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica 37(3): 187-209 (2003) - [j31]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of geometric intersection graphs and dispersion algorithms. Discret. Appl. Math. 132(1-3): 3-16 (2003) - [j30]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003) - [j29]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:
Approximation algorithms for the test cover problem. Math. Program. 98(1-3): 477-491 (2003) - [j28]Geir Agnarsson, Magnús M. Halldórsson:
Coloring Powers of Planar Graphs. SIAM J. Discret. Math. 16(4): 651-662 (2003) - [j27]Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott:
Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3): 431-447 (2003) - [c38]Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson:
Proper Down-Coloring Simple Acyclic Digraphs. AGTIVE 2003: 299-312 - [c37]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350 - [c36]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277 - 2002
- [j26]Magnús M. Halldórsson, Guy Kortsarz:
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. J. Algorithms 42(2): 334-366 (2002) - [j25]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan:
Approximating the Domatic Number. SIAM J. Comput. 32(1): 172-195 (2002) - [j24]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online independent sets. Theor. Comput. Sci. 289(2): 953-962 (2002) - [c35]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Inapproximability Results on Stable Marriage Problems. LATIN 2002: 554-568 - [c34]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling split intervals. SODA 2002: 732-741 - [c33]Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms. SWAT 2002: 140-149 - 2001
- [j23]Barun Chandra, Magnús M. Halldórsson:
Approximation Algorithms for Dispersion Problems. J. Algorithms 38(2): 438-465 (2001) - [j22]Barun Chandra, Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation. J. Algorithms 39(2): 223-240 (2001) - [j21]Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the general block distribution of a matrix. Theor. Comput. Sci. 262(1): 145-160 (2001) - [c32]Kees van Deemter, Magnús M. Halldórsson:
Logical Form Equivalence: the Case of Referring Expressions Generation. EWNLG@ACL 2001 - [c31]Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi:
On the Approximability of the Minimum Test Collection Problem. ESA 2001: 158-169 - [c30]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX 2001: 114-126 - 2000
- [j20]Magnús M. Halldórsson:
Online Coloring Known Graphs. Electron. J. Comb. 7 (2000) - [j19]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. Discret. Appl. Math. 99(1-3): 39-54 (2000) - [j18]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000) - [j17]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multicoloring of Graphs. J. Algorithms 37(2): 422-450 (2000) - [j16]Magnús M. Halldórsson:
Approximations of Weighted Independent Set and Hereditary Subset Problems. J. Graph Algorithms Appl. 4(1): 1-16 (2000) - [j15]Magnús M. Halldórsson:
Guest Editor's Foreword. Nord. J. Comput. 7(3): 149-150 (2000) - [j14]Tatsuya Akutsu, Magnús M. Halldórsson:
On the approximation of largest common subtrees and largest common point sets. Theor. Comput. Sci. 233(1-2): 33-50 (2000) - [c29]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online Independent Sets. COCOON 2000: 202-209 - [c28]Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda:
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC 2000: 204-215 - [c27]Geir Agnarsson, Magnús M. Halldórsson:
Coloring powers of planar graphs. SODA 2000: 654-662 - [c26]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz:
Approximating the domatic number. STOC 2000: 134-143 - [e1]Magnús M. Halldórsson:
Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings. Lecture Notes in Computer Science 1851, Springer 2000, ISBN 3-540-67690-2 [contents]
1990 – 1999
- 1999
- [j13]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz:
A Matched Approximation Bound for the Sum of a Greedy Coloring. Inf. Process. Lett. 71(3-4): 135-140 (1999) - [j12]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. 12(3): 342-359 (1999) - [c25]Magnús M. Halldórsson:
Approximations of Weighted Independent Set and Hereditary Subset Problems. COCOON 1999: 261-270 - [c24]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multi-coloring Trees. COCOON 1999: 271-280 - [c23]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multi-coloring of Graphs. ESA 1999: 390-401 - [c22]Magnús M. Halldórsson, Guy Kortsarz:
Multicoloring Planar Graphs and Partial k-Trees. RANDOM-APPROX 1999: 73-84 - [c21]Barun Chandra, Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation. SODA 1999: 169-176 - [c20]Magnús M. Halldórsson:
Online Coloring Known Graphs. SODA 1999: 917-918 - [c19]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Mod-2 Independence and Domination in Graphs. WG 1999: 101-109 - 1998
- [j11]Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140(2): 183-202 (1998) - [j10]Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani:
Approximating Steiner trees in graphs with restricted weights. Networks 31(4): 283-292 (1998) - [c18]Magnús M. Halldórsson:
Approximations of Independent Sets in Graphs. APPROX 1998: 1-13 - [c17]Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints. ICALP 1998: 176-187 - [c16]Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58 - 1997
- [j9]Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. Algorithmica 18(1): 145-163 (1997) - [j8]Magnús M. Halldórsson:
Parallel and On-Line Graph Coloring. J. Algorithms 23(2): 265-280 (1997) - [j7]Magnús M. Halldórsson, Hoong Chuin Lau:
Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring. J. Graph Algorithms Appl. 1(3): 1-13 (1997) - 1996
- [c15]Magnús M. Halldórsson:
Approximating k-Set Cover and Complementary Graph Coloring. IPCO 1996: 118-131 - [c14]Magnús M. Halldórsson, Keisuke Tanaka:
Approximation and Special Cases of Common Subtrees and Editing Distance. ISAAC 1996: 75-84 - [c13]Barun Chandra, Magnús M. Halldórsson:
Facility Dispersion and Remote Subgraphs. SWAT 1996: 53-65 - 1995
- [c12]Magnús M. Halldórsson, Kiyohito Yoshihara:
Greedy Approximations of Independent Sets in Low Degree Graphs. ISAAC 1995: 152-161 - [c11]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159 - [c10]Magnús M. Halldórsson:
Approximating Discrete Collections via Local Improvements. SODA 1995: 160-169 - 1994
- [j6]Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. Nord. J. Comput. 1(4): 475-492 (1994) - [j5]Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-Line Graph Coloring. Theor. Comput. Sci. 130(1): 163-174 (1994) - [c9]Tatsuya Akutsu, Magnús M. Halldórsson:
On the Approximation of Largest Common Subtrees and Largest Common Point Sets. ISAAC 1994: 405-413 - [c8]Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Greed is good: approximating independent sets in sparse and bounded-degree graphs. STOC 1994: 439-448 - [c7]Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Improved Approximations of Independent Sets in Bounded-Degree Graphs. SWAT 1994: 195-206 - 1993
- [j4]Magnús M. Halldórsson:
A Still Better Performance Guarantee for Approximate Graph Coloring. Inf. Process. Lett. 45(1): 19-23 (1993) - [j3]Magnús M. Halldórsson:
Approximating the Minimum Maximal Independence Number. Inf. Process. Lett. 46(4): 169-172 (1993) - [j2]Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin:
Approximating the Tree and Tour Covers of a Graph. Inf. Process. Lett. 47(6): 275-282 (1993) - [c6]Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed vs. Undirected Monotone Contact Networks for Threshold Functions. FOCS 1993: 604-613 - [c5]Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam:
On Some Communication Complexity Problems Related to THreshold Functions. FSTTCS 1993: 248-259 - 1992
- [j1]Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Maximum Independent Sets by Excluding Subgraphs. BIT 32(2): 180-196 (1992) - [c4]Magnús M. Halldórsson:
Parallel and On-line Graph Coloring Algorithms. ISAAC 1992: 61-70 - [c3]Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-Line Graph Coloring. SODA 1992: 211-216 - 1991
- [c2]Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-line Graph Coloring. On-Line Algorithms 1991: 169-179 - 1990
- [c1]Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Maximum Independent Sets by Excluding Subgraphs. SWAT 1990: 13-25
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
