Mordechai Shalom

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 48

Top Venues

Publications

Tínaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik
Generation of weighted trees, block trees and block graphs. CoRR (2024)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive domination in proper interval graphs. Discret. Appl. Math. 331 (2023)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the maximum cardinality cut problem in proper interval graphs and related graph classes. Theor. Comput. Sci. 898 (2022)
Fanica Gavril, Mordechai Shalom, Shmuel Zaks
Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14 (1) (2022)
Sinan Emre Tasçi, Mordechai Shalom, Ömer Korçak
Distribution Games: A New Class of Games With Application to User Provided Networks. IEEE Access 10 (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)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. J. Comb. Optim. 41 (3) (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)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. Theory Comput. Syst. 65 (5) (2021)
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Profit Maximization in Flex-Grid All-Optical Networks. Theory Comput. Syst. 64 (2) (2020)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75 (3) (2020)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes. CoRR (2020)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive Domination in Proper Interval Graphs. CoRR (2020)
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Hierarchical b-Matching. CoRR (2019)
Didem Gözüpek, Mordechai Shalom
Complexity of edge coloring with minimum reload/changeover costs. Networks 73 (3) (2019)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. 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)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. SEA² (2019)
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Maximizing Communication Throughput in Tree Networks. CoRR (2019)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. SOFSEM (2019)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
On one extension of Dirac's theorem on Hamiltonicity. Discret. Appl. Math. 252 (2019)
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Online Coalition Structure Generation in Graph Games. AAMAS (2018)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable claw-free graphs. Discret. Math. 341 (10) (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)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35 (1) (2018)
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
Minimum Reload Cost Graph Factors. CoRR (2018)
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)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC (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)
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. Inf. Process. Lett. 121 (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, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690 (2017)
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
On two extensions of equimatchable graphs. Discret. Optim. 26 (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)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Claw-Free Graphs. CoRR (2016)
Didem Gözüpek, Mordechai Shalom
Edge Coloring with Minimum Reload/Changeover Costs. CoRR (2016)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG (2016)
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55 (2016)
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
On the complexity of the regenerator location problem treewidth and other parameters. Discret. Appl. Math. 199 (2016)
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR (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)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
-free for k≥4. Discret. Math. 339 (12) (2016)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
A Simple Extension of Dirac's Theorem on Hamiltonicity. CoRR (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)
Mordechai Shalom
On the interval chromatic number of proper interval graphs. Discret. Math. 338 (11) (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)
Didem Gözüpek, Mordechai Shalom
Edge Coloring with Minimum Reload/Changeover Costs. CTW (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cut Problem in Co-bipartite Chain Graphs. CoRR (2015)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR (2015)
Didem Gözüpek, Mordechai Shalom, Fatih Alagöz
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks. IEEE/ACM Trans. Netw. 23 (1) (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)
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)
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)
David Peleg, Ignasi Sau, Mordechai Shalom
-girth of a graph. Discret. Appl. Math. 161 (16-17) (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)
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, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Online Regenerator Placement. OPODIS (2011)
David Peleg, Ignasi Sau, Mordechai Shalom
-Girth of a Graph. SOFSEM (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)
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)
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)
Michele Flammini, Mordechai Shalom, Shmuel Zaks
On minimizing the number of ADMs in a general topology optical network. Discret. Appl. Math. 157 (12) (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)
Mordechai Shalom
Shmuel Zaks - The Mathematician, Computer Scientist and Personality. DISC (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)
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)
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)

Mordechai Shalom.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mordechai Shalom