( en | de | ru )

 

Disambiguation of "Shalom, Mordechai"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the Traffic Grooming Problem in Tree and Star Networks.

, , , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 147-158. Springer, (2006)

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

Edge Coloring with Minimum Reload/Changeover Costs., and . CoRR, (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)Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem., , , , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 404-411. Springer, (2007)Complexity of edge coloring with minimum reload/changeover costs., and . Networks, 73 (3): 344-357 (2019)On Approximating the d-Girth of a Graph., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 467-481. Springer, (2011)Approximating the Traffic Grooming Problem in Tree and Star Networks., , , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 147-158. Springer, (2006)Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II., , , and . Discret. Math. Theor. Comput. Sci., (2018)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 Three Extensions of Equimatchable Graphs., , , , and . Electron. Notes Discret. Math., (2016)