| 2025 | SSS | Brief Announcement: The Steiner Shortest Path Tree Problem. | Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber |
| 2024 | NCA | Steiner Trees Composition and Scalable Video Coding for Satelite Video Multicast. | Alex Binun, Yefim Dinitz, Shlomi Dolev, Ofer Hadar, Adnan Jaber, Shevach Riabtsev |
| 2024 | SoCS | Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. | Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz |
| 2024 | SSS | Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. | Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber |
| 2020 | SSS | Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. | Yefim Dinitz, Shlomi Dolev, Manish Kumar |
| 2018 | SIROCCO | Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. | Yefim Dinitz, Shlomi Dolev, Daniel Khankin |
| 2017 | NCA | Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). | Yefim Dinitz, Shlomi Dolev, Daniel Khankin |
| 2014 | ECCB | 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 |
| 2012 | WABI | RNA Tree Comparisons via Unrooted Unordered Alignments. | Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson |
| 2008 | FOCS | Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. | Yefim Dinitz, Michael Elkin, Shay Solomon |
| 2007 | SOFSEM | On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. | Yefim Dinitz, Shay Solomon |
| 2006 | ISAAC | Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. | Yefim Dinitz, Shay Solomon |
| 2005 | SIROCCO | Two Absolute Bounds for Distributed Bit Complexity. | Yefim Dinitz, Noam Solomon |
| 2001 | WG | Planarity of the 2-Level Cactus Model. | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
| 2000 | SIROCCO | Exact communication costs for consensus and leader in a tree. | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum |
| 1999 | STOC | Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum |
| 1999 | SPAA | Some Compact Layouts of the Butterfly. | Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky |
| 1998 | FOCS | On the Single-Source Unsplittable Flow Problem. | Yefim Dinitz, Naveen Garg, Michel X. Goemans |
| 1997 | CIAC | Finding Optimum | Yefim Dinitz, Zeev Nutov |
| 1997 | WG | On Optimal Graphs Embedded into Path and Rings, with Analysis Using l | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks |
| 1995 | SODA | Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. | Yefim Dinitz, Alek Vainshtein |
| 1995 | STOC | 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 |
| 1994 | STOC | The connectivity carcass of a vertex subset in a graph and its incremental maintenance. | Yefim Dinitz, Alek Vainshtein |
| 1992 | WG | The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. | Yefim Dinitz |