( en | de | ru )

 

Disambiguation of "Shalom, Mordechai"

Author of the publication

copydeleteadd this publication to your clipboard
Online Regenerator Placement.

, , , and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mordechai Eliav

 

Other publications of authors with the same name

On Approximating the d-Girth of a Graph., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 467-481. Springer, (2011)On Three Extensions of Equimatchable Graphs., , , , and . Electron. Notes Discret. Math., (2016)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 21-34. Springer, (2019)Edge Coloring with Minimum Reload/Changeover Costs., and . CoRR, (2016)Selfishness, collusion and power of local search for the ADMs minimization problem., , , , and . Comput. Networks, 52 (9): 1721-1731 (2008)A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks., , and . IEEE/ACM Trans. Netw., 23 (1): 317-328 (2015)On the Online Coalition Structure Generation Problem., , , , and . J. Artif. Intell. Res., (2021)Optimal on-line colorings for minimizing the number of ADMs in optical networks., , and . J. Discrete Algorithms, 8 (2): 174-188 (2010)Approximating the traffic grooming problem in tree and star networks., , , , and . J. Parallel Distributed Comput., 68 (7): 939-948 (2008)On the complexity of constructing minimum changeover cost arborescences., , , and . Theor. Comput. Sci., (2014)