( en | de | ru )

 

Disambiguation of "Shalom, Mordechai"

Author of the publication

copydeleteadd this publication to your clipboard
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.

, , , and . Theor. Comput. Sci., (2016)

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

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)Edge Coloring with Minimum Reload/Changeover Costs., and . CoRR, (2016)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)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)On-line maximum matching in complete multi-partite graphs with an application to optical networks., , and . Discret. Appl. Math., (2016)On the complexity of the regenerator location problem treewidth and other parameters., , and . Discret. Appl. Math., (2016)The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation., , , , and . Algorithms, 14 (5): 151 (2021)