( en | de | ru )

 

Disambiguation of "Dinitz, Yefim"

Author of the publication

copydeleteadd this publication to your clipboard
On the totalk-diameter of connection networks.

, , , and . Theor. Comput. Sci., 247 (1-2): 213-228 (2000)

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.

Yevgen Yefimenko

 

Other publications of authors with the same name

On an Algorithm of Zemlyachenko for Subtree Isomorphism., , and . Inf. Process. Lett., 70 (3): 141-146 (1999)RNA Tree Comparisons via Unrooted Unordered Alignments., , , , , and . WABI, volume 7534 of Lecture Notes in Computer Science, page 135-148. Springer, (2012)Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem., and . ACM Trans. Algorithms, 4 (3): 25:1-25:9 (2008)Planarity of the 2-Level Cactus Model., , and . WG, volume 2204 of Lecture Notes in Computer Science, page 91-102. Springer, (2001)Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line., and . Algorithmica, 20 (3): 242-276 (1998)The connectivity carcass of a vertex subset in a graph and its incremental maintenance., and . STOC, page 716-725. ACM, (1994)Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph., and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 272-285. Springer, (2000)Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths., , and . CoRR, (2021)On Optimal Solutions for the Bottleneck Tower of Hanoi Problem., and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 248-259. Springer, (2007)Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract)., , and . CSCML, volume 12716 of Lecture Notes in Computer Science, page 266-274. Springer, (2021)