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
6217
National Ranking
2

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
Boaz Patt-Shamir
Boaz Patt-Shamir Tel Aviv University
Bjarni V. Halldorsson
Bjarni V. Halldorsson Reykjavík University
Amotz Bar-Noy
Amotz Bar-Noy City University of New York
Mario Szegedy
Mario Szegedy Rutgers, The State University of New Jersey
Fabian Kuhn
Fabian Kuhn University of Freiburg
Guy Even
Guy Even Tel Aviv University

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