Edit Profile Shalom, Mordechai Compute Distance To: Compute Author ID: shalom.mordechai Published as: Shalom, Mordechai External Links: ORCID Documents Indexed: 57 Publications since 2005 all top 5 Co-Authors 1 single-authored 42 Zaks, Shmuel 13 Flammini, Michele 12 Wong, Prudence Wai-Ha 11 Ekim, Tınaz 10 Gözüpek, Didem 9 Moscardelli, Luca 8 Sau, Ignasi 7 Boyacı, Arman 7 Monaco, Gianpiero 4 Voloshin, Ariella 3 Chernoy, Viacheslav 3 Mertzios, George B. 3 Ozkan, Sibel 3 Paul, Christophe 2 Baste, Julien 2 Deniz, Zakir 2 Erlebach, Thomas 2 Hartinger, Tatiana Romina 2 Hartstein, Itamar 2 Liu, Fu-Hong 2 Liu, Hsiang-Hsuan 2 Milanič, Martin 2 Peleg, David 2 Shachnai, Hadas 2 Thilikos, Dimitrios M. 2 Yung, Fencol C. C. 1 Akbari, Saieed 1 Alizadeh, Hadi 1 Büyükçolak, Yasemin 1 Cinkler, Tibor 1 Coudert, David 1 Dibek, Cemil 1 Muñoz, Xavier 1 Tamir, Tami 1 Unger, Walter all top 5 Serials 10 Theoretical Computer Science 6 Discrete Applied Mathematics 3 Discrete Mathematics 2 Journal of Parallel and Distributed Computing 2 Theory of Computing Systems 2 Discrete Mathematics and Theoretical Computer Science. DMTCS 2 Journal of Discrete Algorithms 1 Information Processing Letters 1 Networks 1 Algorithmica 1 Distributed Computing 1 Journal of Combinatorial Optimization 1 Computer Networks 1 Discrete Optimization Fields 44 Computer science (68-XX) 23 Combinatorics (05-XX) 16 Operations research, mathematical programming (90-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications 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.68110Flammini, 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.68014Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel 7 2010 Optimizing busy time on parallel machines. Zbl 1303.90050Mertzios, 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.68028Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 6 2008 Profit maximization in flex-grid all-optical networks. Zbl 1406.68005Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 5 2013 Optimizing regenerator cost in traffic grooming. Zbl 1229.90032Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 5 2011 Online regenerator placement. Zbl 1372.90034Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 4 2017 On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel 4 2014 Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel 4 2012 Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 4 2005 Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel 3 2016 On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021Shalom, Mordechai; Unger, Walter; Zaks, Shmuel 3 2007 On three extensions of equimatchable graphs. Zbl 1356.05106Deniz, Zakir; Ekim, Tınaz; Hartinger, Tatiana Romina; Milanič, Martin; Shalom, Mordechai 2 2016 Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel 2 2016 Online optimization of busy time on parallel machines. Zbl 1304.90102Shalom, 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.05163Boyacı, 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.90120Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 2 2010 On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 2 2007 On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 2 2007 Complexity of edge coloring with minimum reload/changeover costs. Zbl 1418.90070Gözüpek, Didem; Shalom, Mordechai 1 2019 Equimatchable claw-free graphs. Zbl 1393.05203Akbari, 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.05184Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai 1 2018 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gö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.05121Dibek, Cemil; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai 1 2016 On the interval chromatic number of proper interval graphs. Zbl 1314.05080Shalom, Mordechai 1 2015 On the complexity of the regenerator cost problem in general networks with traffic grooming. Zbl 1360.68507Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2014 On approximating the \(d\)-girth of a graph. Zbl 1285.05041Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2013 On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel 1 2013 On approximating the \(d\)-girth of a graph. Zbl 1298.68297Peleg, 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.68692Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 1 2010 Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027Cinkler, 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.05172Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 1 2009 Approximating the traffic grooming problem. Zbl 1160.90342Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2008 On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel 1 2008 Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324Flammini, 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.68335Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 1 2007 Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2006 Complexity of edge coloring with minimum reload/changeover costs. Zbl 1418.90070Gözüpek, Didem; Shalom, Mordechai 1 2019 Equimatchable claw-free graphs. Zbl 1393.05203Akbari, 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.05184Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai 1 2018 Online regenerator placement. Zbl 1372.90034Mertzios, George B.; Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 4 2017 Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Zbl 1335.05172Gözüpek, Didem; Shachnai, Hadas; Shalom, Mordechai; Zaks, Shmuel 3 2016 On three extensions of equimatchable graphs. Zbl 1356.05106Deniz, Zakir; Ekim, Tınaz; Hartinger, Tatiana Romina; Milanič, Martin; Shalom, Mordechai 2 2016 Graphs of edge-intersecting and non-splitting paths. Zbl 1339.05410Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel 2 2016 Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068Gö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.05121Dibek, Cemil; Ekim, Tınaz; Gözüpek, Didem; Shalom, Mordechai 1 2016 Optimizing busy time on parallel machines. Zbl 1303.90050Mertzios, 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.05080Shalom, Mordechai 1 2015 On the complexity of constructing minimum changeover cost arborescences. Zbl 1360.68479Gözüpek, Didem; Shalom, Mordechai; Voloshin, Ariella; Zaks, Shmuel 4 2014 Online optimization of busy time on parallel machines. Zbl 1304.90102Shalom, 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.68507Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2014 Profit maximization in flex-grid all-optical networks. Zbl 1406.68005Shalom, 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.05163Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai; Zaks, Shmuel 2 2013 On approximating the \(d\)-girth of a graph. Zbl 1285.05041Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2013 On the complexity of the regenerator location problem – treewidth and other parameters (extended abstract). Zbl 1394.68181Hartstein, Itamar; Shalom, Mordechai; Zaks, Shmuel 1 2013 Online optimization of busy time on parallel machines. (Extended abstract). Zbl 1354.90053Shalom, Mordechai; Voloshin, Ariella; Wong, Prudence W. H.; Yung, Fencol C. C.; Zaks, Shmuel 4 2012 Optimizing regenerator cost in traffic grooming. Zbl 1229.90032Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 5 2011 On approximating the \(d\)-girth of a graph. Zbl 1298.68297Peleg, David; Sau, Ignasi; Shalom, Mordechai 1 2011 Minimizing total busy time in parallel scheduling with application to optical networks. Zbl 1207.68110Flammini, 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.68014Mertzios, 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.90120Shalom, 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.68692Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 1 2010 Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027Cinkler, 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.05172Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 1 2009 Approximating the traffic grooming problem in tree and star networks. Zbl 1243.68028Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 6 2008 Approximating the traffic grooming problem. Zbl 1160.90342Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2008 On the performance of Beauquier and Debas’ self-stabilizing algorithm for mutual exclusion. Zbl 1143.68340Chernoy, Viacheslav; Shalom, Mordechai; Zaks, Shmuel 1 2008 Selfishness, collusion and power of local search for the ADMs minimization problem. Zbl 1154.68324Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2008 On the complexity of the traffic grooming problem in optical networks. Zbl 1201.68021Shalom, Mordechai; Unger, Walter; Zaks, Shmuel 3 2007 On minimizing the number of ADMs in a general topology optical network. Zbl 1155.68312Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 2 2007 On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing. Zbl 1115.68017Flammini, Michele; Shalom, Mordechai; Zaks, Shmuel 2 2007 Optimal on-line colorings for minimizing the number of ADMs in optical networks. (Extended abstract). Zbl 1145.68335Shalom, Mordechai; Wong, Prudence W. H.; Zaks, Shmuel 1 2007 Approximating the traffic grooming problem in tree and star networks. (Extended abstract). Zbl 1167.68332Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 1 2006 Approximating the traffic grooming problem. (Extended abstract). Zbl 1175.90089Flammini, Michele; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel 4 2005 all cited Publications top 5 cited Publications all top 5 Cited by 67 Authors 26 Shalom, Mordechai 20 Zaks, Shmuel 7 Sau, Ignasi 7 Wong, Prudence Wai-Ha 6 Ekim, Tınaz 6 Shachnai, Hadas 5 Flammini, Michele 5 Moscardelli, Luca 5 Voloshin, Ariella 4 Boyacı, Arman 4 Gözüpek, Didem 4 Monaco, Gianpiero 3 Paul, Christophe 3 Tamir, Tami 2 Abed, Fidaa 2 Deniz, Zakir 2 Disser, Yann 2 Epstein, Leah 2 Groß, Martin 2 Levin, Asaf 2 Li, Minming 2 Megow, Nicole 2 Meißner, Julie 2 Mertzios, George B. 2 Ozkan, Sibel 2 Peleg, David 2 Raghavan, S. Raghu 2 Richter, Alexander T. 2 Rischke, Roman 2 Schieber, Baruch 1 Amini, Omid 1 Aneja, Yash P. 1 Baste, Julien 1 Bermond, Jean-Claude 1 Chang, Jessica Y. 1 Chau, Vincent 1 Chen, Lin 1 Chen, Lin 1 Chen, Si 1 Chernoy, Viacheslav 1 Erlebach, Thomas 1 Fong, Ken C. K. 1 Hartinger, Tatiana Romina 1 Hartstein, Itamar 1 Katz, Dmitry 1 Khandekar, Rohit 1 Khuller, Samir 1 Levit, Vadim E. 1 Li, Xiangyong 1 Li, Yungao 1 Liu, Fu-Hong 1 Liu, Hsiang-Hsuan 1 Ljubić, Ivana 1 Mandrescu, Eugen 1 Menahem, Betzalel 1 Milanič, Martin 1 Moataz, Fatima Zahra 1 Mukherjee, Koyel 1 Muñoz, Xavier 1 Pérennes, Stéphane 1 Poon, Sheung-Hung 1 Rawitz, Dror 1 Stanojević, Daliborka 1 Thilikos, Dimitrios M. 1 Wu, Weiwei 1 Yung, Fencol C. C. 1 Zhao, Yingchao all top 5 Cited in 16 Serials 10 Theoretical Computer Science 7 Discrete Applied Mathematics 3 Algorithmica 3 Journal of Scheduling 3 Journal of Discrete Algorithms 1 Discrete Mathematics 1 Information Processing Letters 1 Computing 1 Journal of Parallel and Distributed Computing 1 European Journal of Operational Research 1 Distributed Computing 1 INFORMS Journal on Computing 1 Theory of Computing Systems 1 Journal of Combinatorial Optimization 1 Discrete Optimization 1 Journal of Mathematical Modelling and Algorithms in Operations Research all top 5 Cited in 6 Fields 35 Computer science (68-XX) 21 Operations research, mathematical programming (90-XX) 16 Combinatorics (05-XX) 3 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 Numerical analysis (65-XX) 1 Optics, electromagnetic theory (78-XX) Citations by Year