The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. - Yefim Dinitz (WG, 1992)

Maintaining the 4-Edge-Connected Components of a Graph On-Line. - Yefim Dinitz (ISTCS, 1993)

The connectivity carcass of a vertex subset in a graph and its incremental maintenance. - Yefim Dinitz; Alek Vainshtein (STOC, 1994)

Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. - Yefim Dinitz; Alek Vainshtein (SODA, 1995)

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. - Yefim Dinitz; Zeev Nutov (STOC, 1995)

Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. - Yefim Dinitz; Zeev Nutov (CIAC, 1997)

On the totalk-diameter of connection networks. - Yefim Dinitz; Tamar Eilam; Shlomo Moran; Shmuel Zaks (ISTCS, 1997)

On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. - Yefim Dinitz; Marcelo Feighelstein; Shmuel Zaks (WG, 1997)

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. - Yefim Dinitz; Jeffery R. Westbrook (Algorithmica, 1998)

Some Compact Layouts of the Butterfly. - Yefim Dinitz; Shimon Even; Roni Kupershtok; Maria Zapolotsky (SPAA, 1999)

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). - Yefim Dinitz; Shlomo Moran; Sergio Rajsbaum (STOC, 1999)

On the Single-Source Unsplittable Flow Problem. - Yefim Dinitz; Naveen Garg 001; Michel X. Goemans (Comb., 1999)

On an Algorithm of Zemlyachenko for Subtree Isomorphism. - Yefim Dinitz; Alon Itai; Michael Rodeh (Inf. Process. Lett., 1999)

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. - Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente (J. Algorithms, 1999)

A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. - Yefim Dinitz; Zeev Nutov (J. Algorithms, 1999)

Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. - Yefim Dinitz; Ronit Nossenson (SWAT, 2000)

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. - Yefim Dinitz; Alek Vainshtein (SIAM J. Comput., 2000)

On the totalk-diameter of connection networks. - Yefim Dinitz; Tamar Eilam; Shlomo Moran; Shmuel Zaks (Theor. Comput. Sci., 2000)

Planarity of the 2-Level Cactus Model. - Sabine Cornelsen; Yefim Dinitz; Dorothea Wagner (WG, 2001)

Exact communication costs for consensus and leader in a tree. - Yefim Dinitz; Shlomo Moran; Sergio Rajsbaum (J. Discrete Algorithms, 2003)

A Compact Layout of the Butterfly. - Yefim Dinitz; Shimon Even; Maria Zapolotsky (J. Interconnect. Networks, 2003)

Dinitz' Algorithm: The Original Version and Even's Version. - Yefim Dinitz (Essays in Memory of Shimon Even, 2006)

Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. - Yefim Dinitz; Shay Solomon (ISAAC, 2006)

Two-dimensional mapping for wireless OFDMA systems. - Yehuda Ben-Shimol; Itzik Kitroser; Yefim Dinitz (IEEE Trans. Broadcast., 2006)

Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. - Boaz Ben-Moshe; Yefim Dinitz (CCCG, 2007)

On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. - Yefim Dinitz; Shay Solomon (SOFSEM (1), 2007)

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. - Maria Artishchev-Zapolotsky; Yefim Dinitz; Shimon Even; Vladimir Yanovski (J. Interconnect. Networks, 2007)

Two absolute bounds for distributed bit complexity. - Yefim Dinitz; Noam Solomon (Theor. Comput. Sci., 2007)

Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. - Yefim Dinitz; Michael Elkin; Shay Solomon (FOCS, 2008)

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners - Yefim Dinitz; Michael Elkin; Shay Solomon (CoRR, 2008)

Bit complexity of breaking and achieving symmetry in chains and rings. - Yefim Dinitz; Shlomo Moran; Sergio Rajsbaum (J. ACM, 2008)

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. - Yefim Dinitz; Shay Solomon (ACM Trans. Algorithms, 2008)

Guarding Rectangular Partitions. - Yefim Dinitz; Matthew J. Katz; Roi Krakovski (Int. J. Comput. Geom. Appl., 2009)

Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. - Yefim Dinitz; Michael Elkin; Shay Solomon (Discret. Comput. Geom., 2010)

RNA Tree Comparisons via Unrooted Unordered Alignments. - Nimrod Milo; Shay Zakov; Erez Katzenelson; Eitan Bachmat; Yefim Dinitz; Michal Ziv-Ukelson (WABI, 2012)

Unrooted unordered homeomorphic subtree alignment of RNA trees. - Nimrod Milo; Shay Zakov; Erez Katzenelson; Eitan Bachmat; Yefim Dinitz; Michal Ziv-Ukelson (Algorithms Mol. Biol., 2013)

Recent Results on Three Problems in Comparative Structural RNAomics. - Shay Zakov; Nimrod Milo; Tamar Pinhas; Sivan Yogev; Erez Katzenelson; Eitan Bachmat; Yefim Dinitz; Dekel Tsur; Michal Ziv-Ukelson (CMSR@ECCB, 2014)

Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). - Yefim Dinitz; Shlomi Dolev; Daniel Khankin (NCA, 2017)

Hybrid Bellman-Ford-Dijkstra algorithm. - Yefim Dinitz; Rotem Itzhak (J. Discrete Algorithms, 2017)

Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. - Yefim Dinitz; Shlomi Dolev; Daniel Khankin (SIROCCO, 2018)

Network Cloudification - (Extended Abstract). - Yefim Dinitz; Shlomi Dolev; Sergey Frenkel; Alex Binun; Daniel Khankin (CSCML, 2019)

Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (SSS, 2020)

Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CoRR, 2020)

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract). - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CSCML, 2021)

Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (CoRR, 2021)

Partially Disjoint k Shortest Paths. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011; Baruch Schieber (CoRR, 2022)

On Existence of Must-Include Paths and Cycles in Undirected Graphs. - Yefim Dinitz; Solomon Eyal Shimony (CoRR, 2023)

Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011 (Theory Comput. Syst., 2023)

Steiner Trees Composition and Scalable Video Coding for Satelite Video Multicast. - Alex Binun; Yefim Dinitz; Shlomi Dolev; Ofer Hadar; Adnan Jaber; Shevach Riabtsev (NCA, 2024)

Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. - Gal Dahan; Itay Tabib; Solomon Eyal Shimony; Yefim Dinitz (SOCS, 2024)

Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. - Yefim Dinitz; Shlomi Dolev; Manish Kumar 011; Baruch Schieber (SSS, 2024)