A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. - Mordechai Shalom; Shmuel Zaks (BROADNETS, 2004)

Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. - Mordechai Shalom; Shmuel Zaks (SIROCCO, 2005)

Optimal design problems for optical networks. - Mordechai Shalom (2006)

On the Complexity of the Traffic Grooming Problem in Optical Networks. - Mordechai Shalom; Walter Unger; Shmuel Zaks (FUN, 2007)

On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. - Viacheslav Chernoy; Mordechai Shalom; Shmuel Zaks (SSS, 2007)

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. - Stefania Di Giannantonio; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (WINE, 2007)

On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. - Michele Flammini; Mordechai Shalom; Shmuel Zaks (J. Parallel Distributed Comput., 2007)

Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. - Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2007)

A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. - Mordechai Shalom; Shmuel Zaks (IEEE/ACM Trans. Netw., 2007)

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Euro-Par, 2008)

On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. - Viacheslav Chernoy; Mordechai Shalom; Shmuel Zaks (SIROCCO, 2008)

A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. - Viacheslav Chernoy; Mordechai Shalom; Shmuel Zaks (DISC, 2008)

Selfishness, collusion and power of local search for the ADMs minimization problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Comput. Networks, 2008)

Approximating the traffic grooming problem. - Michele Flammini; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Discrete Algorithms, 2008)

Approximating the traffic grooming problem in tree and star networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Parallel Distributed Comput., 2008)

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 (SIROCCO, 2009)

Shmuel Zaks - The Mathematician, Computer Scientist and Personality. - Mordechai Shalom (DISC, 2009)

On minimizing the number of ADMs in a general topology optical network. - Michele Flammini; Mordechai Shalom; Shmuel Zaks (Discret. Appl. Math., 2009)

Traffic Grooming: Combinatorial Results and Practical Resolutions. - Tibor Cinkler; David Coudert; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Xavier Muñoz; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (Graphs and Algorithms in Communication Networks, 2010)

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (OPODIS, 2010)

Traffic Grooming in Star Networks via Matching Techniques. - Ignasi Sau; Mordechai Shalom; Shmuel Zaks (SIROCCO, 2010)

On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. - Viacheslav Chernoy; Mordechai Shalom; Shmuel Zaks (Distributed Comput., 2010)

Optimal on-line colorings for minimizing the number of ADMs in optical networks. - Mordechai Shalom; Prudence W. H. Wong; Shmuel Zaks (J. Discrete Algorithms, 2010)

Minimizing total busy time in parallel scheduling with application to optical networks. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Hadas Shachnai; Mordechai Shalom; Tami Tamir; Shmuel Zaks (Theor. Comput. Sci., 2010)

Optimizing regenerator cost in traffic grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2011)

Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). - Mordechai Shalom; Ariella Voloshin; Prudence W. H. Wong; Fencol C. C. Yung; Shmuel Zaks (TAMC, 2012)

On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). - Itamar Hartstein; Mordechai Shalom; Shmuel Zaks (WAOA, 2012)

Placing regenerators in optical networks to satisfy multiple sets of requests. - George B. Mertzios; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (IEEE/ACM Trans. Netw., 2012)

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (WG, 2013)

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (CoRR, 2013)

On approximating the d-girth of a graph. - David Peleg; Ignasi Sau; Mordechai Shalom (Discret. Appl. Math., 2013)

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithmica, 2014)

On the complexity of constructing minimum changeover cost arborescences. - Didem Gözüpek; Mordechai Shalom; Ariella Voloshin; Shmuel Zaks (Theor. Comput. Sci., 2014)

Online optimization of busy time on parallel machines. - Mordechai Shalom; Ariella Voloshin; Prudence W. H. Wong; Fencol C. C. Yung; Shmuel Zaks (Theor. Comput. Sci., 2014)

Equimatchable Graphs are C_2k+1-free for k ≥ 4. - Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (CTW, 2015)

Edge Coloring with Minimum Reload/Changeover Costs. - Didem Gözüpek; Mordechai Shalom (CTW, 2015)

The Maximum Cut Problem in Co-bipartite Chain Graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (CoRR, 2015)

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (CoRR, 2015)

On the interval chromatic number of proper interval graphs. - Mordechai Shalom (Discret. Math., 2015)

Optimizing busy time on parallel machines. - George B. Mertzios; Mordechai Shalom; Ariella Voloshin; Prudence W. H. Wong; Shmuel Zaks (Theor. Comput. Sci., 2015)

A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks. - Didem Gözüpek; Mordechai Shalom; Fatih Alagöz (IEEE/ACM Trans. Netw., 2015)

A Simple Extension of Dirac's Theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan; Mordechai Shalom (CoRR, 2016)

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Appl. Math., 2016)

On the complexity of the regenerator location problem treewidth and other parameters. - Itamar Hartstein; Mordechai Shalom; Shmuel Zaks (Discret. Appl. Math., 2016)

On-line maximum matching in complete multi-partite graphs with an application to optical networks. - Mordechai Shalom; Prudence W. H. Wong; Shmuel Zaks (Discret. Appl. Math., 2016)

Equimatchable graphs are C2k+1-free for k≥4. - Cemil Dibek; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (Discret. Math., 2016)

On Three Extensions of Equimatchable Graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Electron. Notes Discret. Math., 2016)

Graphs of edge-intersecting and non-splitting paths. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2016)

Constructing minimum changeover cost arborescenses in bounded treewidth graphs. - Didem Gözüpek; Hadas Shachnai; Mordechai Shalom; Shmuel Zaks (Theor. Comput. Sci., 2016)

On two extensions of equimatchable graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Discret. Optim., 2017)

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Math. Theor. Comput. Sci., 2017)

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (Inf. Process. Lett., 2017)

Online Regenerator Placement. - George B. Mertzios; Mordechai Shalom; Prudence W. H. Wong; Shmuel Zaks (Theory Comput. Syst., 2017)

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. - Didem Gözüpek; Sibel Özkan; Christophe Paul; Ignasi Sau; Mordechai Shalom (Theor. Comput. Sci., 2017)

Online Coalition Structure Generation in Graph Games. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (AAMAS, 2018)

Equimatchable claw-free graphs. - Saieed Akbari; Hadi Alizadeh; Tínaz Ekim; Didem Gözüpek; Mordechai Shalom (Discret. Math., 2018)

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom; Shmuel Zaks (Discret. Math. Theor. Comput. Sci., 2018)

The maximum cardinality cut problem in co-bipartite chain graphs. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (J. Comb. Optim., 2018)

Maximizing Communication Throughput in Tree Networks. - Yuval Emek; Fanica Gavril; Shay Kutten; Mordechai Shalom; Shmuel Zaks (CoRR, 2019)

On one extension of Dirac's theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan; Mordechai Shalom (Discret. Appl. Math., 2019)

Complexity of edge coloring with minimum reload/changeover costs. - Didem Gözüpek; Mordechai Shalom (Networks, 2019)

Complexity and online algorithms for minimum skyline coloring of intervals. - Thomas Erlebach; Fu-Hong Liu; Hsiang-Hsuan Liu 001; Mordechai Shalom; Prudence W. H. Wong; Shmuel Zaks (Theor. Comput. Sci., 2019)

Profit Maximization in Flex-Grid All-Optical Networks. - Mordechai Shalom; Prudence W. H. Wong; Shmuel Zaks (Theory Comput. Syst., 2020)

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. - Julien Baste; Didem Gözüpek; Christophe Paul; Ignasi Sau; Mordechai Shalom; Dimitrios M. Thilikos (Networks, 2020)

Multicast Communications with Varying Bandwidth Constraints. - Yuval Emek; Shay Kutten; Mordechai Shalom; Shmuel Zaks (INFOCOM, 2021)

Hierarchical b-Matching. - Yuval Emek; Shay Kutten; Mordechai Shalom; Shmuel Zaks (SOFSEM, 2021)

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (Algorithms, 2021)

On the Online Coalition Structure Generation Problem. - Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Mordechai Shalom; Shmuel Zaks (J. Artif. Intell. Res., 2021)

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. - Tínaz Ekim; Mordechai Shalom; Oylum Seker (J. Comb. Optim., 2021)

Minimum Reload Cost Graph Factors. - Julien Baste; Didem Gözüpek; Mordechai Shalom; Dimitrios M. Thilikos (Theory Comput. Syst., 2021)

Distribution Games: A New Class of Games With Application to User Provided Networks. - Sinan Emre Tasçi; Mordechai Shalom; Ömer Korçak (IEEE Access, 2022)

Approximation algorithms for maximum weight k-coverings of graphs by packings. - Fanica Gavril; Mordechai Shalom; Shmuel Zaks (Discret. Math. Algorithms Appl., 2022)

On the maximum cardinality cut problem in proper interval graphs and related graph classes. - Arman Boyaci; Tínaz Ekim; Mordechai Shalom (Theor. Comput. Sci., 2022)

Defensive domination in proper interval graphs. - Tínaz Ekim; Arthur M. Farley; Andrzej Proskurowski; Mordechai Shalom (Discret. Appl. Math., 2023)

Generation of weighted trees, block trees and block graphs. - Tínaz Ekim; Mordechai Shalom; Mehmet Aziz Yirik (CoRR, 2024)