Mordechai Shalom

106 papers A* 1A 7B 17C 6Misc 1Journal 65Unranked 7
YearRankTypeTitle / Venue / Authors
2024 J jnl
Generation of weighted trees, block trees and block graphs.
CoRR
Tínaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik
2023 J jnl
Defensive domination in proper interval graphs.
Discret. Appl. Math.
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
2022 J jnl
Approximation algorithms for maximum weight k-coverings of graphs by packings.
Discret. Math. Algorithms Appl.
Fanica Gavril, Mordechai Shalom, Shmuel Zaks
2022 J jnl
Distribution Games: A New Class of Games With Application to User Provided Networks.
IEEE Access
Sinan Emre Tasçi, Mordechai Shalom, Ömer Korçak
2022 J jnl
On the maximum cardinality cut problem in proper interval graphs and related graph classes.
Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2021 B conf
Hierarchical b-Matching.
SOFSEM
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2021 J jnl
Minimum Reload Cost Graph Factors.
Theory Comput. Syst.
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2021 A* conf
Multicast Communications with Varying Bandwidth Constraints.
INFOCOM
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2021 J jnl
On the Online Coalition Structure Generation Problem.
J. Artif. Intell. Res.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2021 J jnl
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.
Algorithms
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2021 J jnl
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.
J. Comb. Optim.
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2020 J jnl
Defensive Domination in Proper Interval Graphs.
CoRR
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
2020 J jnl
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2020 J jnl
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
Networks
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2020 J jnl
Profit Maximization in Flex-Grid All-Optical Networks.
Theory Comput. Syst.
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2019 J jnl
Complexity and online algorithms for minimum skyline coloring of intervals.
Theor. Comput. Sci.
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2019 J jnl
Complexity of edge coloring with minimum reload/changeover costs.
Networks
Didem Gözüpek, Mordechai Shalom
2019 J jnl
Hierarchical b-Matching.
CoRR
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2019 J jnl
Maximizing Communication Throughput in Tree Networks.
CoRR
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2019 B conf
Minimum Reload Cost Graph Factors.
SOFSEM
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2019 J jnl
On one extension of Dirac's theorem on Hamiltonicity.
Discret. Appl. Math.
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
2019 — conf
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
SEA²
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2019 J jnl
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
CoRR
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2018 J jnl
Equimatchable claw-free graphs.
Discret. Math.
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
2018 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Discret. Math. Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2018 J jnl
Minimum Reload Cost Graph Factors.
CoRR
Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
2018 A conf
Online Coalition Structure Generation in Graph Games.
AAMAS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2018 J jnl
The maximum cardinality cut problem in co-bipartite chain graphs.
J. Comb. Optim.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2017 J jnl
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.
Inf. Process. Lett.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2017 — conf
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals.
COCOA (2)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017 J jnl
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
Discret. Math. Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2017 J jnl
On two extensions of equimatchable graphs.
Discret. Optim.
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
2017 J jnl
Online Regenerator Placement.
Theory Comput. Syst.
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017 B conf
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter.
IPEC
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017 J jnl
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.
CoRR
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017 J jnl
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci.
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016 J jnl
A Simple Extension of Dirac's Theorem on Hamiltonicity.
CoRR
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
2016 J jnl
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Theor. Comput. Sci.
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2016 J jnl
Edge Coloring with Minimum Reload/Changeover Costs.
CoRR
Didem Gözüpek, Mordechai Shalom
2016 J jnl
Equimatchable Claw-Free Graphs.
CoRR
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
2016 J jnl
Equimatchable graphs are C
Discret. Math.
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
2016 J jnl
Graphs of edge-intersecting and non-splitting paths.
Theor. Comput. Sci.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2016 J jnl
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.
Discret. Appl. Math.
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2016 J jnl
On Three Extensions of Equimatchable Graphs.
Electron. Notes Discret. Math.
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
2016 J jnl
On the complexity of the regenerator location problem treewidth and other parameters.
Discret. Appl. Math.
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
2016 J jnl
On-line maximum matching in complete multi-partite graphs with an application to optical networks.
Discret. Appl. Math.
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2016 B conf
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability.
WG
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016 J jnl
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
CoRR
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2015 J jnl
A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks.
IEEE/ACM Trans. Netw.
Didem Gözüpek, Mordechai Shalom, Fatih Alagöz
2015 C conf
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs.
CTW
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
2015 C conf
Edge Coloring with Minimum Reload/Changeover Costs.
CTW
Didem Gözüpek, Mordechai Shalom
2015 C conf
Equimatchable Graphs are C_2k+1-free for k ≥ 4.
CTW
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
2015 J jnl
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2015 J jnl
On the interval chromatic number of proper interval graphs.
Discret. Math.
Mordechai Shalom
2015 J jnl
Optimizing busy time on parallel machines.
Theor. Comput. Sci.
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2015 J jnl
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2015 J jnl
The Maximum Cut Problem in Co-bipartite Chain Graphs.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
2014 — conf
Graphs of edge-intersecting and non-splitting paths.
ICTCS
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2014 J jnl
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
Algorithmica
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2014 J jnl
On the complexity of constructing minimum changeover cost arborescences.
Theor. Comput. Sci.
Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks
2014 J jnl
Online optimization of busy time on parallel machines.
Theor. Comput. Sci.
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
2013 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 J jnl
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I.
CoRR
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 B conf
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).
WG
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
2013 J jnl
On approximating the
Discret. Appl. Math.
David Peleg, Ignasi Sau, Mordechai Shalom
2013 J jnl
Online Regenerator Placement.
CoRR
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2013 B conf
Profit Maximization in Flex-Grid All-Optical Networks.
SIROCCO
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2012 B conf
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract).
WAOA
Itamar Hartstein, Mordechai Shalom, Shmuel Zaks
2012 C conf
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract).
TAMC
Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
2012 A conf
Optimizing Busy Time on Parallel Machines.
IPDPS
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2012 J jnl
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw.
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2011 B conf
On Approximating the
SOFSEM
David Peleg, Ignasi Sau, Mordechai Shalom
2011 B conf
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.
OPODIS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2011 B conf
Online Regenerator Placement.
OPODIS
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2011 J jnl
Optimizing regenerator cost in traffic grooming.
Theor. Comput. Sci.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2010 J jnl
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2010 J jnl
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms.
Distributed Comput.
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2010 J jnl
Optimal on-line colorings for minimizing the number of ADMs in optical networks.
J. Discrete Algorithms
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2010 B conf
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).
OPODIS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2010 — conf
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests.
ICALP (2)
George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010 B conf
Traffic Grooming in Star Networks via Matching Techniques.
SIROCCO
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010 — ch.
Traffic Grooming: Combinatorial Results and Practical Resolutions.
Graphs and Algorithms in Communication Networks
Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2009 A conf
Minimizing total busy time in parallel scheduling with application to optical networks.
IPDPS
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks
2009 J jnl
On minimizing the number of ADMs in a general topology optical network.
Discret. Appl. Math.
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2009 B conf
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
SIROCCO
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2009 A conf
Shmuel Zaks - The Mathematician, Computer Scientist and Personality.
DISC
Mordechai Shalom
2008 A conf
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.
DISC
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2008 — conf
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.
Euro-Par
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Approximating the traffic grooming problem in tree and star networks.
J. Parallel Distributed Comput.
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Approximating the traffic grooming problem.
J. Discrete Algorithms
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2008 B conf
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion.
SIROCCO
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2008 J jnl
Selfishness, collusion and power of local search for the ADMs minimization problem.
Comput. Networks
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2007 J jnl
A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings.
IEEE/ACM Trans. Netw.
Mordechai Shalom, Shmuel Zaks
2007 J jnl
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem.
Theor. Comput. Sci.
Mordechai Shalom, Shmuel Zaks
2007 J jnl
On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing.
J. Parallel Distributed Comput.
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2007 Misc conf
On the Complexity of the Traffic Grooming Problem in Optical Networks.
FUN
Mordechai Shalom, Walter Unger, Shmuel Zaks
2007 C conf
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.
SSS
Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2007 A conf
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks.
DISC
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2007 — conf
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.
WINE
Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2006 B conf
Approximating the Traffic Grooming Problem in Tree and Star Networks.
WG
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2006 — conf
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.
CAAN
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2006 A conf
On Minimizing the Number of ADMs in a General Topology Optical Network.
DISC
Michele Flammini, Mordechai Shalom, Shmuel Zaks
2006 — —
Optimal design problems for optical networks.
Mordechai Shalom
2005 B conf
Approximating the Traffic Grooming Problem.
ISAAC
Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
2005 B conf
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.
SIROCCO
Mordechai Shalom, Shmuel Zaks
2004 C conf
A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.
BROADNETS
Mordechai Shalom, Shmuel Zaks