| 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 |
| 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 | AINA | SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches. | Kshitiz Verma, Shmuel Zaks, Alberto Garca-Martnez |
| 2015 | WG | On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. | Shmuel Zaks |
| 2014 | INFOCOM | Interference coordination strategies for content update dissemination in LTE-A. | Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone |
| 2014 | MFCS | Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). | Hadas Shachnai, Ariella Voloshin, Shmuel Zaks |
| 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 | LATIN | Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. | Martin Farach-Colton, Antonio Fernndez Anta, Alessia Milani, Miguel A. Mosteiro, 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 |
| 2010 | ICALP | Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. | George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2010 | ISAAC | On the Intersection of Tolerance and Cocomparability Graphs. | George B. Mertzios, Shmuel Zaks |
| 2010 | OPODIS | Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2010 | STACS | The Recognition of Tolerance and Bounded Tolerance Graphs. | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2010 | SIROCCO | Traffic Grooming in Star Networks via Matching Techniques. | Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2009 | SPAA | On the complexity of the regenerator placement problem in optical networks. | Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, 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 |
| 2009 | WG | A New Intersection Model and Improved Algorithms for Tolerance Graphs. | George B. Mertzios, Ignasi Sau, 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 |
| 2000 | CIAC | Duality in ATM Layout Problems. | Shmuel Zaks |
| 2000 | MFCS | On the Use of Duality and Geometry in Layouts for ATM Networks. | Shmuel Zaks |
| 1997 | ICALP | A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). | Tamar Eilam, Michele Flammini, Shmuel Zaks |
| 1997 | SIROCCO | The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. | Tamar Eilam, Shlomo Moran, Shmuel Zaks |
| 1997 | SIROCCO | Duality in Chain ATM Virtual Path Layouts. | Marcelo Feighelstein, Shmuel Zaks |
| 1997 | SOFSEM | Path Layout in ATM Networks. | Shmuel Zaks |
| 1997 | WG | On Optimal Graphs Embedded into Path and Rings, with Analysis Using l | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks |
| 1996 | INFOCOM | Efficient Support for the Client/Server Paradigm over Heterogeneous ATM Networks. | Ornan Ori Gerstel, Israel Cidon, Shmuel Zaks |
| 1996 | SIROCCO | On the Power of Local Information in Scheduling in Synchronous Networks. | Derek Hing-leung Ngok, Shmuel Zaks |
| 1995 | COCOON | Minimum Dominating Sets of Intervals on Lines (Extended Abstract). | Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks |
| 1995 | ESA | Optimal Layouts on a Chain ATM Network (Extended Abstract). | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks |
| 1994 | ISAAC | Robust Asynchronous Algorithms in Networks with a Fault Detection Ring. | Moshe Molcho, Shmuel Zaks |
| 1994 | PODC | The Virtual Path Layout Problem in Fast Networks (Extended Abstract). | Ornan Ori Gerstel, Shmuel Zaks |
| 1994 | SIROCCO | Path Layout in ATM Networks. | Ornan Ori Gerstel, Shmuel Zaks |
| 1994 | WG | Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. | Mordecai J. Golin, Shmuel Zaks |
| 1993 | ESA | The Bit Complexity of Distributed Sorting (Extended Abstract). | Ornan Ori Gerstel, Shmuel Zaks |
| 1993 | ICALP | Optimal Bounds for the Change-Making Problem. | Dexter Kozen, Shmuel Zaks |
| 1993 | ISAAC | Optimal Linear Broadcast Routing with Capacity Limitations. | Sara Bitan, Shmuel Zaks |
| 1992 | WG | A New Characterization of Tree Medians with Applications to Distributed Algorithms. | Ornan Ori Gerstel, Shmuel Zaks |
| 1990 | WG | Deciding 1-sovability of distributed task is NP-hard. | Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1988 | CONCUR | Optimal Synchronization of ABD Networks. | Ephraim Korach, Gerard Tel, Shmuel Zaks |
| 1988 | PODC | A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. | Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1987 | ICALP | Guessing Games and Distributed Computations in Synchronous Networks. | Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks |
| 1987 | STACS | Making Distributed Spanning Tree Algorithms Fault-Resilient. | Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks |
| 1986 | PODC | On the Bit Complexity of Distributed Computations in a Ring with a Leader. | Yishay Mansour, Shmuel Zaks |
| 1985 | PODC | The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors. | Ephraim Korach, Shlomo Moran, Shmuel Zaks |
| 1984 | PODC | Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors. | Ephraim Korach, Shlomo Moran, Shmuel Zaks |