Guy Kortsarz

207 papers A* 25A 9B 22C 2Misc 1Journal 117Unranked 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
A 4/3 ratio approximation algorithm for the Tree Augmentation Problem by deferred local-ratio and climbing.
CoRR
Guy Kortsarz
2026 J jnl
The Telephone k-Multicast Problem.
Algorithmica
Daniel Hathcock, Guy Kortsarz, R. Ravi
2025 — conf
A Logarithmic Approximation Algorithm for the Activation Edge-Multicover Problem.
ALGOWIN
Zeev Nutov, Avner Huri, Guy Kortsarz
2024 B conf
Approximations and Hardness of Covering and Packing Partially Ordered Items.
WG
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024 J jnl
Approximations and Hardness of Packing Partially Ordered Items.
CoRR
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024 A conf
Degrees and Network Design: New Problems and Approximations.
APPROX/RANDOM
Michael Dinitz, Guy Kortsarz, Shi Li
2024 J jnl
The Telephone
CoRR
Daniel Hathcock, Guy Kortsarz, R. Ravi
2024 A conf
The Telephone k-Multicast Problem.
APPROX/RANDOM
Daniel Hathcock, Guy Kortsarz, R. Ravi
2023 J jnl
Degrees and Network Design: New Problems and Approximations.
CoRR
Michael Dinitz, Guy Kortsarz, Shi Li
2023 B conf
Improved Approximations for Relative Survivable Network Design.
WAOA
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
2023 J jnl
Improved Approximations for Relative Survivable Network Design.
CoRR
Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov
2022 J jnl
Approximating activation edge-cover and facility location problems.
Theor. Comput. Sci.
Guy Kortsarz, Zeev Nutov, Eli Shalom
2022 J jnl
On Approximating Degree-Bounded Network Design Problems.
Algorithmica
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
2022 A conf
Relative Survivable Network Design.
APPROX/RANDOM
Michael Dinitz, Ama Koranteng, Guy Kortsarz
2022 J jnl
Relative Survivable Network Design.
CoRR
Michael Dinitz, Ama Koranteng, Guy Kortsarz
2022 J jnl
The minimum degree Group Steiner problem.
Discret. Appl. Math.
Guy Kortsarz, Zeev Nutov
2021 J jnl
Network Design under General Wireless Interference.
Algorithmica
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2020 J jnl
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds.
ACM Trans. Algorithms
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
2020 J jnl
Approximation algorithms for connected maximum cut and related problems.
Theor. Comput. Sci.
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2020 C conf
Bounded Degree Group Steiner Tree Problems.
IWOCA
Guy Kortsarz, Zeev Nutov
2020 J jnl
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More.
SIAM J. Comput.
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
2020 — conf
On Approximating Degree-Bounded Network Design Problems.
APPROX-RANDOM
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
2020 J jnl
Radio aggregation scheduling.
Theor. Comput. Sci.
Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
2020 B conf
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems.
WAOA
Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan
2020 J jnl
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems.
CoRR
Marek Cygan, Magnús M. Halldórsson, Guy Kortsarz
2019 B conf
Approximating Activation Edge-Cover and Facility Location Problems.
MFCS
Zeev Nutov, Guy Kortsarz, Eli Shalom
2019 J jnl
Bounded Degree Group Steiner Tree Problems.
CoRR
Guy Kortsarz, Zeev Nutov
2019 J jnl
Improved approximation algorithms for minimum power covering problems.
Theor. Comput. Sci.
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
2018 J jnl
A bounded-risk mechanism for the kidney exchange game.
Discret. Appl. Math.
Hossein Esfandiari, Guy Kortsarz
2018 — ch.
Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent Jobs.
Handbook of Approximation Algorithms and Metaheuristics (1)
Magnús M. Halldórsson, Guy Kortsarz
2018 B conf
Improved Approximation Algorithms for Minimum Power Covering Problems.
WAOA
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
2018 J jnl
LP-relaxations for tree augmentation.
Discret. Appl. Math.
Guy Kortsarz, Zeev Nutov
2018 J jnl
On maximum leaf trees and connections to connected maximum cut problems.
Inf. Process. Lett.
Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar
2018 J jnl
On subexponential running times for approximating directed Steiner tree and related problems.
CoRR
Marek Cygan, Guy Kortsarz, Bundit Laekhanukit
2018 A* conf
Spanning Trees With Edge Conflicts and Wireless Connectivity.
ICALP
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2018 J jnl
Spanning Trees With Edge Conflicts and Wireless Connectivity.
CoRR
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan
2018 J jnl
The Densest k-Subhypergraph Problem.
SIAM J. Discret. Math.
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
2017 J jnl
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.
Algorithmica
Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
2017 A* conf
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds.
SODA
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
2017 J jnl
Approximating source location and star survivable network problems.
Theor. Comput. Sci.
Guy Kortsarz, Zeev Nutov
2017 J jnl
Bi-Covering: Covering Edges with Two Small Subsets of Vertices.
SIAM J. Discret. Math.
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2017 A* conf
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.
FOCS
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
2017 J jnl
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.
CoRR
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
2017 J jnl
Improved Approximation Algorithm for Steiner
ACM Trans. Algorithms
Michael Dinitz, Guy Kortsarz, Zeev Nutov
2016 B conf
A Bounded-Risk Mechanism for the Kidney Exchange Game.
LATIN
Hossein Esfandiari, Guy Kortsarz
2016 J jnl
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.
ACM Trans. Algorithms
Guy Kortsarz, Zeev Nutov
2016 J jnl
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds.
CoRR
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
2016 J jnl
Approximation Algorithms for Movement Repairmen.
ACM Trans. Algorithms
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz
2016 A* conf
Bicovering: Covering Edges With Two Small Subsets of Vertices.
ICALP
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2016 J jnl
Bicovering: Covering edges with two small subsets of vertices.
Electron. Colloquium Comput. Complex.
Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz
2016 — ch.
Fixed-Parameter Approximability and Hardness.
Encyclopedia of Algorithms
Guy Kortsarz
2016 — conf
LP-Relaxations for Tree Augmentation.
APPROX-RANDOM
Guy Kortsarz, Zeev Nutov
2016 J jnl
Label Cover Instances with Large Girth and the Hardness of Approximating Basic
ACM Trans. Algorithms
Michael Dinitz, Guy Kortsarz, Ran Raz
2016 J jnl
On Fixed Cost k-Flow Problems.
Theory Comput. Syst.
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2016 — conf
The Densest k-Subhypergraph Problem.
APPROX-RANDOM
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
2016 J jnl
The Densest k-Subhypergraph Problem.
CoRR
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
2015 J jnl
A 1.75 LP approximation for the Tree Augmentation Problem.
CoRR
Guy Kortsarz, Zeev Nutov
2015 J jnl
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands.
CoRR
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
2015 J jnl
A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
CoRR
Guy Kortsarz, Zeev Nutov
2015 B conf
Approximating Source Location and Star Survivable Network Problems.
WG
Guy Kortsarz, Zeev Nutov
2015 A conf
Approximation Algorithms for Connected Maximum Cut and Related Problems.
ESA
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2015 J jnl
Approximation Algorithms for Connected Maximum Cut and Related Problems.
CoRR
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2015 B conf
Brief Announcement: New Mechanisms for Pairwise Kidney Exchange.
SAGT
Hossein Efsandiari, Guy Kortsarz
2015 J jnl
Low-Risk Mechanisms for the Kidney Exchange Game.
CoRR
Hossein Esfandiari, Guy Kortsarz
2015 J jnl
On set expansion problems and the small set expansion conjecture.
Discret. Appl. Math.
Rajiv Gandhi, Guy Kortsarz
2015 C conf
Radio Aggregation Scheduling.
ALGOSENSORS
Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
2014 B conf
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
IPEC
Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin
2014 — conf
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights.
APPROX-RANDOM
Michael Dinitz, Guy Kortsarz, Zeev Nutov
2014 J jnl
Matroid Secretary for Regular and Decomposable Matroids.
SIAM J. Comput.
Michael Dinitz, Guy Kortsarz
2014 B conf
On Set Expansion Problems and the Small Set Expansion Conjecture.
WG
Rajiv Gandhi, Guy Kortsarz
2014 J jnl
On a Local Protocol for Concurrent File Transfers.
Theory Comput. Syst.
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat
2014 J jnl
On the Advantage of Overlapping Clusters for Minimizing Conductance.
Algorithmica
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni
2013 — conf
Approximation Algorithms for Movement Repairmen.
APPROX-RANDOM
MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz
2013 J jnl
Approximation Algorithms for Movement Repairmen.
CoRR
MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz
2013 J jnl
Corrigendum: Improved results for data migration and open shop scheduling.
ACM Trans. Algorithms
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2013 J jnl
Edge covering with budget constrains.
CoRR
Rajiv Gandhi, Guy Kortsarz
2013 B conf
Fixed-Parameter and Approximation Algorithms: A New Look.
IPEC
Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
2013 J jnl
Fixed-Parameter and Approximation Algorithms: A New Look.
CoRR
Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
2013 A* conf
Matroid Secretary for Regular and Decomposable Matroids.
SODA
Michael Dinitz, Guy Kortsarz
2013 B conf
On Fixed Cost k-Flow Problems.
WAOA
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2013 J jnl
On some network design problems with degree constraints.
J. Comput. Syst. Sci.
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2013 J jnl
Steiner Forest Orientation Problems.
SIAM J. Discret. Math.
Marek Cygan, Guy Kortsarz, Zeev Nutov
2013 J jnl
The Foundations of Fixed Parameter Inapproximability.
CoRR
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2013 J jnl
Two-stage Robust Network Design with Exponential Scenarios.
Algorithmica
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
2012 B conf
Advantage of Overlapping Clusters for Minimizing Conductance.
LATIN
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni
2012 J jnl
Approximating fault-tolerant group-Steiner problems.
Theor. Comput. Sci.
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2012 J jnl
Improved approximation algorithms for Directed Steiner Forest.
J. Comput. Syst. Sci.
Moran Feldman, Guy Kortsarz, Zeev Nutov
2012 — conf
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner.
ICALP (1)
Michael Dinitz, Guy Kortsarz, Ran Raz
2012 J jnl
Label Cover instances with large girth and the hardness of approximating basic k-spanner
CoRR
Michael Dinitz, Guy Kortsarz, Ran Raz
2012 J jnl
Local Search Algorithms for the Red-Blue Median Problem.
Algorithmica
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2012 J jnl
Matroid Secretary for Regular and Decomposable Matroids
CoRR
Michael Dinitz, Guy Kortsarz
2012 J jnl
Prize-collecting steiner network problems.
ACM Trans. Algorithms
Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2012 A conf
Steiner Forest Orientation Problems.
ESA
Marek Cygan, Guy Kortsarz, Zeev Nutov
2012 J jnl
The checkpoint problem.
Theor. Comput. Sci.
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
2011 J jnl
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Inf. Process. Lett.
Guy Even, Guy Kortsarz, Zeev Nutov
2011 J jnl
Approximating Minimum-Power Degree and Connectivity Problems.
Algorithmica
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko
2011 J jnl
Approximating some network design problems with node costs.
Theor. Comput. Sci.
Guy Kortsarz, Zeev Nutov
2011 J jnl
Combinatorial Algorithms for Capacitated Network Design
CoRR
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2011 — conf
Network-Design with Degree Constraints.
APPROX-RANDOM
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2011 B conf
On a local protocol for concurrent file transfers.
SPAA
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat
2011 J jnl
Steiner Forest Orientation Problems
CoRR
Marek Cygan, Guy Kortsarz, Zeev Nutov
2011 J jnl
Sum edge coloring of multigraphs via configuration LP.
ACM Trans. Algorithms
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2010 J jnl
Approximating Maximum Subgraphs without Short Cycles.
SIAM J. Discret. Math.
Guy Kortsarz, Michael Langberg, Zeev Nutov
2010 J jnl
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.
SIAM J. Comput.
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2010 — conf
Budgeted Red-Blue Median and Its Generalizations.
ESA (1)
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz
2010 B conf
Prize-Collecting Steiner Network Problems.
IPCO
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2010 — conf
The Checkpoint Problem.
APPROX-RANDOM
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre
2009 J jnl
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Trans. Algorithms
Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
2009 J jnl
Approximating Buy-at-Bulk and Shallow-Light
Algorithmica
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2009 — conf
Approximating Fault-Tolerant Group-Steiner Problems.
FSTTCS
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
2009 — conf
Approximating Some Network Design Problems with Node Costs.
APPROX-RANDOM
Guy Kortsarz, Zeev Nutov
2009 — conf
Approximating minimum cost connectivity problems.
Parameterized complexity and approximation algorithms
Guy Kortsarz, Zeev Nutov
2009 J jnl
Approximating minimum-power edge-covers and 2, 3-connectivity.
Discret. Appl. Math.
Guy Kortsarz, Zeev Nutov
2009 A* conf
Improved approximating algorithms for Directed Steiner Forest.
SODA
Moran Feldman, Guy Kortsarz, Zeev Nutov
2008 J jnl
A note on two source location problems.
J. Discrete Algorithms
Guy Kortsarz, Zeev Nutov
2008 — conf
Approximating Maximum Subgraphs without Short Cycles.
APPROX-RANDOM
Guy Kortsarz, Michael Langberg, Zeev Nutov
2008 B conf
Approximating Minimum-Power Degree and Connectivity Problems.
LATIN
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko
2008 J jnl
Improved bounds for scheduling conflicting jobs with minsum criteria.
ACM Trans. Algorithms
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2008 B conf
Min Sum Edge Coloring in Multigraphs Via Configuration LP.
IPCO
Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko
2008 J jnl
Tight approximation algorithm for connectivity augmentation problems.
J. Comput. Syst. Sci.
Guy Kortsarz, Zeev Nutov
2008 A conf
Two-Stage Robust Network Design with Exponential Scenarios.
ESA
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
2007 J jnl
A Lower Bound for Approximating Grundy Numbering.
Discret. Math. Theor. Comput. Sci.
Guy Kortsarz
2007 J jnl
An Improved Approximation of the Achromatic Number on Bipartite Graphs.
SIAM J. Discret. Math.
Guy Kortsarz, Sunil M. Shende
2007 J jnl
An improved algorithm for radio broadcast.
ACM Trans. Algorithms
Michael Elkin, Guy Kortsarz
2007 — ch.
Approximating Minimum-Cost Connectivity Problems.
Handbook of Approximation Algorithms and Metaheuristics
Guy Kortsarz, Zeev Nutov
2007 A* conf
Approximation algorithms for node-weighted buy-at-bulk network design.
SODA
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2007 J jnl
Complete partitions of graphs.
Comb.
Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2007 J jnl
Improved approximation algorithms for directed Steiner forest.
Electron. Colloquium Comput. Complex.
Moran Feldman, Guy Kortsarz, Zeev Nutov
2007 J jnl
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.
SIAM J. Comput.
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
2007 J jnl
Power optimization for connectivity problems.
Math. Program.
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
2007 J jnl
The minimum shift design problem.
Ann. Oper. Res.
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
2006 J jnl
A greedy approximation algorithm for the group Steiner problem.
Discret. Appl. Math.
Chandra Chekuri, Guy Even, Guy Kortsarz
2006 J jnl
An Approximation Algorithm for the Directed Telephone Multicast Problem.
Algorithmica
Michael Elkin, Guy Kortsarz
2006 J jnl
An improved approximation algorithm for vertex cover with hard capacities.
J. Comput. Syst. Sci.
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
2006 — conf
Approximating Buy-at-Bulk and Shallow-Light
APPROX-RANDOM
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2006 J jnl
Approximating Buy-at-Bulk k-Steiner trees
Electron. Colloquium Comput. Complex.
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2006 J jnl
Approximating the Minimal Sensor Selection for Supervisory Control.
Discret. Event Dyn. Syst.
Kurt Rohloff, Samir Khuller, Guy Kortsarz
2006 A* conf
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.
FOCS
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2006 J jnl
Improved results for data migration and open shop scheduling.
ACM Trans. Algorithms
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2006 J jnl
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk
Electron. Colloquium Comput. Complex.
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2006 J jnl
Sublogarithmic approximation for telephone multicast.
J. Comput. Syst. Sci.
Michael Elkin, Guy Kortsarz
2006 — conf
Tight Approximation Algorithm for Connectivity Augmentation Problems.
ICALP (1)
Guy Kortsarz, Zeev Nutov
2005 J jnl
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem.
SIAM J. Comput.
Michael Elkin, Guy Kortsarz
2005 J jnl
Approximating
SIAM J. Comput.
Guy Kortsarz, Zeev Nutov
2005 J jnl
Asymmetric
J. ACM
Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
2005 A* conf
Complete partitions of graphs.
SODA
Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2005 J jnl
Greedy approximation algorithms for directed multicuts.
Networks
Yana Kortsarts, Guy Kortsarz, Zeev Nutov
2005 A* conf
Improved schedule for radio broadcast.
SODA
Michael Elkin, Guy Kortsarz
2005 J jnl
On network design problems: fixed cost flows and the covering steiner problem.
ACM Trans. Algorithms
Guy Even, Guy Kortsarz, Wolfgang Slany
2005 J jnl
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem.
SIAM J. Discret. Math.
Michael Elkin, Guy Kortsarz
2005 B conf
Power Optimization for Connectivity Problems.
IPCO
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
2004 B conf
Approximation Algorithm for Directed Multicuts.
WAOA
Yana Kortsarts, Guy Kortsarz, Zeev Nutov
2004 A* conf
Approximation algorithm for k-node connected subgraphs via critical graphs.
STOC
Guy Kortsarz, Zeev Nutov
2004 A* conf
Asymmetric k-center is log
STOC
Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
2004 J jnl
Hardness of Approximation for Vertex-Connectivity Network Design Problems.
SIAM J. Comput.
Guy Kortsarz, Robert Krauthgamer, James R. Lee
2004 B conf
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.
WAOA
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004 A* conf
Improved Results for Data Migration and Open Shop Scheduling.
ICALP
Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2004 J jnl
Logarithmic inapproximability of the radio broadcast problem.
J. Algorithms
Michael Elkin, Guy Kortsarz
2004 B conf
Multicoloring: Problems and Techniques.
MFCS
Magnús M. Halldórsson, Guy Kortsarz
2004 — conf
Polylogarithmic Inapproximability of the Radio Broadcast Problem.
APPROX-RANDOM
Michael Elkin, Guy Kortsarz
2003 A* conf
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
ICALP
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
2003 J jnl
Approximating Node Connectivity Problems via Set Covers.
Algorithmica
Guy Kortsarz, Zeev Nutov
2003 A conf
Approximating the Achromatic Number Problem on Bipartite Graphs.
ESA
Guy Kortsarz, Sunil M. Shende
2003 A* conf
Approximation Algorithm for Directed Telephone Multicast Problem.
ICALP
Michael Elkin, Guy Kortsarz
2003 A* conf
Integrality ratio for group Steiner trees and directed steiner trees.
SODA
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
2003 J jnl
Multicoloring trees.
Inf. Comput.
Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
2003 A* conf
Sublogarithmic approximation for telephone multicast: path out of jungle.
SODA
Michael Elkin, Guy Kortsarz
2003 J jnl
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.
Algorithmica
Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2003 A conf
The Minimum Shift Design Problem: Theory and Practice.
ESA
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany
2003 J jnl
Tight lower bounds for the asymmetric k-center problem
Electron. Colloquium Comput. Complex.
Eran Halperin, Guy Kortsarz, Robert Krauthgamer
2002 A* conf
An approximation algorithm for the group Steiner problem.
SODA
Guy Even, Guy Kortsarz
2002 J jnl
Approximating the Domatic Number.
SIAM J. Comput.
Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan
2002 A* conf
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem.
STOC
Michael Elkin, Guy Kortsarz
2002 — conf
Hardness of Approximation for Vertex-Connectivity Network-Design Problems.
APPROX
Guy Kortsarz, Robert Krauthgamer, James R. Lee
2002 — conf
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.
SWAT
Guy Even, Guy Kortsarz, Wolfgang Slany
2002 J jnl
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees.
J. Algorithms
Magnús M. Halldórsson, Guy Kortsarz
2001 — conf
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
Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
2001 J jnl
Generalized submodular cover problems and applications.
Theor. Comput. Sci.
Judit Bar-Ilan, Guy Kortsarz, David Peleg
2001 — conf
Minimizing Average Completion of Dedicated Tasks and Interval Graphs.
RANDOM-APPROX
Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
2001 J jnl
On Approximating the Achromatic Number.
SIAM J. Discret. Math.
Guy Kortsarz, Robert Krauthgamer
2001 A* conf
On approximating the achromatic number.
SODA
Guy Kortsarz, Robert Krauthgamer
2001 J jnl
On the Hardness of Approximating Spanners.
Algorithmica
Guy Kortsarz
2001 J jnl
The Dense
Algorithmica
Uriel Feige, Guy Kortsarz, David Peleg
2000 — conf
Approximating node connectivity problems via set covers.
APPROX
Guy Kortsarz, Zeev Nutov
2000 A* conf
Approximating the domatic number.
STOC
Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz
2000 J jnl
Sum Multicoloring of Graphs.
J. Algorithms
Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
2000 B conf
Tree Spanners for Subgraphs and Related Tree Covering Problems.
WG
Dagmar Handke, Guy Kortsarz
1999 J jnl
A Matched Approximation Bound for the Sum of a Greedy Coloring.
Inf. Process. Lett.
Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz
1999 J jnl
Approximating the Weight of Shallow Steiner Trees.
Discret. Appl. Math.
Guy Kortsarz, David Peleg
1999 Misc conf
Multi-coloring Trees.
COCOON
Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
1999 — conf
Multicoloring Planar Graphs and Partial k-Trees.
RANDOM-APPROX
Magnús M. Halldórsson, Guy Kortsarz
1999 A conf
Sum Multi-coloring of Graphs.
ESA
Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
1998 J jnl
Generating Low-Degree 2-Spanners.
SIAM J. Comput.
Guy Kortsarz, David Peleg
1998 J jnl
Minimum Color Sum of Bipartite Graphs.
J. Algorithms
Amotz Bar-Noy, Guy Kortsarz
1998 — conf
On the Hardness of Approximation Spanners.
APPROX
Guy Kortsarz
1997 A* conf
Approximating Shallow-Light Trees (Extended Abstract).
SODA
Guy Kortsarz, David Peleg
1997 A* conf
The Minimum Color Sum of Bipartite Graphs.
ICALP
Amotz Bar-Noy, Guy Kortsarz
1996 — conf
Generalized Submodular Cover Problems and Applications.
ISTCS
Judit Bar-Ilan, Guy Kortsarz, David Peleg
1995 J jnl
Approximation Algorithms for Minimum-Time Broadcast.
SIAM J. Discret. Math.
Guy Kortsarz, David Peleg
1994 A* conf
Generating Low-Degree 2-Spanners.
SODA
Guy Kortsarz, David Peleg
1994 J jnl
Generating Sparse 2-Spanners.
J. Algorithms
Guy Kortsarz, David Peleg
1994 J jnl
Traffic-light scheduling on the grid.
Discret. Appl. Math.
Guy Kortsarz, David Peleg
1993 J jnl
How to Allocate Network Centers.
J. Algorithms
Judit Bar-Ilan, Guy Kortsarz, David Peleg
1993 A* conf
On Choosing a Dense Subgraph (Extended Abstract)
FOCS
Guy Kortsarz, David Peleg
1992 — conf
Approximation Algorithms for Minimum Time Broadcast.
ISTCS
Guy Kortsarz, David Peleg
1992 — conf
Generating Sparse 2-spanners.
SWAT
Guy Kortsarz, David Peleg
1992 — conf
Traffic-Light Scheduling on the Grid (Extended Abstract).
WDAG
Guy Kortsarz, David Peleg