| The Dense k -Subgraph Problem U Feige, D Peleg, G Kortsarz Algorithmica 29, 410-421, 2001 | 704 | 2001 |
| Approximating the domatic number U Feige, MM Halldórsson, G Kortsarz Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing …, 2000 | 256 | 2000 |
| How to allocate network centers J Barilan, G Kortsarz, D Peleg Journal of Algorithms 15 (3), 385-415, 1993 | 214 | 1993 |
| On choosing a dense subgraph G Kortsarz, D Peleg Proceedings of 1993 IEEE 34th annual foundations of computer science, 692-701, 1993 | 211 | 1993 |
| Approximating minimum cost connectivity problems G Kortsarz, Z Nutov Dagstuhl Seminar Proceedings, 2010 | 147 | 2010 |
| Generating sparse 2-spanners G Kortsarz, D Peleg Journal of Algorithms 17 (2), 222-236, 1994 | 136 | 1994 |
| Hardness of approximation for vertex-connectivity network design problems G Kortsarz, R Krauthgamer, JR Lee SIAM Journal on Computing 33 (3), 704-720, 2004 | 124 | 2004 |
| On the hardness of approximating spanners G Kortsarz Algorithmica 30, 432-450, 2001 | 122 | 2001 |
| Approximating the weight of shallow Steiner trees G Kortsarz, D Peleg Discrete Applied Mathematics 93 (2-3), 265-285, 1999 | 109 | 1999 |
| Approximation algorithms for nonuniform buy-at-bulk network design C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour SIAM Journal on Computing 39 (5), 1772-1798, 2010 | 99 | 2010 |
| Minimum color sum of bipartite graphs A Bar-Noy, G Kortsarz Journal of Algorithms 28 (2), 339-365, 1998 | 97 | 1998 |
| From gap-eth to fpt-inapproximability: Clique, dominating set, and more P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 96 | 2017 |
| A greedy approximation algorithm for the group Steiner problem C Chekuri, G Even, G Kortsarz Discrete Applied Mathematics 154 (1), 15-34, 2006 | 96 | 2006 |
| Approximation algorithms for minimum-time broadcast G Kortsarz, D Peleg SIAM Journal on Discrete Mathematics 8 (3), 401-427, 1995 | 96 | 1995 |
| Approximating node connectivity problems via set covers G Kortsarz, Z Nutov Algorithmica 37, 75-92, 2003 | 92 | 2003 |
| Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem M Elkin, G Kortsarz Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 92 | 2002 |
| Improved approximation algorithms for directed steiner forest M Feldman, G Kortsarz, Z Nutov Journal of Computer and System Sciences 78 (1), 279-292, 2012 | 87 | 2012 |
| Asymmetric k-center is log* n-hard to approximate J Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ... Journal of the ACM (JACM) 52 (4), 538-551, 2005 | 82 | 2005 |
| Generalized submodular cover problems and applications J Bar-Ilan, G Kortsarz, D Peleg Theoretical Computer Science 250 (1-2), 179-200, 2001 | 79 | 2001 |
| Sublogarithmic approximation for telephone multicast: path out of jungle. M Elkin, G Kortsarz SODA 3, 76-85, 2003 | 78 | 2003 |
