| A compendium of NP optimization problems P Crescenzi, V Kann, M Halldórsson | 546 | 1995 |
| Approximating maximum independent sets by excluding subgraphs R Boppana, MM Halldórsson BIT Numerical Mathematics 32 (2), 180-196, 1992 | 482 | 1992 |
| 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 | 459 | 1994 |
| A still better performance guarantee for approximate graph coloring MM Halldórsson Information Processing Letters 45 (1), 19-23, 1993 | 323 | 1993 |
| Capacity of arbitrary wireless networks O Goussevskaia, R Wattenhofer, MM Halldórsson, E Welzl IEEE INFOCOM 2009, 1872-1880, 2009 | 311 | 2009 |
| Approximating the domatic number U Feige, MM Halldórsson, G Kortsarz, A Srinivasan SIAM Journal on computing 32 (1), 172-195, 2002 | 276 | 2002 |
| 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 | 240 | 1998 |
| Approximating Discrete Collections via Local Improvements. MM Halldórsson SODA 95, 160-169, 1995 | 236 | 1995 |
| Scheduling split intervals R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira SIAM Journal on Computing 36 (1), 1-15, 2006 | 221 | 2006 |
| Coloring powers of planar graphs G Agnarsson, MM Halldórsson SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003 | 218 | 2003 |
| Greedy local improvement and weighted set packing approximation B Chandra, MM Halldórsson Journal of Algorithms 39 (2), 223-240, 2001 | 211 | 2001 |
| Approximations of weighted independent set and hereditary subset problems MM Halldórsson Graph Algorithms And Applications 2, 3-18, 2004 | 198 | 2004 |
| 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 | 188 | 2004 |
| Approximating the minimum maximal independence number MM Halldórsson Information Processing Letters 46 (4), 169-172, 1993 | 169 | 1993 |
| Wireless Communication is in APX MM Halldórsson, R Wattenhofer International Colloquium on Automata, Languages, and Programming, 525-536, 2009 | 155 | 2009 |
| 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 | 139 | 2011 |
| Wireless scheduling with power control MM Halldórsson ACM Transactions on Algorithms (TALG) 9 (1), 1-20, 2012 | 133 | 2012 |
| Lower bounds for on-line graph coloring MM Halldórsson, M Szegedy Theoretical Computer Science 130 (1), 163-174, 1994 | 132 | 1994 |
| On the approximation of largest common subtrees and largest common point sets T Akutsu, MM Halldórsson Theoretical Computer Science 233 (1-2), 33-50, 2000 | 121 | 2000 |
| Approximation algorithms for dispersion problems B Chandra, MM Halldórsson Journal of algorithms 38 (2), 438-465, 2001 | 116 | 2001 |
Guy KortsarzProfessor computer scienceVerified email at camden.rutgers.edu
