| 2021 | INFOCOM | Multicast Communications with Varying Bandwidth Constraints. | Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks |
| 2021 | SOFSEM | Hierarchical b-Matching. | Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks |
| 2019 | SOFSEM | Minimum Reload Cost Graph Factors. | Julien Baste, Didem Gzpek, Mordechai Shalom, Dimitrios M. Thilikos |
| 2017 | COCOA | Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. | Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2016 | WG | Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. | Didem Gzpek, Sibel zkan, Christophe Paul, Ignasi Sau, Mordechai Shalom |
| 2013 | SIROCCO | Profit Maximization in Flex-Grid All-Optical Networks. | Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2013 | WG | Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). | Arman Boyaci, Tnaz Ekim, Mordechai Shalom, Shmuel Zaks |
| 2012 | TAMC | Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). | Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks |
| 2012 | WAOA | On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). | Itamar Hartstein, Mordechai Shalom, Shmuel Zaks |
| 2011 | OPODIS | On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2011 | OPODIS | Online Regenerator Placement. | George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2011 | SOFSEM | On Approximating the | David Peleg, Ignasi Sau, Mordechai Shalom |
| 2010 | ICALP | Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. | George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2010 | OPODIS | Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2010 | SIROCCO | Traffic Grooming in Star Networks via Matching Techniques. | Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2009 | SIROCCO | On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. | Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2008 | EuroPar | Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2008 | SIROCCO | On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
| 2007 | FUN | On the Complexity of the Traffic Grooming Problem in Optical Networks. | Mordechai Shalom, Walter Unger, Shmuel Zaks |
| 2007 | SSS | On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. | Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks |
| 2006 | WG | Approximating the Traffic Grooming Problem in Tree and Star Networks. | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2005 | ISAAC | Approximating the Traffic Grooming Problem. | Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2005 | SIROCCO | Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. | Mordechai Shalom, Shmuel Zaks |
| 2004 | Broadnets | A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. | Mordechai Shalom, Shmuel Zaks |