Projects per year
Fingerprint
Dive into the research topics where Guy Kortsarz is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 12 Similar Profiles
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Projects
- 4 Finished
-
BSF:2014163:APPROXIMABILITY OF NETWORK DESIGN PROBLEMS
National Science Foundation (National Science Foundation (NSF))
9/1/15 → 8/31/19
Project: Research project
-
AF: SMALL: RUI: NETWORK DESIGN AND FACILITY LOCATION PROBLEMS
National Science Foundation (National Science Foundation (NSF))
9/1/12 → 8/31/15
Project: Research project
-
APPROXIMATING NETWORK DESIGN PROBLEMS ON DIRECTED AND UNDIRECTED GRAPHS
National Science Foundation (National Science Foundation (NSF))
2/1/09 → 1/31/12
Project: Research project
-
APPROXIMATING BICRITERIA NETWORK-DESIGN PROBLEMS
National Science Foundation (National Science Foundation (NSF))
2/15/08 → 1/31/09
Project: Research project
Research output
-
Approximating Spanners and Directed Steiner Forest
Chlamtáč, E., Dinitz, M., Kortsarz, G. & Laekhanukit, B., Jun 2020, In: ACM Transactions on Algorithms. 16, 3, 33.Research output: Contribution to journal › Article › peer-review
-
Approximation algorithms for connected maximum cut and related problems
Hajiaghayi, M. T., Kortsarz, G., MacDavid, R., Purohit, M. & Sarpatwar, K., Apr 24 2020, In: Theoretical Computer Science. 814, p. 74-85 12 p.Research output: Contribution to journal › Article › peer-review
1 Scopus citations -
Bounded Degree Group Steiner Tree Problems
Kortsarz, G. & Nutov, Z., 2020, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Proceedings. Gasieniec, L., Gasieniec, L., Klasing, R. & Radzik, T. (eds.). Springer, p. 343-354 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12126 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more
Chalermsook, P., Cygan, M., Kortsarz, G., Laekhanukit, B., Manurangsi, P., Nanongkai, D. & Trevisan, L., 2020, In: SIAM Journal on Computing. 49, 4, p. 772-810 39 p.Research output: Contribution to journal › Article › peer-review
-
On approximating degree-bounded network design problems
Guo, X., Kortsarz, G., Laekhanukit, B., Li, S., Vaz, D. & Xian, J., Aug 1 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX39. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution