| 2025 | Algosensors | A Logarithmic Approximation Algorithm for the Activation Edge-Multicover Problem. | Zeev Nutov, Avner Huri, Guy Kortsarz |
| 2024 | WG | Approximations and Hardness of Covering and Packing Partially Ordered Items. | Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2023 | WAOA | Improved Approximations for Relative Survivable Network Design. | Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov |
| 2020 | IWOCA | Bounded Degree Group Steiner Tree Problems. | Guy Kortsarz, Zeev Nutov |
| 2020 | WAOA | Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems. | Magns M. Halldrsson, Guy Kortsarz, Marek Cygan |
| 2019 | MFCS | Approximating Activation Edge-Cover and Facility Location Problems. | Zeev Nutov, Guy Kortsarz, Eli Shalom |
| 2018 | ICALP | Spanning Trees With Edge Conflicts and Wireless Connectivity. | Magns M. Halldrsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan |
| 2018 | WAOA | Improved Approximation Algorithms for Minimum Power Covering Problems. | Gruia Calinescu, Guy Kortsarz, Zeev Nutov |
| 2017 | FOCS | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
| 2017 | SODA | Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. | Eden Chlamtc, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit |
| 2016 | ICALP | Bicovering: Covering Edges With Two Small Subsets of Vertices. | Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
| 2016 | LATIN | A Bounded-Risk Mechanism for the Kidney Exchange Game. | Hossein Esfandiari, Guy Kortsarz |
| 2015 | Algosensors | Radio Aggregation Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Christian Konrad, Guy Kortsarz, Hoon Oh |
| 2015 | ESA | Approximation Algorithms for Connected Maximum Cut and Related Problems. | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar |
| 2015 | SAGT | Brief Announcement: New Mechanisms for Pairwise Kidney Exchange. | Hossein Efsandiari, Guy Kortsarz |
| 2015 | WG | Approximating Source Location and Star Survivable Network Problems. | Guy Kortsarz, Zeev Nutov |
| 2014 | WG | On Set Expansion Problems and the Small Set Expansion Conjecture. | Rajiv Gandhi, Guy Kortsarz |
| 2013 | SODA | Matroid Secretary for Regular and Decomposable Matroids. | Michael Dinitz, Guy Kortsarz |
| 2013 | WAOA | On Fixed Cost k-Flow Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2012 | ESA | Steiner Forest Orientation Problems. | Marek Cygan, Guy Kortsarz, Zeev Nutov |
| 2012 | ICALP | Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. | Michael Dinitz, Guy Kortsarz, Ran Raz |
| 2012 | LATIN | Advantage of Overlapping Clusters for Minimizing Conductance. | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni |
| 2011 | SPAA | On a local protocol for concurrent file transfers. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat |
| 2010 | ESA | Budgeted Red-Blue Median and Its Generalizations. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
| 2010 | IPCO | Prize-Collecting Steiner Network Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2009 | SODA | Improved approximating algorithms for Directed Steiner Forest. | Moran Feldman, Guy Kortsarz, Zeev Nutov |
| 2008 | ESA | Two-Stage Robust Network Design with Exponential Scenarios. | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour |
| 2008 | IPCO | Min Sum Edge Coloring in Multigraphs Via Configuration LP. | Magns M. Halldrsson, Guy Kortsarz, Maxim Sviridenko |
| 2008 | LATIN | Approximating Minimum-Power Degree and Connectivity Problems. | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
| 2007 | SODA | Approximation algorithms for node-weighted buy-at-bulk network design. | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
| 2006 | FOCS | Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
| 2006 | ICALP | Tight Approximation Algorithm for Connectivity Augmentation Problems. | Guy Kortsarz, Zeev Nutov |
| 2005 | IPCO | Power Optimization for Connectivity Problems. | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
| 2005 | SODA | Improved schedule for radio broadcast. | Michael Elkin, Guy Kortsarz |
| 2005 | SODA | Complete partitions of graphs. | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
| 2004 | ICALP | Improved Results for Data Migration and Open Shop Scheduling. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2004 | MFCS | Multicoloring: Problems and Techniques. | Magns M. Halldrsson, Guy Kortsarz |
| 2004 | STOC | Asymmetric k-center is log | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
| 2004 | STOC | Approximation algorithm for k-node connected subgraphs via critical graphs. | Guy Kortsarz, Zeev Nutov |
| 2004 | WAOA | Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. | Rajiv Gandhi, Magns M. Halldrsson, Guy Kortsarz, Hadas Shachnai |
| 2004 | WAOA | Approximation Algorithm for Directed Multicuts. | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
| 2003 | ESA | The Minimum Shift Design Problem: Theory and Practice. | Luca Di Gaspero, Johannes Grtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany |
| 2003 | ESA | Approximating the Achromatic Number Problem on Bipartite Graphs. | Guy Kortsarz, Sunil M. Shende |
| 2003 | ICALP | Approximation Algorithm for Directed Telephone Multicast Problem. | Michael Elkin, Guy Kortsarz |
| 2003 | ICALP | An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
| 2003 | SODA | Sublogarithmic approximation for telephone multicast: path out of jungle. | Michael Elkin, Guy Kortsarz |
| 2003 | SODA | Integrality ratio for group Steiner trees and directed steiner trees. | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
| 2002 | SODA | An approximation algorithm for the group Steiner problem. | Guy Even, Guy Kortsarz |
| 2002 | STOC | Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. | Michael Elkin, Guy Kortsarz |
| 2001 | SODA | On approximating the achromatic number. | Guy Kortsarz, Robert Krauthgamer |
| 2000 | STOC | Approximating the domatic number. | Uriel Feige, Magns M. Halldrsson, Guy Kortsarz |
| 2000 | WG | Tree Spanners for Subgraphs and Related Tree Covering Problems. | Dagmar Handke, Guy Kortsarz |
| 1999 | COCOON | Multi-coloring Trees. | Magns M. Halldrsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
| 1999 | ESA | Sum Multi-coloring of Graphs. | Amotz Bar-Noy, Magns M. Halldrsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
| 1997 | ICALP | The Minimum Color Sum of Bipartite Graphs. | Amotz Bar-Noy, Guy Kortsarz |
| 1997 | SODA | Approximating Shallow-Light Trees (Extended Abstract). | Guy Kortsarz, David Peleg |
| 1994 | SODA | Generating Low-Degree 2-Spanners. | Guy Kortsarz, David Peleg |
| 1993 | FOCS | On Choosing a Dense Subgraph (Extended Abstract) | Guy Kortsarz, David Peleg |