World's Best Scientists 2026 revealed!
Magnús M. Halldórsson

Magnús M. Halldórsson

D-Index & Metrics

Computer Science

D-Index
48
Citations
8498
World Ranking
6218
National Ranking
2

Magnús M. Halldórsson publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Magnús M. Halldórsson sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 287 publications — 71st percentile

71% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Magnús M. Halldórsson D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Magnús M. Halldórsson sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 48 D-Index — 58th percentile

58% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2020 - European Association for Theoretical Computer Science (EATCS) Fellow For his development of abstract state machines and for outstanding contributions to algebra, logic, game theory, complexity theory and software engineering

Overview

Magnús M. Halldórsson is a researcher affiliated with Reykjavík University in Iceland, specializing in computer science with a focus on theoretical and applied aspects. Their work spans several key areas within computational theory and mathematics, as well as computer networks, artificial intelligence, and electrical engineering.

Their research primarily addresses topics related to complexity and algorithms in graphs, advanced graph theory, cryptography and data security, optimization and search problems, mobile ad hoc networks, computational geometry and mesh generation, and privacy-preserving technologies in data. These topics form the core themes of their academic contributions.

Magnús has published extensively with notable venues frequently featuring their work. These include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theoretical Computer Science
  • Algorithmica
  • Operations Research Letters

Their recent papers demonstrate ongoing contributions to the field:

  • "Coloring Fast Without Learning Your Neighbors' Colors", 2020, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Superfast coloring in CONGEST via efficient color sampling", 2023, Theoretical Computer Science
  • "Query-competitive sorting with uncertainty", 2021, Theoretical Computer Science
  • "Fast Distributed Vertex Splitting with Applications", 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Query minimization under stochastic uncertainty", 2021, Theoretical Computer Science (co-authored)

Magnús has collaborated with several researchers, some of whom appear frequently alongside them in publications. These include Alexandre Nolin, Tigran Tonoyan, Maxime Flin, Yannic Maus, and Fabian Kühn.

Magnús's academic recognition includes being named a Fellow of the European Association for Theoretical Computer Science (EATCS) in 2020. The award citation highlights their work related to abstract state machines and mentions contributions across algebra, logic, game theory, complexity theory, and software engineering.

Best Publications

  • Approximating maximum independent sets by excluding subgraphs

    Ravi Boppana;Ravi Boppana;Magnús M. Halldórsson;Magnús M. Halldórsson

  • Greed is good: Approximating independent sets in sparse and bounded-degree graphs

    M. M. Halldórsson;J. Radhakrishnan

  • Capacity of Arbitrary Wireless Networks

    O. Goussevskaia;R. Wattenhofer;M. M. Halldorsson;E. Welzl

  • Approximating the Domatic Number

    Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz;Aravind Srinivasan

  • Lower bounds for on-line graph coloring

    Magnús M. Halldórsson;Mario Szegedy

  • On chromatic sums and distributed resource allocation

    Amotz Bar-Noy;Mihir Bellare;Magnús M. Halldórsson;Hadas Shachnai

  • Coloring Powers of Planar Graphs

    Geir Agnarsson;Magnús M. Halldórsson

  • Approximating discrete collections via local improvements

    Magnús M. Halldórsson

  • Scheduling Split Intervals

    R. Bar-Yehuda;M. M. Halldórsson

  • A Still Better Performance Guarantee for Approximate Graph Coloring

    Unknown

  • Greedy Local Improvement and Weighted Set Packing Approximation

    Barun Chandra;Magnús M Halldórsson

  • On spectrum sharing games

    Magnús M. Halldórsson;Joseph Y. Halpern;Li Erran Li;Vahab S. Mirrokni

  • On spectrum sharing games

    Magnús M. Halldórsson;Joseph Y. Halpern;Li (Erran) Li;Vahab S. Mirrokni

  • Approximating the minimum maximal independence number

    Magnús M. Halldórsson

  • Approximations of Weighted Independent Set and Hereditary Subset Problems

    Magnús M. Halldórsson

  • Wireless Communication Is in APX

    Magnús M. Halldórsson;Roger Wattenhofer

  • Greed is good: approximating independent sets in sparse and bounded-degree graphs

    Magnús Halldórsson;Jaikumar Radhakrishnan

  • Wireless capacity with oblivious power in general metrics

    Magnús M. Halldórsson;Pradipta Mitra

  • Approximation Algorithms for Dispersion Problems

    Barun Chandra;Magnús M Halldórsson

  • Approximation algorithms for the test cover problem

    de K.M.J. Bontridder;B.V. Halldórsson;M.M. Halldórsson;Cor Hurkens

  • Scheduling split intervals

    Reuven Bar-Yehuda;Magnús M. Halldórsson;Joseph (Seffi) Naor;Hadas Shachnai

  • Wireless scheduling with power control

    Magnús M. Halldórsson

  • Approximating the domatic number

    Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz

Frequent Co-Authors

Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
Kazuo Iwama
Kazuo Iwama Kyoto University
Shuichi Miyazaki
Shuichi Miyazaki University of Tsukuba
Bjarni V. Halldorsson
Bjarni V. Halldorsson Reykjavík University
Boaz Patt-Shamir
Boaz Patt-Shamir Tel Aviv University
Mario Szegedy
Mario Szegedy Rutgers, The State University of New Jersey
Amotz Bar-Noy
Amotz Bar-Noy City University of New York
Dongxiao Yu
Dongxiao Yu Shandong University
Fabian Kuhn
Fabian Kuhn University of Freiburg

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As technology rapidly evolves, students interested in Computer Science often explore related online degree options to expand their skillset or accelerate their careers. A popular choice is the accelerated computer science degree online, which allows motivated learners to complete rigorous coursework on a fast track and enter the workforce sooner.

Engineering fields are also attractive pathways. Earning an environmental engineer degree online helps graduates address pressing global issues such as sustainability and climate change. For those interested in mechanics and design, there are several online mechanical engineering degrees that cover essential topics in materials, robotics, and energy systems.

Additionally, students who enjoy both technology and fundamental sciences might consider enrolling in the cheapest online physics degree programs. These degrees provide a strong analytical foundation and can open doors to research or high-tech industries.

Exploring these related online degrees can help students build unique interdisciplinary expertise and prepare for diverse career opportunities within and beyond computer science.

Best Scientists Citing Magnús M. Halldórsson

Trending Scientists

Recently Published Articles