Shmuel Zaks

ORCID

Publication Activity (10 Years)

Years Active: 1979-2022
Publications (10 Years): 31

Top Venues

CoRR

Theor. Comput. Sci.

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Publications

Fanica Gavril, Mordechai Shalom, Shmuel Zaks
Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14 (1) (2022)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Multicast Communications with Varying Bandwidth Constraints. INFOCOM (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14 (5) (2021)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Hierarchical b-Matching. SOFSEM (2021)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72 (2021)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Profit Maximization in Flex-Grid All-Optical Networks. Theory Comput. Syst. 64 (2) (2020)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Hierarchical b-Matching. CoRR (2019)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788 (2019)
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Maximizing Communication Throughput in Tree Networks. CoRR (2019)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Online Coalition Structure Generation in Graph Games. AAMAS (2018)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Flexible bandwidth assignment with application to optical networks. J. Sched. 21 (3) (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45 (2017)
Kshitiz Verma, Gianluca Rizzo, Antonio Fernández Anta, Rubén Cuevas Rumín, Arturo Azcorra, Shmuel Zaks, Alberto García-Martínez
Energy-optimal collaborative file distribution in wired networks. Peer-to-Peer Netw. Appl. 10 (4) (2017)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Online Regenerator Placement. Theory Comput. Syst. 61 (3) (2017)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621 (2016)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629 (2016)
Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone
Enhanced Content Update Dissemination Through D2D in 5G Cellular Networks. IEEE Trans. Wirel. Commun. 15 (11) (2016)
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
On the complexity of the regenerator location problem treewidth and other parameters. Discret. Appl. Math. 199 (2016)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215 (2016)
Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez
SLEEPWELL: Energy Efficient Network Design for the Developing World Using Green Switches. AINA (2016)
George B. Mertzios, Shmuel Zaks
On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. 199 (2016)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
On-line maximum matching in complete multi-partite graphs with an application to optical networks. Discret. Appl. Math. 199 (2016)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW (2015)
Shmuel Zaks
Online Lower Bounds and Offline Inapproximability in Optical Networks. ADHOC-NOW (2015)
Shmuel Zaks
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks. WG (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR (2015)
Kshitiz Verma, Shmuel Zaks, Alberto García-Martínez
Designing Low Cost and Energy Efficient Access Network for the Developing World. CoRR (2015)
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
Optimizing busy time on parallel machines. Theor. Comput. Sci. 562 (2015)
Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks
On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540 (2014)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68 (3) (2014)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) (2014)
Hadas Shachnai, Ariella Voloshin, Shmuel Zaks
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS (2014)
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560 (2014)
Vincenzo Sciancalepore, Vincenzo Mancuso, Albert Banchs, Shmuel Zaks, Antonio Capone
Interference coordination strategies for content update dissemination in LTE-A. INFOCOM (2014)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. ICTCS (2014)
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Online Regenerator Placement. CoRR (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. CoRR (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. CoRR (2013)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Profit Maximization in Flex-Grid All-Optical Networks. SIROCCO (2013)
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. LATIN (2012)
George B. Mertzios, Shmuel Zaks
On the Intersection of Tolerance and Cocomparability Graphs CoRR (2012)
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. Distributed Comput. 25 (4) (2012)
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract). TAMC (2012)
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
Optimizing Busy Time on Parallel Machines. IPDPS (2012)
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). WAOA (2012)
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20 (6) (2012)
George B. Mertzios, Ignasi Sau, Shmuel Zaks
The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40 (5) (2011)
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism. CoRR (2011)
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. DISC (2011)
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Online Regenerator Placement. OPODIS (2011)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19 (2) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412 (52) (2011)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411 (40-42) (2010)
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) (2010)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Optimal on-line colorings for minimizing the number of ADMs in optical networks. J. Discrete Algorithms 8 (2) (2010)
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms. Distributed Comput. 23 (1) (2010)
George B. Mertzios, Ignasi Sau, Shmuel Zaks
The Recognition of Tolerance and Bounded Tolerance Graphs. STACS (2010)
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. DISC (2010)
George B. Mertzios, Shmuel Zaks
On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) (2010)
George B. Mertzios, Ignasi Sau, Shmuel Zaks
The Recognition of Tolerance and Bounded Tolerance Graphs CoRR (2010)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS (2010)
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
Traffic Grooming in Star Networks via Matching Techniques. SIROCCO (2010)
George B. Mertzios, Ignasi Sau, Shmuel Zaks
A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. 23 (4) (2009)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. SIROCCO (2009)
Giuseppe Prencipe, Shmuel Zaks
Preface. Theor. Comput. Sci. 410 (14) (2009)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157 (12) (2009)
Nachum Dershowitz, Shmuel Zaks
More Patterns in Trees: Up and Down, Young and Old, Odd and Even. SIAM J. Discret. Math. 23 (1) (2009)
George B. Mertzios, Ignasi Sau, Shmuel Zaks
A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS (2009)
Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks
On the complexity of the regenerator placement problem in optical networks. SPAA (2009)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68 (7) (2008)
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par (2008)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52 (9) (2008)
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO (2008)
Fanica Gavril, Ron Y. Pinter, Shmuel Zaks
Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6 (2) (2008)
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the traffic grooming problem. J. Discrete Algorithms 6 (3) (2008)
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS (2007)
Mordechai Shalom, Walter Unger, Shmuel Zaks
On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN (2007)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC (2007)
Michel Raynal, Sam Toueg, Shmuel Zaks
DISC at Its 20th Anniversary (Stockholm, 2006). DISC (2007)
Mordechai Shalom, Shmuel Zaks
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. Theor. Comput. Sci. 384 (2-3) (2007)
Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE (2007)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distributed Comput. 67 (4) (2007)
Mordechai Shalom, Shmuel Zaks
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans. Netw. 15 (6) (2007)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN (2006)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG (2006)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On Minimizing the Number of ADMs in a General Topology Optical Network. DISC (2006)
Mordechai Shalom, Shmuel Zaks
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO (2005)
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Approximating the Traffic Grooming Problem. ISAAC (2005)
Mordechai Shalom, Shmuel Zaks
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS (2004)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289 (1) (2002)
Tamar Eilam, Shlomo Moran, Shmuel Zaks
Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20 (1) (2002)
Shmuel Zaks
Design Issues in ATM and Optical Networks. Comput. Artif. Intell. 20 (2) (2001)
Shmuel Zaks
On the Use of Duality and Geometry in Layouts for ATM Networks. MFCS (2000)

Shmuel Zaks.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Shmuel Zaks