Yefim Dinitz

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 12

Top Topics

Extended Abstract

Dijkstra Algorithm

Top Venues

Theory Comput. Syst.

Publications

Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. SOCS (2024)
Yefim Dinitz, Solomon Eyal Shimony
On Existence of Must-Include Paths and Cycles in Undirected Graphs. CoRR (2023)
Yefim Dinitz, Shlomi Dolev, Manish Kumar
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput. Syst. 67 (2) (2023)
Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber
Partially Disjoint k Shortest Paths. CoRR (2022)
Yefim Dinitz, Shlomi Dolev, Manish Kumar
Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. CoRR (2021)
Yefim Dinitz, Shlomi Dolev, Manish Kumar
Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract). CSCML (2021)
Yefim Dinitz, Shlomi Dolev, Manish Kumar
Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. CoRR (2020)
Yefim Dinitz, Shlomi Dolev, Manish Kumar
Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. SSS (2020)
Yefim Dinitz, Shlomi Dolev, Sergey Frenkel, Alex Binun, Daniel Khankin
Network Cloudification - (Extended Abstract). CSCML (2019)
Yefim Dinitz, Shlomi Dolev, Daniel Khankin
Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. SIROCCO (2018)
Yefim Dinitz, Shlomi Dolev, Daniel Khankin
Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). NCA (2017)
Yefim Dinitz, Rotem Itzhak
Hybrid Bellman-Ford-Dijkstra algorithm. J. Discrete Algorithms 42 (2017)
Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson
Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB (2014)
Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson
Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. 8 (2013)
Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson
RNA Tree Comparisons via Unrooted Unordered Alignments. WABI (2012)
Yefim Dinitz, Michael Elkin, Shay Solomon
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discret. Comput. Geom. 43 (4) (2010)
Yefim Dinitz, Matthew J. Katz, Roi Krakovski
Guarding Rectangular Partitions. Int. J. Comput. Geom. Appl. 19 (6) (2009)
Yefim Dinitz, Michael Elkin, Shay Solomon
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR (2008)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55 (1) (2008)
Yefim Dinitz, Shay Solomon
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms 4 (3) (2008)
Yefim Dinitz, Michael Elkin, Shay Solomon
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS (2008)
Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks 8 (2) (2007)
Boaz Ben-Moshe, Yefim Dinitz
Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. CCCG (2007)
Yefim Dinitz, Noam Solomon
Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384 (2-3) (2007)
Yefim Dinitz, Shay Solomon
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) (2007)
Yehuda Ben-Shimol, Itzik Kitroser, Yefim Dinitz
Two-dimensional mapping for wireless OFDMA systems. IEEE Trans. Broadcast. 52 (3) (2006)
Yefim Dinitz, Shay Solomon
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC (2006)
Yefim Dinitz
Dinitz' Algorithm: The Original Version and Even's Version. Essays in Memory of Shimon Even (2006)
Yefim Dinitz, Noam Solomon
Two Absolute Bounds for Distributed Bit Complexity. SIROCCO (2005)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1 (2) (2003)
Yefim Dinitz, Shimon Even, Maria Zapolotsky
A Compact Layout of the Butterfly. J. Interconnect. Networks 4 (1) (2003)
Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
Planarity of the 2-Level Cactus Model. WG (2001)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Exact communication costs for consensus and leader in a tree. SIROCCO (2000)
Yefim Dinitz, Alek Vainshtein
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. SIAM J. Comput. 30 (3) (2000)
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
On the totalk-diameter of connection networks. Theor. Comput. Sci. 247 (1-2) (2000)
Yefim Dinitz, Ronit Nossenson
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. SWAT (2000)
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC (1999)
Yefim Dinitz, Naveen Garg, Michel X. Goemans
On the Single-Source Unsplittable Flow Problem. Comb. 19 (1) (1999)
Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
Some Compact Layouts of the Butterfly. SPAA (1999)
Yefim Dinitz, Alon Itai, Michael Rodeh
On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. 70 (3) (1999)
Yefim Dinitz, Zeev Nutov
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms 32 (1) (1999)
Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. J. Algorithms 32 (1) (1999)
Yefim Dinitz, Naveen Garg, Michel X. Goemans
On the Single-Source Unsplittable Flow Problem. FOCS (1998)
Yefim Dinitz, Jeffery R. Westbrook
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. Algorithmica 20 (3) (1998)
Yefim Dinitz, Zeev Nutov
=3, 4, 5. CIAC (1997)
Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
-diameter of connection networks. ISTCS (1997)
Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
-Spheres. WG (1997)
Yefim Dinitz, Zeev Nutov
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. STOC (1995)
Yefim Dinitz, Alek Vainshtein
Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. SODA (1995)
Yefim Dinitz, Alek Vainshtein
The connectivity carcass of a vertex subset in a graph and its incremental maintenance. STOC (1994)
Yefim Dinitz
Maintaining the 4-Edge-Connected Components of a Graph On-Line. ISTCS (1993)
Yefim Dinitz
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG (1992)