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
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.
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.
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)
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.
international conference on computer communications (2009)
Approximating the Domatic Number
Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz;Aravind Srinivasan.
SIAM Journal on Computing (2003)
Approximating discrete collections via local improvements
Magnús M. Halldórsson.
symposium on discrete algorithms (1995)
On chromatic sums and distributed resource allocation
Amotz Bar-Noy;Mihir Bellare;Magnús M. Halldórsson;Hadas Shachnai.
Information & Computation (1998)
Coloring Powers of Planar Graphs
Geir Agnarsson;Magnús M. Halldórsson.
SIAM Journal on Discrete Mathematics (2003)
Scheduling Split Intervals
R. Bar-Yehuda;M. M. Halldórsson.
SIAM Journal on Computing (2006)
On spectrum sharing games
Magnús M. Halldórsson;Joseph Y. Halpern;Li Erran Li;Vahab S. Mirrokni.
Distributed Computing (2010)
Greedy Local Improvement and Weighted Set Packing Approximation
Barun Chandra;Magnús M Halldórsson.
Journal of Algorithms (2001)
If you think any of the details on this page are incorrect, let us know.
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: