×

zbMATH — the first resource for mathematics

Shalom, Mordechai

Compute Distance To:
Author ID: shalom.mordechai Recent zbMATH articles by "Shalom, Mordechai"
Published as: Shalom, Mordechai
External Links: ORCID
Documents Indexed: 57 Publications since 2005

Publications by Year

Citations contained in zbMATH

37 Publications have been cited 97 times in 48 Documents Cited by Year
Minimizing total busy time in parallel scheduling with application to optical networks. Zbl 1207.68110
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shachnai, Hadas; Shalom, Mordechai; Tamir, Tami; Zaks, Shmuel
14
2010
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
7
2010
Optimizing busy time on parallel machines. Zbl 1303.90050
Mertzios, George B.; Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Zaks, Shmuel
6
2015
Approximating the traffic grooming problem in tree and star networks. Zbl 1243.68028
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
6
2008
Profit maximization in flex-grid all-optical networks. Zbl 1406.68005
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
5
2013
Optimizing regenerator cost in traffic grooming. Zbl 1229.90032
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2011
Online regenerator placement. Zbl 1372.90034
Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
4
2017
On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479
Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel
4
2014
Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
4
2012
Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
4
2005
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172
Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel
3
2016
On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021
Shalom, Mordechai; Unger, Walter; Zaks, Shmuel
3
2007
On three extensions of equimatchable graphs. Zbl 1356.05106
Deniz, Zakir; Ekim, Tınaz; Hartinger, Tatiana Romina; Milanič, Martin; Shalom, Mordechai
2
2016
Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2016
Online optimization of busy time on parallel machines. Zbl 1304.90102
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
2
2014
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract). Zbl 1400.05163
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2013
Optimal on-line colorings for minimizing the number of ADMs in optical networks. Zbl 1186.90120
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2010
On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
Complexity of edge coloring with minimum reload/changeover costs. Zbl 1418.90070
Gözüpek, Didem; Shalom, Mordechai
1
2019
Equimatchable claw-free graphs. Zbl 1393.05203
Akbari, Saieed; Alizadeh, Hadi; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai
1
2018
The maximum cardinality cut problem in co-bipartite chain graphs. Zbl 1386.05184
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai
1
2018
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
1
2016
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\). Zbl 1343.05121
Dibek, Cemil; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai
1
2016
On the interval chromatic number of proper interval graphs. Zbl 1314.05080
Shalom, Mordechai
1
2015
On the complexity of the regenerator cost problem in general networks with traffic grooming. Zbl 1360.68507
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2014
On approximating the \(d\)-girth of a graph. Zbl 1285.05041
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2013
On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181
Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel
1
2013
On approximating the \(d\)-girth of a graph. Zbl 1298.68297
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2011
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology. Zbl 1274.68692
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2010
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
On minimizing the number of ADMs in a general topology optical network. Zbl 1211.05172
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
1
2009
Approximating the traffic grooming problem. Zbl 1160.90342
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
1
2008
Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
Optimal on-line colorings for minimizing the number of ADMs in optical networks. (Extended abstract). Zbl 1145.68335
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2007
Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2006
Complexity of edge coloring with minimum reload/changeover costs. Zbl 1418.90070
Gözüpek, Didem; Shalom, Mordechai
1
2019
Equimatchable claw-free graphs. Zbl 1393.05203
Akbari, Saieed; Alizadeh, Hadi; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai
1
2018
The maximum cardinality cut problem in co-bipartite chain graphs. Zbl 1386.05184
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai
1
2018
Online regenerator placement. Zbl 1372.90034
Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
4
2017
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172
Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel
3
2016
On three extensions of equimatchable graphs. Zbl 1356.05106
Deniz, Zakir; Ekim, Tınaz; Hartinger, Tatiana Romina; Milanič, Martin; Shalom, Mordechai
2
2016
Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2016
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
1
2016
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\). Zbl 1343.05121
Dibek, Cemil; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai
1
2016
Optimizing busy time on parallel machines. Zbl 1303.90050
Mertzios, George B.; Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Zaks, Shmuel
6
2015
On the interval chromatic number of proper interval graphs. Zbl 1314.05080
Shalom, Mordechai
1
2015
On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479
Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel
4
2014
Online optimization of busy time on parallel machines. Zbl 1304.90102
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
2
2014
On the complexity of the regenerator cost problem in general networks with traffic grooming. Zbl 1360.68507
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2014
Profit maximization in flex-grid all-optical networks. Zbl 1406.68005
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
5
2013
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract). Zbl 1400.05163
Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel
2
2013
On approximating the \(d\)-girth of a graph. Zbl 1285.05041
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2013
On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181
Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel
1
2013
Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053
Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel
4
2012
Optimizing regenerator cost in traffic grooming. Zbl 1229.90032
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
5
2011
On approximating the \(d\)-girth of a graph. Zbl 1298.68297
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2011
Minimizing total busy time in parallel scheduling with application to optical networks. Zbl 1207.68110
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shachnai, Hadas; Shalom, Mordechai; Tamir, Tami; Zaks, Shmuel
14
2010
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
7
2010
Optimal on-line colorings for minimizing the number of ADMs in optical networks. Zbl 1186.90120
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
2
2010
On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology. Zbl 1274.68692
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2010
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
On minimizing the number of ADMs in a general topology optical network. Zbl 1211.05172
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
1
2009
Approximating the traffic grooming problem in tree and star networks. Zbl 1243.68028
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
6
2008
Approximating the traffic grooming problem. Zbl 1160.90342
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340
Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel
1
2008
Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2008
On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021
Shalom, Mordechai; Unger, Walter; Zaks, Shmuel
3
2007
On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017
Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel
2
2007
Optimal on-line colorings for minimizing the number of ADMs in optical networks. (Extended abstract). Zbl 1145.68335
Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel
1
2007
Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332
Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
1
2006
Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089
Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
4
2005

Citations by Year