Magnús M. Halldórsson

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 45 Citations 7,425 281 World Ranking 4635 National Ranking 2

Research.com Recognitions

Awards & Achievements

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

What are the main themes of his work throughout his whole career to date

Magnús M. Halldórsson regularly ties together related areas like Independent set in his Graph studies. Independent set is frequently linked to Graph in his study. He carries out multidisciplinary research, doing studies in Algorithm and Theory of computation. In his works, he conducts interdisciplinary research on Theory of computation and Discrete mathematics. While working on this project, Magnús M. Halldórsson studies both Discrete mathematics and Combinatorics. His Combinatorics study frequently draws connections to adjacent fields such as Vertex cover. In his work, he performs multidisciplinary research in Vertex cover and Time complexity. He connects Time complexity with Algorithm in his study. Degree (music) is closely attributed to Acoustics in his work.

Magnús M. Halldórsson most often published in these fields:

Graph (100.00%)
Algorithm (100.00%)
Combinatorics (100.00%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Approximating maximum independent sets by excluding subgraphs

Ravi Boppana;Ravi Boppana;Magnús M. Halldórsson;Magnús M. Halldórsson.
Bit Numerical Mathematics (1992)

446 Citations

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

M. M. Halldórsson;J. Radhakrishnan.
Algorithmica (1997)

400 Citations

Capacity of Arbitrary Wireless Networks

O. Goussevskaia;R. Wattenhofer;M. M. Halldorsson;E. Welzl.
international conference on computer communications (2009)

292 Citations

Approximating the Domatic Number

Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz;Aravind Srinivasan.
SIAM Journal on Computing (2003)

249 Citations

Approximating discrete collections via local improvements

Magnús M. Halldórsson.
symposium on discrete algorithms (1995)

214 Citations

On chromatic sums and distributed resource allocation

Amotz Bar-Noy;Mihir Bellare;Magnús M. Halldórsson;Hadas Shachnai.
Information & Computation (1998)

206 Citations

Coloring Powers of Planar Graphs

Geir Agnarsson;Magnús M. Halldórsson.
SIAM Journal on Discrete Mathematics (2003)

203 Citations

Scheduling Split Intervals

R. Bar-Yehuda;M. M. Halldórsson.
SIAM Journal on Computing (2006)

202 Citations

On spectrum sharing games

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

191 Citations

Greedy Local Improvement and Weighted Set Packing Approximation

Barun Chandra;Magnús M Halldórsson.
Journal of Algorithms (2001)

188 Citations

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

Magnús M. Halldórsson

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Research.com Recognitions

Awards & Achievements

Overview

What are the main themes of his work throughout his whole career to date

Magnús M. Halldórsson most often published in these fields:

Best Publications

Report an issue

Frequent Co-Authors

External Links

Best Scientists Citing Magnús M. Halldórsson

Trending Scientists