Folgen
Magnús M. Halldórsson
Magnús M. Halldórsson
Professor of Computer Science, Reykjavik University
Bestätigte E-Mail-Adresse bei ru.is - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson
5321995
Approximating maximum independent sets by excluding subgraphs
R Boppana, MM Halldórsson
BIT Numerical Mathematics 32 (2), 180-196, 1992
4121992
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
M Halldórsson, J Radhakrishnan
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
4051994
Capacity of arbitrary wireless networks
O Goussevskaia, R Wattenhofer, MM Halldórsson, E Welzl
IEEE INFOCOM 2009, 1872-1880, 2009
2962009
A still better performance guarantee for approximate graph coloring
MM Halldórsson
Information Processing Letters 45 (1), 19-23, 1993
2961993
Approximating the domatic number
U Feige, MM Halldórsson, G Kortsarz, A Srinivasan
SIAM Journal on computing 32 (1), 172-195, 2002
2562002
Approximating discrete collections via local improvements
MM Halldórsson
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995
2241995
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
2051998
Scheduling split intervals
R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira
SIAM Journal on Computing 36 (1), 1-15, 2006
2042006
Greedy local improvement and weighted set packing approximation
B Chandra, MM Halldórsson
Journal of Algorithms 39 (2), 223-240, 2001
2022001
Coloring powers of planar graphs
G Agnarsson, MM Halldórsson
SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003
1972003
Approximations of weighted independent set and hereditary subset problems
MM Halldórsson
Graph Algorithms And Applications 2, 3-18, 2004
1912004
On spectrum sharing games
MM Halldórsson, JY Halpern, L Li, VS Mirrokni
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
1852004
Approximating the minimum maximal independence number
MM Halldórsson
Information Processing Letters 46 (4), 169-172, 1993
1521993
Wireless Communication is in APX
MM Halldórsson, R Wattenhofer
Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009
1432009
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
1332011
Wireless scheduling with power control
MM Halldórsson
ACM Transactions on Algorithms (TALG) 9 (1), 1-20, 2012
1252012
Lower bounds for on-line graph coloring
MM Halldórsson, M Szegedy
Theoretical Computer Science 130 (1), 163-174, 1994
1221994
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
992003
Approximating the tree and tour covers of a graph
EM Arkin, MM Halldórsson, R Hassin
Information Processing Letters 47 (6), 275-282, 1993
991993
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20