Follow
Mordechai Shalom
Mordechai Shalom
Tel Hai Academic College
Verified email at telhai.ac.il
Title
Cited by
Cited by
Year
Minimizing total busy time in parallel scheduling with application to optical networks
M Flammini, G Monaco, L Moscardelli, H Shachnai, M Shalom, T Tamir, ...
Theoretical Computer Science 411 (40-42), 3553-3562, 2010
752010
Optimizing busy time on parallel machines
GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks
Theoretical Computer Science 562, 524-541, 2015
462015
A 10/7+/spl epsi/approximation for minimizing the number of ADMs in SONET rings
M Shalom, S Zaks
First International Conference on Broadband Networks, 254-262, 2004
372004
Online optimization of busy time on parallel machines
M Shalom, A Voloshin, PWH Wong, FCC Yung, S Zaks
Theoretical Computer Science 560, 190-206, 2014
362014
Online coalition structure generation in graph games
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Proceedings of the 17th International Conference on Autonomous Agents and …, 2018
232018
Placing regenerators in optical networks to satisfy multiple sets of requests
GB Mertzios, I Sau, M Shalom, S Zaks
IEEE/ACM Transactions on Networking 20 (6), 1870-1879, 2012
232012
Placing regenerators in optical networks to satisfy multiple sets of requests
GB Mertzios, I Sau, M Shalom, S Zaks
IEEE/ACM Transactions on Networking 20 (6), 1870-1879, 2012
232012
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
International Symposium on Algorithms and Computation, 915-924, 2005
222005
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
Journal of Discrete Algorithms 6 (3), 472-479, 2008
162008
Approximating the traffic grooming problem with respect to adms and oadms
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
European Conference on Parallel Processing, 920-929, 2008
162008
On the complexity of the traffic grooming problem in optical networks
M Shalom, W Unger, S Zaks
International Conference on Fun with Algorithms, 262-271, 2007
152007
On minimizing the number of adms in a general topology optical network
M Flammini, M Shalom, S Zaks
International Symposium on Distributed Computing, 459-473, 2006
152006
Online regenerator placement
GB Mertzios, M Shalom, PWH Wong, S Zaks
International Conference On Principles Of Distributed Systems, 4-17, 2011
14*2011
A graph-theoretic approach to scheduling in cognitive radio networks
D Gözüpek, M Shalom, F Alagöz
IEEE/ACM Transactions on Networking 23 (1), 317-328, 2014
132014
Profit maximization in flex-grid all-optical networks
M Shalom, PWH Wong, S Zaks
International Colloquium on Structural Information and Communication …, 2013
132013
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
A Boyacı, T Ekim, M Shalom, S Zaks
Discrete Applied Mathematics 215, 47-60, 2016
102016
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I
A Boyacı, T Ekim, M Shalom, S Zaks
Discrete Applied Mathematics 215, 47-60, 2016
102016
Optimizing regenerator cost in traffic grooming
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Theoretical Computer Science 412 (52), 7109-7121, 2011
102011
A 10/7 + Approximation for Minimizing the Number of ADMs in SONET Rings
M Shalom, S Zaks
IEEE/ACM Transactions on Networking 15 (6), 1593-1602, 2007
102007
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
A Boyacı, T Ekim, M Shalom
Information Processing Letters 121, 29-33, 2017
92017
The system can't perform the operation now. Try again later.
Articles 1–20