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
612010
Optimizing busy time on parallel machines
GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks
Theoretical Computer Science 562, 524-541, 2015
342015
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
342004
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
292014
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
International Symposium on Algorithms and Computation, 915-924, 2005
232005
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
222012
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
222012
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 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
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
Journal of Discrete Algorithms 6 (3), 472-479, 2008
142008
Online regenerator placement
GB Mertzios, M Shalom, PWH Wong, S Zaks
International Conference On Principles Of Distributed Systems, 4-17, 2011
13*2011
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
122007
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
112014
Profit maximization in flex-grid all-optical networks
M Shalom, PWH Wong, S Zaks
Theory of Computing Systems, 1-16, 2019
102019
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
102018
On the interval chromatic number of proper interval graphs
M Shalom
Discrete Mathematics 338 (11), 1907-1916, 2015
102015
Approximating the traffic grooming problem in tree and star networks
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
International Workshop on Graph-Theoretic Concepts in Computer Science, 147-158, 2006
102006
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
92007
On the complexity of constructing minimum changeover cost arborescences
D Gözüpek, M Shalom, A Voloshin, S Zaks
Theoretical Computer Science 540, 40-52, 2014
82014
Optimizing regenerator cost in traffic grooming
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Theoretical Computer Science 412 (52), 7109-7121, 2011
82011
The system can't perform the operation now. Try again later.
Articles 1–20