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
802010
Optimizing busy time on parallel machines
GB Mertzios, M Shalom, A Voloshin, PWH Wong, S Zaks
Theoretical Computer Science 562, 524-541, 2015
482015
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
392014
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
382004
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
242018
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
242012
Approximating the traffic grooming problem
M Flammini, L Moscardelli, M Shalom, S Zaks
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005
212005
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 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
162006
Online regenerator placement
GB Mertzios, M Shalom, PWH Wong, S Zaks
International Conference On Principles Of Distributed Systems, 4-17, 2011
15*2011
On the complexity of the traffic grooming problem in optical networks
M Shalom, W Unger, S Zaks
Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello …, 2007
152007
Profit maximization in flex-grid all-optical networks
M Shalom, PWH Wong, S Zaks
Structural Information and Communication Complexity: 20th International …, 2013
142013
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
132017
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
The maximum cardinality cut problem in co-bipartite chain graphs
A Boyacı, T Ekim, M Shalom
Journal of Combinatorial Optimization 35, 250-265, 2018
122018
On the online coalition structure generation problem
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Journal of Artificial Intelligence Research 72, 1215-1250, 2021
102021
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
Approximating the traffic grooming problem in tree and star networks
M Flammini, G Monaco, L Moscardelli, M Shalom, S Zaks
Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006
102006
The system can't perform the operation now. Try again later.
Articles 1–20