default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Kortsarz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c84]Michael Dinitz, Guy Kortsarz, Shi Li:
Degrees and Network Design: New Problems and Approximations. APPROX/RANDOM 2024: 3:1-3:17- [c83]Daniel Hathcock, Guy Kortsarz, R. Ravi:
The Telephone k-Multicast Problem. APPROX/RANDOM 2024: 21:1-21:16 - [i31]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - [i30]Daniel Hathcock, Guy Kortsarz, R. Ravi:
The Telephone k-Multicast Problem. CoRR abs/2410.01048 (2024) - 2023
- [c82]Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
Improved Approximations for Relative Survivable Network Design. WAOA 2023: 190-204 - [i29]Michael Dinitz, Guy Kortsarz, Shi Li:
Degrees and Network Design: New Problems and Approximations. CoRR abs/2302.11475 (2023) - [i28]Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov:
Improved Approximations for Relative Survivable Network Design. CoRR abs/2304.06656 (2023) - 2022
- [j85]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84(5): 1252-1278 (2022) - [j84]Guy Kortsarz, Zeev Nutov:
The minimum degree Group Steiner problem. Discret. Appl. Math. 309: 229-239 (2022) - [j83]Guy Kortsarz, Zeev Nutov, Eli Shalom:
Approximating activation edge-cover and facility location problems. Theor. Comput. Sci. 930: 218-228 (2022) - [c81]Michael Dinitz, Ama Koranteng, Guy Kortsarz:
Relative Survivable Network Design. APPROX/RANDOM 2022: 41:1-41:19 - [i27]Michael Dinitz, Ama Koranteng, Guy Kortsarz:
Relative Survivable Network Design. CoRR abs/2206.12245 (2022) - 2021
- [j82]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
:
Network Design under General Wireless Interference. Algorithmica 83(11): 3469-3490 (2021) - 2020
- [j81]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49(4): 772-810 (2020) - [j80]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16(3): 33:1-33:31 (2020) - [j79]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814: 74-85 (2020) - [j78]Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio aggregation scheduling. Theor. Comput. Sci. 840: 143-153 (2020) - [c80]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM 2020: 39:1-39:21 - [c79]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. IWOCA 2020: 343-354 - [c78]Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. WAOA 2020: 159-173 - [i26]Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz:
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. CoRR abs/2008.05374 (2020)
2010 – 2019
- 2019
- [j77]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795: 285-300 (2019) - [c77]Zeev Nutov, Guy Kortsarz, Eli Shalom:
Approximating Activation Edge-Cover and Facility Location Problems. MFCS 2019: 20:1-20:14 - [i25]Guy Kortsarz, Zeev Nutov:
Bounded Degree Group Steiner Tree Problems. CoRR abs/1910.12848 (2019) - 2018
- [j76]Guy Kortsarz, Zeev Nutov:
LP-relaxations for tree augmentation. Discret. Appl. Math. 239: 94-105 (2018) - [j75]Hossein Esfandiari, Guy Kortsarz:
A bounded-risk mechanism for the kidney exchange game. Discret. Appl. Math. 243: 46-53 (2018) - [j74]Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar:
On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. 129: 31-34 (2018) - [j73]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32(2): 1458-1477 (2018) - [c76]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan:
Spanning Trees With Edge Conflicts and Wireless Connectivity. ICALP 2018: 158:1-158:15 - [c75]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA 2018: 134-148 - [p1]Magnús M. Halldórsson, Guy Kortsarz:
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 671-684 - [i24]Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan:
Spanning Trees With Edge Conflicts and Wireless Connectivity. CoRR abs/1803.04578 (2018) - [i23]Marek Cygan, Guy Kortsarz, Bundit Laekhanukit:
On subexponential running times for approximating directed Steiner tree and related problems. CoRR abs/1811.00710 (2018) - 2017
- [j72]Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77(4): 1216-1239 (2017) - [j71]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31(4): 2626-2646 (2017) - [j70]Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. ACM Trans. Algorithms 13(3): 40:1-40:16 (2017) - [j69]Guy Kortsarz, Zeev Nutov:
Approximating source location and star survivable network problems. Theor. Comput. Sci. 674: 32-42 (2017) - [c74]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS 2017: 743-754 - [c73]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA 2017: 534-553 - [i22]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR abs/1708.04218 (2017) - 2016
- [j68]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58(1): 4-18 (2016) - [j67]Guy Kortsarz, Zeev Nutov:
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. ACM Trans. Algorithms 12(2): 23:1-23:20 (2016) - [j66]Michael Dinitz, Guy Kortsarz, Ran Raz:
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. ACM Trans. Algorithms 12(2): 25:1-25:16 (2016) - [j65]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12(4): 54:1-54:38 (2016) - [c72]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. APPROX-RANDOM 2016: 6:1-6:19 - [c71]Guy Kortsarz, Zeev Nutov:
LP-Relaxations for Tree Augmentation. APPROX-RANDOM 2016: 13:1-13:16 - [c70]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP 2016: 6:1-6:12 - [c69]Hossein Esfandiari, Guy Kortsarz:
A Bounded-Risk Mechanism for the Kidney Exchange Game. LATIN 2016: 416-428 - [r2]Guy Kortsarz:
Fixed-Parameter Approximability and Hardness. Encyclopedia of Algorithms 2016: 756-761 - [i21]Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. CoRR abs/1605.04284 (2016) - [i20]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR abs/1607.06068 (2016) - [i19]Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j64]Rajiv Gandhi, Guy Kortsarz:
On set expansion problems and the small set expansion conjecture. Discret. Appl. Math. 194: 93-101 (2015) - [c68]Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh:
Radio Aggregation Scheduling. ALGOSENSORS 2015: 169-182 - [c67]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. ESA 2015: 693-704 - [c66]Hossein Efsandiari, Guy Kortsarz:
Brief Announcement: New Mechanisms for Pairwise Kidney Exchange. SAGT 2015: 303-304 - [c65]Guy Kortsarz, Zeev Nutov:
Approximating Source Location and Star Survivable Network Problems. WG 2015: 203-218 - [i18]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR abs/1506.03760 (2015) - [i17]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. CoRR abs/1507.00648 (2015) - [i16]Hossein Esfandiari, Guy Kortsarz:
Low-Risk Mechanisms for the Kidney Exchange Game. CoRR abs/1507.02746 (2015) - [i15]Guy Kortsarz, Zeev Nutov:
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. CoRR abs/1507.02799 (2015) - [i14]Guy Kortsarz, Zeev Nutov:
A 1.75 LP approximation for the Tree Augmentation Problem. CoRR abs/1507.03009 (2015) - 2014
- [j63]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
On the Advantage of Overlapping Clusters for Minimizing Conductance. Algorithmica 69(4): 844-863 (2014) - [j62]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a Local Protocol for Concurrent File Transfers. Theory Comput. Syst. 55(3): 613-636 (2014) - [j61]Michael Dinitz, Guy Kortsarz:
Matroid Secretary for Regular and Decomposable Matroids. SIAM J. Comput. 43(5): 1807-1830 (2014) - [c64]Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. APPROX-RANDOM 2014: 115-127 - [c63]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC 2014: 159-171 - [c62]Rajiv Gandhi, Guy Kortsarz:
On Set Expansion Problems and the Small Set Expansion Conjecture. WG 2014: 189-200 - 2013
- [j60]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013) - [j59]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On some network design problems with degree constraints. J. Comput. Syst. Sci. 79(5): 725-736 (2013) - [j58]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. SIAM J. Discret. Math. 27(3): 1503-1513 (2013) - [j57]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4): 34:1-34:7 (2013) - [c61]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. APPROX-RANDOM 2013: 218-232 - [c60]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. IPEC 2013: 110-122 - [c59]Michael Dinitz, Guy Kortsarz:
Matroid Secretary for Regular and Decomposable Matroids. SODA 2013: 108-117 - [c58]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. WAOA 2013: 49-60 - [i13]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. CoRR abs/1306.3739 (2013) - [i12]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. CoRR abs/1308.3520 (2013) - [i11]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
The Foundations of Fixed Parameter Inapproximability. CoRR abs/1310.2711 (2013) - [i10]Rajiv Gandhi, Guy Kortsarz:
Edge covering with budget constrains. CoRR abs/1311.0713 (2013) - 2012
- [j56]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012) - [j55]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for Directed Steiner Forest. J. Comput. Syst. Sci. 78(1): 279-292 (2012) - [j54]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-collecting steiner network problems. ACM Trans. Algorithms 9(1): 2:1-2:13 (2012) - [j53]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416: 55-64 (2012) - [j52]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012) - [c57]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. ESA 2012: 361-372 - [c56]Michael Dinitz, Guy Kortsarz, Ran Raz:
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. ICALP (1) 2012: 290-301 - [c55]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505 - [i9]Michael Dinitz, Guy Kortsarz, Ran Raz:
Label Cover instances with large girth and the hardness of approximating basic k-spanner. CoRR abs/1203.0224 (2012) - [i8]Michael Dinitz, Guy Kortsarz:
Matroid Secretary for Regular and Decomposable Matroids. CoRR abs/1207.5146 (2012) - 2011
- [j51]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. Algorithmica 60(4): 735-742 (2011) - [j50]Guy Even, Guy Kortsarz, Zeev Nutov:
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Inf. Process. Lett. 111(6): 296-300 (2011) - [j49]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2): 22:1-22:21 (2011) - [j48]Guy Kortsarz, Zeev Nutov:
Approximating some network design problems with node costs. Theor. Comput. Sci. 412(35): 4482-4492 (2011) - [c54]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301 - [c53]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. SPAA 2011: 269-278 - [i7]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) - [i6]Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. CoRR abs/1112.2273 (2011) - 2010
- [j47]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010) - [j46]Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. SIAM J. Discret. Math. 24(1): 255-269 (2010) - [c52]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The Checkpoint Problem. APPROX-RANDOM 2010: 219-231 - [c51]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325 - [c50]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84
2000 – 2009
- 2009
- [j45]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) - [j44]Guy Kortsarz, Zeev Nutov:
Approximating minimum-power edge-covers and 2, 3-connectivity. Discret. Appl. Math. 157(8): 1840-1847 (2009) - [j43]Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov:
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 5(2): 21:1-21:17 (2009) - [c49]Guy Kortsarz, Zeev Nutov:
Approximating Some Network Design Problems with Node Costs. APPROX-RANDOM 2009: 231-243 - [c48]Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274 - [c47]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximating algorithms for Directed Steiner Forest. SODA 2009: 922-931 - [i5]Guy Kortsarz, Zeev Nutov:
Approximating minimum cost connectivity problems. Parameterized complexity and approximation algorithms 2009 - 2008
- [j42]Guy Kortsarz, Zeev Nutov:
Tight approximation algorithm for connectivity augmentation problems. J. Comput. Syst. Sci. 74(5): 662-670 (2008) - [j41]Guy Kortsarz, Zeev Nutov:
A note on two source location problems. J. Discrete Algorithms 6(3): 520-525 (2008) - [j40]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008) - [c46]Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. APPROX-RANDOM 2008: 118-131 - [c45]Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600 - [c44]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Min Sum Edge Coloring in Multigraphs Via Configuration LP. IPCO 2008: 359-373 - [c43]Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko:
Approximating Minimum-Power Degree and Connectivity Problems. LATIN 2008: 423-435 - 2007
- [j39]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The minimum shift design problem. Ann. Oper. Res. 155(1): 79-105 (2007) - [j38]Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
Complete partitions of graphs. Comb. 27(5): 519-550 (2007) - [j37]Guy Kortsarz:
A Lower Bound for Approximating Grundy Numbering. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [j36]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) - [j35]Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang:
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. SIAM J. Comput. 36(5): 1494-1511 (2007) - [j34]Guy Kortsarz, Sunil M. Shende:
An Improved Approximation of the Achromatic Number on Bipartite Graphs. SIAM J. Discret. Math. 21(2): 361-373 (2007) - [j33]Michael Elkin, Guy Kortsarz:
An improved algorithm for radio broadcast. ACM Trans. Algorithms 3(1): 8:1-8:21 (2007) - [c42]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 - [r1]Guy Kortsarz, Zeev Nutov:
Approximating Minimum-Cost Connectivity Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i4]Moran Feldman, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for directed Steiner forest. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j32]Michael Elkin, Guy Kortsarz:
An Approximation Algorithm for the Directed Telephone Multicast Problem. Algorithmica 45(4): 569-583 (2006) - [j31]Chandra Chekuri, Guy Even, Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem. Discret. Appl. Math. 154(1): 15-34 (2006) - [j30]Kurt Rohloff, Samir Khuller, Guy Kortsarz:
Approximating the Minimal Sensor Selection for Supervisory Control. Discret. Event Dyn. Syst. 16(1): 143-170 (2006) - [j29]Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72(1): 16-33 (2006) - [j28]Michael Elkin, Guy Kortsarz:
Sublogarithmic approximation for telephone multicast. J. Comput. Syst. Sci. 72(4): 648-659 (2006) - [j27]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 2(1): 116-129 (2006) - [c41]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163 - [c40]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 - [c39]Guy Kortsarz, Zeev Nutov:
Tight Approximation Algorithm for Connectivity Augmentation Problems. ICALP (1) 2006: 443-452 - [i3]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk k-Steiner trees. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j26]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005) - [j25]Yana Kortsarts, Guy Kortsarz, Zeev Nutov:
Greedy approximation algorithms for directed multicuts. Networks 45(4): 214-217 (2005) - [j24]Guy Kortsarz, Zeev Nutov:
Approximating k-node Connected Subgraphs via Critical Graphs. SIAM J. Comput. 35(1): 247-257 (2005) - [j23]Michael Elkin, Guy Kortsarz:
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem. SIAM J. Comput. 35(3): 672-689 (2005) - [j22]Michael Elkin, Guy Kortsarz:
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. SIAM J. Discret. Math. 19(4): 881-899 (2005) - [j21]Guy Even, Guy Kortsarz, Wolfgang Slany:
On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms 1(1): 74-101 (2005) - [c38]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power Optimization for Connectivity Problems. IPCO 2005: 349-361 - [c37]Michael Elkin, Guy Kortsarz:
Improved schedule for radio broadcast. SODA 2005: 222-231 - [c36]Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian:
Complete partitions of graphs. SODA 2005: 860-869 - 2004
- [j20]Michael Elkin, Guy Kortsarz:
Logarithmic inapproximability of the radio broadcast problem. J. Algorithms 52(1): 8-25 (2004) - [j19]Guy Kortsarz, Robert Krauthgamer, James R. Lee:
Hardness of Approximation for Vertex-Connectivity Network Design Problems. SIAM J. Comput. 33(3): 704-720 (2004) - [c35]Michael Elkin, Guy Kortsarz:
Polylogarithmic Inapproximability of the Radio Broadcast Problem. APPROX-RANDOM 2004: 105-116 - [c34]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Results for Data Migration and Open Shop Scheduling. ICALP 2004: 658-669 - [c33]Magnús M. Halldórsson, Guy Kortsarz:
Multicoloring: Problems and Techniques. MFCS 2004: 25-41 - [c32]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. STOC 2004: 21-27 - [c31]Guy Kortsarz, Zeev Nutov:
Approximation algorithm for k-node connected subgraphs via critical graphs. STOC 2004: 138-145 - [c30]Yana Kortsarts, Guy Kortsarz, Zeev Nutov:
Approximation Algorithm for Directed Multicuts. WAOA 2004: 61-67 - [c29]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. WAOA 2004: 68-82 - 2003
- [j18]Guy Kortsarz, Zeev Nutov:
Approximating Node Connectivity Problems via Set Covers. Algorithmica 37(2): 75-92 (2003) - [j17]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. Algorithmica 37(3): 187-209 (2003) - [j16]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multicoloring trees. Inf. Comput. 180(2): 113-129 (2003) - [c28]Guy Kortsarz, Sunil M. Shende:
Approximating the Achromatic Number Problem on Bipartite Graphs. ESA 2003: 385-396 - [c27]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604 - [c26]Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175 - [c25]Michael Elkin, Guy Kortsarz:
Approximation Algorithm for Directed Telephone Multicast Problem. ICALP 2003: 212-223 - [c24]Michael Elkin, Guy Kortsarz:
Sublogarithmic approximation for telephone multicast: path out of jungle. SODA 2003: 76-85 - [c23]Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang:
Integrality ratio for group Steiner trees and directed steiner trees. SODA 2003: 275-284 - [i1]Eran Halperin, Guy Kortsarz, Robert Krauthgamer:
Tight lower bounds for the asymmetric k-center problem. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j15]Magnús M. Halldórsson, Guy Kortsarz:
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. J. Algorithms 42(2): 334-366 (2002) - [j14]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan:
Approximating the Domatic Number. SIAM J. Comput. 32(1): 172-195 (2002) - [c22]Guy Kortsarz, Robert Krauthgamer, James R. Lee:
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. APPROX 2002: 185-199 - [c21]Guy Even, Guy Kortsarz:
An approximation algorithm for the group Steiner problem. SODA 2002: 49-58 - [c20]Michael Elkin, Guy Kortsarz:
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. STOC 2002: 438-447 - [c19]Guy Even, Guy Kortsarz, Wolfgang Slany:
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. SWAT 2002: 318-327 - 2001
- [j13]Uriel Feige, Guy Kortsarz, David Peleg:
The Dense k-Subgraph Problem. Algorithmica 29(3): 410-421 (2001) - [j12]Guy Kortsarz:
On the Hardness of Approximating Spanners. Algorithmica 30(3): 432-450 (2001) - [j11]Guy Kortsarz, Robert Krauthgamer:
On Approximating the Achromatic Number. SIAM J. Discret. Math. 14(3): 408-422 (2001) - [j10]Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized submodular cover problems and applications. Theor. Comput. Sci. 250(1-2): 179-200 (2001) - [c18]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. RANDOM-APPROX 2001: 90-101 - [c17]Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. RANDOM-APPROX 2001: 114-126 - [c16]Guy Kortsarz, Robert Krauthgamer:
On approximating the achromatic number. SODA 2001: 309-318 - 2000
- [j9]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multicoloring of Graphs. J. Algorithms 37(2): 422-450 (2000) - [c15]Guy Kortsarz, Zeev Nutov:
Approximating node connectivity problems via set covers. APPROX 2000: 194-205 - [c14]Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz:
Approximating the domatic number. STOC 2000: 134-143 - [c13]Dagmar Handke, Guy Kortsarz:
Tree Spanners for Subgraphs and Related Tree Covering Problems. WG 2000: 206-217
1990 – 1999
- 1999
- [j8]Guy Kortsarz, David Peleg:
Approximating the Weight of Shallow Steiner Trees. Discret. Appl. Math. 93(2-3): 265-285 (1999) - [j7]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz:
A Matched Approximation Bound for the Sum of a Greedy Coloring. Inf. Process. Lett. 71(3-4): 135-140 (1999) - [c12]Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle:
Multi-coloring Trees. COCOON 1999: 271-280 - [c11]Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multi-coloring of Graphs. ESA 1999: 390-401 - [c10]Magnús M. Halldórsson, Guy Kortsarz:
Multicoloring Planar Graphs and Partial k-Trees. RANDOM-APPROX 1999: 73-84 - 1998
- [j6]Amotz Bar-Noy, Guy Kortsarz:
Minimum Color Sum of Bipartite Graphs. J. Algorithms 28(2): 339-365 (1998) - [j5]Guy Kortsarz, David Peleg:
Generating Low-Degree 2-Spanners. SIAM J. Comput. 27(5): 1438-1456 (1998) - [c9]Guy Kortsarz:
On the Hardness of Approximation Spanners. APPROX 1998: 135-146 - 1997
- [c8]Amotz Bar-Noy, Guy Kortsarz:
The Minimum Color Sum of Bipartite Graphs. ICALP 1997: 738-748 - [c7]Guy Kortsarz, David Peleg:
Approximating Shallow-Light Trees (Extended Abstract). SODA 1997: 103-110 - 1996
- [c6]Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized Submodular Cover Problems and Applications. ISTCS 1996: 110-118 - 1995
- [j4]Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum-Time Broadcast. SIAM J. Discret. Math. 8(3): 401-427 (1995) - 1994
- [j3]Guy Kortsarz, David Peleg:
Traffic-light scheduling on the grid. Discret. Appl. Math. 53(1-3): 211-234 (1994) - [j2]Guy Kortsarz, David Peleg:
Generating Sparse 2-Spanners. J. Algorithms 17(2): 222-236 (1994) - [c5]Guy Kortsarz, David Peleg:
Generating Low-Degree 2-Spanners. SODA 1994: 556-563 - 1993
- [j1]Judit Bar-Ilan, Guy Kortsarz, David Peleg:
How to Allocate Network Centers. J. Algorithms 15(3): 385-415 (1993) - [c4]Guy Kortsarz, David Peleg:
On Choosing a Dense Subgraph (Extended Abstract). FOCS 1993: 692-701 - 1992
- [c3]Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum Time Broadcast. ISTCS 1992: 67-78 - [c2]Guy Kortsarz, David Peleg:
Generating Sparse 2-spanners. SWAT 1992: 73-82 - [c1]Guy Kortsarz, David Peleg:
Traffic-Light Scheduling on the Grid (Extended Abstract). WDAG 1992: 238-252
Coauthor Index
[c82] [i28] [j84] [j83] [c79] [j77] [c77] [i25] [j76] [c75] [j70] [j69] [j68] [j67] [c71] [c65] [i15] [i14] [c64] [j59] [j58] [c58] [j55] [j54] [j53] [c57] [j51] [j50] [j48] [c54] [i7] [i6] [j46] [c50] [j44] [j43] [c49] [c48] [c47] [i5] [j42] [j41] [c46] [c43] [j36] [r1] [i4] [c39] [j25] [j24] [c38] [c31] [c30] [j18] [c18] [c15]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
