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
- 2024
[j95]Magnús M. Halldórsson, Dror Rawitz:
Online Multiset Submodular Cover. Algorithmica 86(7): 2393-2411 (2024)- [c138]Magnús M. Halldórsson, Dror Rawitz:
Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO 2024: 281-299 - [c137]Maxime Flin
, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. SODA 2024: 4083-4123 - [i50]Magnús M. Halldórsson, Yannic Maus, Saku Peltonen:
Distributed Lovász Local Lemma under Bandwidth Limitations. CoRR abs/2405.07353 (2024) - [i49]Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin:
Decentralized Distributed Graph Coloring: Cluster Graphs. CoRR abs/2405.07725 (2024) - [i48]Yannic Maus, Magnús M. Halldórsson:
Distributed Delta-Coloring under Bandwidth Limitations. CoRR abs/2405.09975 (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]