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.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 5 Finished
-
AF:RUI:Small:Approximation Problems with Tree Outputs Under Parameterized Constraints
Gandhi, R. (PI) & Kortsarz, G. (CoPI)
10/1/19 → 9/30/22
Project: Research project
-
BSF:2014163:Approximability of network design problems
Kortsarz, G. (PI)
9/1/15 → 8/31/20
Project: Research project
-
AF: Small: RUI: Network design and facility location problems
Kortsarz, G. (PI) & Gandhi, R. (CoPI)
9/1/12 → 6/30/17
Project: Research project
-
Approximating Network Design Problems on Directed and Undirected Graphs
Kortsarz, G. (PI)
2/1/09 → 1/31/12
Project: Research project
-
Approximating Bicriteria Network-Design Problems
Kortsarz, G. (PI)
2/15/08 → 1/31/09
Project: Research project
-
Approximations and Hardness of Covering and Packing Partially Ordered Items
Doron-Arad, I., Kortsarz, G., Naor, J., Schieber, B. & Shachnai, H., 2025, Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Revised Selected Papers. Kráľ, D. & Milanič, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 166-180 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14760 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Degrees and Network Design: New Problems and Approximations
Dinitz, M., Kortsarz, G. & Li, S., Sep 2024, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Kumar, A. & Ron-Zewi, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 317).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
1 Scopus citations -
The Telephone k-Multicast Problem
Hathcock, D., Kortsarz, G. & Ravi, R., Sep 2024, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Kumar, A. & Ron-Zewi, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 317).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Improved Approximations for Relative Survivable Network Design
Dinitz, M., Koranteng, A., Kortsarz, G. & Nutov, Z., 2023, Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings. Byrka, J. & Wiese, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 190-204 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14297 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Approximating activation edge-cover and facility location problems
Kortsarz, G., Nutov, Z. & Shalom, E., Sep 21 2022, In: Theoretical Computer Science. 930, p. 218-228 11 p.Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations