pith. machine review for the scientific record.
sign in

Guy Kortsarz

Identifiers

No identifiers captured yet.

Papers (20)

  1. The Telephone $k$-Multicast Problem cs.DS · 2024 · author #2
  2. On subexponential running times for approximating directed Steiner tree and related problems cs.DS · 2018 · author #2
  3. Spanning Trees With Edge Conflicts and Wireless Connectivity cs.NI · 2018 · author #2
  4. From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More cs.CC · 2017 · author #3
  5. Improved approximation algorithm for the Dense-3-Subhypergraph Problem cs.DS · 2017 · author #3
  6. Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds cs.DS · 2016 · author #3
  7. The Densest k-Subhypergraph Problem cs.DS · 2016 · author #4
  8. A $1.75$ LP approximation for the Tree Augmentation Problem cs.DS · 2015 · author #1
  9. A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 cs.DS · 2015 · author #1
  10. Low-Risk Mechanisms for the Kidney Exchange Game cs.GT · 2015 · author #2
  11. Approximation Algorithms for Connected Maximum Cut and Related Problems cs.DS · 2015 · author #2
  12. A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands cs.DS · 2015 · author #5
  13. Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT cs.CC · 2013 · author #3
  14. Fixed-Parameter and Approximation Algorithms: A New Look cs.DS · 2013 · author #3
  15. Approximation Algorithms for Movement Repairmen cs.DS · 2013 · author #4
  16. Approximating Source Location and Star Survivable Network Problems cs.DS · 2012 · author #1
  17. Matroid Secretary for Regular and Decomposable Matroids cs.DS · 2012 · author #2
  18. Label Cover instances with large girth and the hardness of approximating basic k-spanner cs.DS · 2012 · author #2
  19. Steiner Forest Orientation Problems cs.DS · 2011 · author #2
  20. Combinatorial Algorithms for Capacitated Network Design cs.DS · 2011 · author #3

Mentions

No mention provenance yet.

Frequent Coauthors