The dense k-subgraph problem U Feige, D Peleg, G Kortsarz Algorithmica 29 (3), 410-421, 2001 | 645 | 2001 |

Approximating thedomatic number U Feige, MM Halldórsson, G Kortsarz, A Srinivasan SIAM Journal on computing 32 (1), 172-195, 2002 | 240 | 2002 |

How to allocate network centers J Barilan, G Kortsarz, D Peleg Journal of Algorithms 15 (3), 385-415, 1993 | 202 | 1993 |

On choosing a dense subgraph G Kortsarz, D Peleg Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 692-701, 1993 | 195 | 1993 |

Approximating Minimum-Cost Connectivity Problems. G Kortsarz, Z Nutov Handbook of Approximation Algorithms and Metaheuristics 9, 12, 2007 | 146 | 2007 |

Generating sparse 2-spanners G Kortsarz, D Peleg Journal of Algorithms 17 (2), 222-236, 1994 | 126 | 1994 |

On the hardness of approximating spanners G Kortsarz Algorithmica 30 (3), 432-450, 2001 | 122 | 2001 |

Hardness of approximation for vertex-connectivity network design problems G Kortsarz, R Krauthgamer, JR Lee SIAM Journal on Computing 33 (3), 704-720, 2004 | 113 | 2004 |

Approximating the weight of shallow Steiner trees G Kortsarz, D Peleg Discrete Applied Mathematics 93 (2-3), 265-285, 1999 | 103 | 1999 |

Minimum color sum of bipartite graphs A Bar-Noy, G Kortsarz Journal of Algorithms 28 (2), 339-365, 1998 | 94 | 1998 |

Approximating node connectivity problems via set covers G Kortsarz, Z Nutov Algorithmica 37 (2), 75-92, 2003 | 91 | 2003 |

Generalized submodular cover problems and applications J Bar-Ilan, G Kortsarz, D Peleg Theoretical Computer Science 250 (1-2), 179-200, 2001 | 91 | 2001 |

A greedy approximation algorithm for the group Steiner problem C Chekuri, G Even, G Kortsarz Discrete Applied Mathematics 154 (1), 15-34, 2006 | 88 | 2006 |

Approximation algorithms for minimum-time broadcast G Kortsarz, D Peleg SIAM Journal on Discrete Mathematics 8 (3), 401-427, 1995 | 86 | 1995 |

Improved approximation algorithms for directed steiner forest M Feldman, G Kortsarz, Z Nutov Journal of Computer and System Sciences 78 (1), 279-292, 2012 | 80 | 2012 |

A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem M Elkin, G Kortsarz SIAM journal on Computing 35 (3), 672-689, 2005 | 79 | 2005 |

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 | 77 | 2017 |

Asymmetric *k*-center is log^{*} *n*-hard to approximateJ Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ... Journal of the ACM (JACM) 52 (4), 538-551, 2005 | 76 | 2005 |

On network design problems: fixed cost flows and the covering steiner problem G Even, G Kortsarz, W Slany ACM Transactions on Algorithms (TALG) 1 (1), 74-101, 2005 | 75 | 2005 |

Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs MM Halldórsson, G Kortsarz, H Shachnai Algorithmica 37 (3), 187-209, 2003 | 71 | 2003 |