Magnús M. Halldórsson
Magnús M. Halldórsson
Professor of Computer Science, Reykjavik University
Verified email at ru.is - Homepage
TitleCited byYear
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson, M Karpinski
4911995
Approximating maximum independent sets by excluding subgraphs
R Boppana, MM Halldórsson
BIT Numerical Mathematics 32 (2), 180-196, 1992
3431992
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
MM Halldórsson, J Radhakrishnan
Algorithmica 18 (1), 145-163, 1997
3411997
A still better performance guarantee for approximate graph coloring
MM Halldórsson
Information Processing Letters 45 (1), 19-23, 1993
2761993
Capacity of arbitrary wireless networks
O Goussevskaia, R Wattenhofer, MM Halldórsson, E Welzl
IEEE INFOCOM 2009, 1872-1880, 2009
2662009
Approximating thedomatic number
U Feige, MM Halldórsson, G Kortsarz, A Srinivasan
SIAM Journal on computing 32 (1), 172-195, 2002
2322002
Approximations of weighted independent set and hereditary subset problems
MM Halldórsson
Graph Algorithms And Applications 2, 3-18, 2004
211*2004
Coloring powers of planar graphs
G Agnarsson, MM Halldórsson
SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003
1912003
Approximating Discrete Collections via Local Improvements.
MM Halldórsson
SODA 95, 160-169, 1995
1861995
On spectrum sharing games
MM Halldórsson, JY Halpern, LE Li, VS Mirrokni
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
1792004
On chromatic sums and distributed resource allocation
A Bar-Noy, M Bellare, MM Halldórsson, H Shachnai, T Tamir
Information and Computation 140 (2), 183-202, 1998
1781998
Greedy local improvement and weighted set packing approximation
B Chandra, MM Halldórsson
Journal of Algorithms 39 (2), 223-240, 2001
1662001
Approximating the minimum maximal independence number
MM Halldórsson
Information Processing Letters 46 (4), 169-172, 1993
1401993
Wireless Communication is in APX
MM Halldórsson, R Wattenhofer
International Colloquium on Automata, Languages, and Programming, 525-536, 2009
1322009
Wireless capacity with oblivious power in general metrics
MM Halldórsson, P Mitra
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
1182011
Lower bounds for on-line graph coloring
MM Halldórsson, M Szegedy
Theoretical Computer Science 130 (1), 163-174, 1994
1091994
Scheduling split intervals
R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira
SIAM Journal on Computing 36 (1), 1-15, 2006
1012006
Approximating the tree and tour covers of a graph
EM Arkin, MM Halldórsson, R Hassin
Information Processing Letters 47 (6), 275-282, 1993
941993
Approximation algorithms for the test cover problem
KMJ De Bontridder, BV Halldórsson, MM Halldórsson, CAJ Hurkens, ...
Mathematical Programming 98 (1-3), 477-491, 2003
892003
Approximability results for stable marriage problems with ties
MM Halldórsson, RW Irving, K Iwama, DF Manlove, S Miyazaki, Y Morita, ...
Theoretical Computer Science 306 (1-3), 431-447, 2003
842003
The system can't perform the operation now. Try again later.
Articles 1–20