The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guy Kortsarz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guy Kortsarz
    On the Hardness of Approximation Spanners. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:135-146 [Conf]
  2. Guy Kortsarz, Robert Krauthgamer, James R. Lee
    Hardness of Approximation for Vertex-Connectivity Network-Design Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:185-199 [Conf]
  3. Guy Kortsarz, Zeev Nutov
    Approximating node connectivity problems via set covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:194-205 [Conf]
  4. Michael Elkin, Guy Kortsarz
    Polylogarithmic Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:105-116 [Conf]
  5. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:152-163 [Conf]
  6. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multi-coloring Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:271-280 [Conf]
  7. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multi-coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:390-401 [Conf]
  8. Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
    The Minimum Shift Design Problem: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:593-604 [Conf]
  9. Guy Kortsarz, Sunil M. Shende
    Approximating the Achromatic Number Problem on Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:385-396 [Conf]
  10. Guy Kortsarz, David Peleg
    On Choosing a Dense Subgraph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:692-701 [Conf]
  11. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:677-686 [Conf]
  12. Amotz Bar-Noy, Guy Kortsarz
    The Minimum Color Sum of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:738-748 [Conf]
  13. Michael Elkin, Guy Kortsarz
    Approximation Algorithm for Directed Telephone Multicast Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:212-223 [Conf]
  14. Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
    An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:164-175 [Conf]
  15. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Results for Data Migration and Open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:658-669 [Conf]
  16. Guy Kortsarz, Zeev Nutov
    Tight Approximation Algorithm for Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:443-452 [Conf]
  17. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:349-361 [Conf]
  18. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized Submodular Cover Problems and Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:110-118 [Conf]
  19. Guy Kortsarz, David Peleg
    Approximation Algorithms for Minimum Time Broadcast. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:67-78 [Conf]
  20. Magnús M. Halldórsson, Guy Kortsarz
    Multicoloring: Problems and Techniques. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:25-41 [Conf]
  21. Magnús M. Halldórsson, Guy Kortsarz
    Multicoloring Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:73-84 [Conf]
  22. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Minimizing Average Completion of Dedicated Tasks and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:114-126 [Conf]
  23. Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
    A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:90-101 [Conf]
  24. Michael Elkin, Guy Kortsarz
    Sublogarithmic approximation for telephone multicast: path out of jungle. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:76-85 [Conf]
  25. Michael Elkin, Guy Kortsarz
    Improved schedule for radio broadcast. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:222-231 [Conf]
  26. Guy Even, Guy Kortsarz
    An approximation algorithm for the group Steiner problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:49-58 [Conf]
  27. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
    Integrality ratio for group Steiner trees and directed steiner trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:275-284 [Conf]
  28. Guy Kortsarz, Robert Krauthgamer
    On approximating the achromatic number. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:309-318 [Conf]
  29. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:556-563 [Conf]
  30. Guy Kortsarz, David Peleg
    Approximating Shallow-Light Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:103-110 [Conf]
  31. Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
    Complete partitions of graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:860-869 [Conf]
  32. Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
    Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:21-27 [Conf]
  33. Michael Elkin, Guy Kortsarz
    Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:438-447 [Conf]
  34. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz
    Approximating the domatic number. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:134-143 [Conf]
  35. Guy Kortsarz, Zeev Nutov
    Approximation algorithm for k-node connected subgraphs via critical graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:138-145 [Conf]
  36. Guy Even, Guy Kortsarz, Wolfgang Slany
    On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:318-327 [Conf]
  37. Guy Kortsarz, David Peleg
    Generating Sparse 2-spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:73-82 [Conf]
  38. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:68-82 [Conf]
  39. Yana Kortsarts, Guy Kortsarz, Zeev Nutov
    Approximation Algorithm for Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:61-67 [Conf]
  40. Guy Kortsarz, David Peleg
    Traffic-Light Scheduling on the Grid (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:238-252 [Conf]
  41. Dagmar Handke, Guy Kortsarz
    Tree Spanners for Subgraphs and Related Tree Covering Problems. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:206-217 [Conf]
  42. Uriel Feige, David Peleg, Guy Kortsarz
    The Dense k-Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:410-421 [Journal]
  43. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:3, pp:187-209 [Journal]
  44. Guy Kortsarz
    On the Hardness of Approximating Spanners. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:432-450 [Journal]
  45. Guy Kortsarz, Zeev Nutov
    Approximating Node Connectivity Problems via Set Covers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:2, pp:75-92 [Journal]
  46. Michael Elkin, Guy Kortsarz
    An Approximation Algorithm for the Directed Telephone Multicast Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:569-583 [Journal]
  47. Chandra Chekuri, Guy Even, Guy Kortsarz
    A greedy approximation algorithm for the group Steiner problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:15-34 [Journal]
  48. Guy Kortsarz, David Peleg
    Traffic-light scheduling on the grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:211-234 [Journal]
  49. Guy Kortsarz, David Peleg
    Approximating the Weight of Shallow Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:265-285 [Journal]
  50. Eran Halperin, Guy Kortsarz, Robert Krauthgamer
    Tight lower bounds for the asymmetric k-center problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:035, pp:- [Journal]
  51. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximating Buy-at-Bulk k-Steiner trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:007, pp:- [Journal]
  52. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:008, pp:- [Journal]
  53. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multicoloring trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:113-129 [Journal]
  54. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz
    A Matched Approximation Bound for the Sum of a Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:135-140 [Journal]
  55. Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
    Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:538-551 [Journal]
  56. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    How to Allocate Network Centers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:3, pp:385-415 [Journal]
  57. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multicoloring of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:422-450 [Journal]
  58. Amotz Bar-Noy, Guy Kortsarz
    Minimum Color Sum of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:339-365 [Journal]
  59. Michael Elkin, Guy Kortsarz
    Logarithmic inapproximability of the radio broadcast problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:8-25 [Journal]
  60. Magnús M. Halldórsson, Guy Kortsarz
    Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:334-366 [Journal]
  61. Guy Kortsarz, David Peleg
    Generating Sparse 2-Spanners. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:222-236 [Journal]
  62. Michael Elkin, Guy Kortsarz
    Sublogarithmic approximation for telephone multicast. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:648-659 [Journal]
  63. Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
    An improved approximation algorithm for vertex cover with hard capacities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:16-33 [Journal]
  64. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power optimization for connectivity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:195-208 [Journal]
  65. Yana Kortsarts, Guy Kortsarz, Zeev Nutov
    Greedy approximation algorithms for directed multicuts. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:214-217 [Journal]
  66. Michael Elkin, Guy Kortsarz
    A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:672-689 [Journal]
  67. Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
    Approximating the Domatic Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:172-195 [Journal]
  68. Guy Kortsarz, Robert Krauthgamer, James R. Lee
    Hardness of Approximation for Vertex-Connectivity Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:704-720 [Journal]
  69. Guy Kortsarz, Zeev Nutov
    Approximating k-node Connected Subgraphs via Critical Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:247-257 [Journal]
  70. Guy Kortsarz, David Peleg
    Generating Low-Degree 2-Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1438-1456 [Journal]
  71. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
    Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1494-1511 [Journal]
  72. Michael Elkin, Guy Kortsarz
    Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:881-899 [Journal]
  73. Guy Kortsarz, Robert Krauthgamer
    On Approximating the Achromatic Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:408-422 [Journal]
  74. Guy Kortsarz, David Peleg
    Approximation Algorithms for Minimum-Time Broadcast. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:3, pp:401-427 [Journal]
  75. Guy Even, Guy Kortsarz, Wolfgang Slany
    On network design problems: fixed cost flows and the covering steiner problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:74-101 [Journal]
  76. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved results for data migration and open shop scheduling. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:116-129 [Journal]
  77. Michael Elkin, Guy Kortsarz
    An improved algorithm for radio broadcast. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  78. Judit Bar-Ilan, Guy Kortsarz, David Peleg
    Generalized submodular cover problems and applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:179-200 [Journal]
  79. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximation algorithms for node-weighted buy-at-bulk network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1265-1274 [Conf]

  80. Approximating Maximum Subgraphs without Short Cycles. [Citation Graph (, )][DBLP]


  81. Approximating Some Network Design Problems with Node Costs. [Citation Graph (, )][DBLP]


  82. The Checkpoint Problem. [Citation Graph (, )][DBLP]


  83. Two-Stage Robust Network Design with Exponential Scenarios. [Citation Graph (, )][DBLP]


  84. Budgeted Red-Blue Median and Its Generalizations. [Citation Graph (, )][DBLP]


  85. Approximating Fault-Tolerant Group-Steiner Problems. [Citation Graph (, )][DBLP]


  86. Min Sum Edge Coloring in Multigraphs Via Configuration LP. [Citation Graph (, )][DBLP]


  87. Prize-Collecting Steiner Network Problems. [Citation Graph (, )][DBLP]


  88. Approximating Minimum-Power Degree and Connectivity Problems. [Citation Graph (, )][DBLP]


  89. Improved approximating algorithms for Directed Steiner Forest. [Citation Graph (, )][DBLP]


  90. Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. [Citation Graph (, )][DBLP]


  91. Complete partitions of graphs. [Citation Graph (, )][DBLP]


  92. Approximating minimum-power edge-covers and 2, 3-connectivity. [Citation Graph (, )][DBLP]


  93. A Lower Bound for Approximating Grundy Numbering. [Citation Graph (, )][DBLP]


  94. Improved approximation algorithms for directed Steiner forest. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002