Experience
Education
Bio
After a secondary education in Iceland, I did my undergraduate at University of Oregon, in math and CS, from 1982-1985. Went back and worked as a software engineer for a year. Headed to Rutgers University, originally intending to get a master degree in software engineering, but ended up in 1991 with a Ph.D. focusing on approximation and online algorithms under the guidance of Ravi Boppana. I then worked at Tokyo Institute of Technology for 8 months, followed by JAIST for three years in Ishikawa prefecture in Japan. Since 1995, I have resided in Iceland, first at University of Iceland and since 2007 at Reykjavik University. I have also had visiting or other appointments: IBM Tokyo Research labs, Max Planck Institute in Saarbruecken, University of Bergen, Kyoto University, Tokyo Institute of Technology, and RIMS in Kyoto. My main research interests are in the design and analysis of algorithms, in particular approximation algorithms for combinatorial NP-hard problems. Recently, I have been focusing on problems in wireless communication, particularly on combining rigorous algorithms analysis with realistic models of interference. Additionally, I have in the past been interested in bioinformatics and biological computing, and the sociological aspects of a networked world. Publications: 1. Ravi B. Boppana and Magnús M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2):180–196, June 1992. 2. Magnús M. Halldórsson. A still better performance guarantee for approximate graph coloring. Information Processing Letters, 45:19–23, 25 January 1993. 3. Magnús M. Halldórsson. Approximating the minimum maximal independence number. Information Processing Letters, 46:169–172, 25 June 1993. 4. Esther Arkin, Magnús M. Halldórsson, and Refael Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47:275–282, 18 October 1993. 5. Magnús M. Halldórsson and Mario Szegedy. Lower bounds for on-line graph coloring. Theoretical Computer Science, 130:163–174, August 1994. 6. Magnús M. Halldórsson and Jaikumar Radhakrishnan. Improved approximations of bounded-degree independent sets via subgraph removal. In a special issue of Nordic J. Computing, 1(4):475–492, Winter 1994. Received the Carl-Erik Fröberg Award. 7. Magnús M. Halldórsson and Jaikumar Radhakrishnan. Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18:145–163, 1997. 8. Magnús M. Halldórsson. Parallel and online graph coloring. Journal of Algorithms, 23:265–280, 1997.