Yefim Dinitz

According to our database, Yefim Dinitz authored at least 50 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Partially Disjoint Shortest Paths and Near-Shortest Paths Trees.

Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees.

Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

2023

Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs.

Yefim Dinitz, Shlomi Dolev, Manish Kumar

Theory Comput. Syst., April, 2023

On Existence of Must-Include Paths and Cycles in Undirected Graphs.

Yefim Dinitz, Solomon Eyal Shimony

CoRR, 2023

2022

Partially Disjoint k Shortest Paths.

Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber

CoRR, 2022

2021

Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths.

Yefim Dinitz, Shlomi Dolev, Manish Kumar

CoRR, 2021

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract).

Yefim Dinitz, Shlomi Dolev, Manish Kumar

Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020

Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.

Yefim Dinitz, Shlomi Dolev, Manish Kumar

CoRR, 2020

Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.

Yefim Dinitz, Shlomi Dolev, Manish Kumar

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

2019

Network Cloudification - (Extended Abstract).

Yefim Dinitz, Shlomi Dolev, Sergey Frenkel, Alex Binun, Daniel Khankin

Proceedings of the Cyber Security Cryptography and Machine Learning, 2019

2018

Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN.

Yefim Dinitz, Shlomi Dolev, Daniel Khankin

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Hybrid Bellman-Ford-Dijkstra algorithm.

Yefim Dinitz, Rotem Itzhak

J. Discrete Algorithms, 2017

Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract).

Yefim Dinitz, Shlomi Dolev, Daniel Khankin

Proceedings of the 16th IEEE International Symposium on Network Computing and Applications, 2017

2014

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

Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014

2013

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

2012

RNA Tree Comparisons via Unrooted Unordered Alignments.

Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2010

Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.

Yefim Dinitz, Michael Elkin, Shay Solomon

Discret. Comput. Geom., 2010

2009

Guarding Rectangular Partitions.

Yefim Dinitz, Matthew J. Katz, Roi Krakovski

Int. J. Comput. Geom. Appl., 2009

2008

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.

Yefim Dinitz, Shay Solomon

ACM Trans. Algorithms, 2008

Bit complexity of breaking and achieving symmetry in chains and rings.

Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum

J. ACM, 2008

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners

Yefim Dinitz, Michael Elkin, Shay Solomon

CoRR, 2008

Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.

Yefim Dinitz, Michael Elkin, Shay Solomon

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Two absolute bounds for distributed bit complexity.

Yefim Dinitz, Noam Solomon

Theor. Comput. Sci., 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

On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.

Yefim Dinitz, Shay Solomon

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies.

Boaz Ben-Moshe, Yefim Dinitz

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Two-dimensional mapping for wireless OFDMA systems.

Yehuda Ben-Shimol, Itzik Kitroser, Yefim Dinitz

IEEE Trans. Broadcast., 2006

Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.

Yefim Dinitz, Shay Solomon

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Dinitz' Algorithm: The Original Version and Even's Version.

Yefim Dinitz

Proceedings of the Theoretical Computer Science, 2006

2003

A Compact Layout of the Butterfly.

Yefim Dinitz, Shimon Even, Maria Zapolotsky

J. Interconnect. Networks, 2003

Exact communication costs for consensus and leader in a tree.

Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum

J. Discrete Algorithms, 2003

2001

Planarity of the 2-Level Cactus Model.

Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

On the totalk-diameter of connection networks.

Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks

Theor. Comput. Sci., 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

Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph.

Yefim Dinitz, Ronit Nossenson

Proceedings of the Algorithm Theory, 2000

1999

A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.

Yefim Dinitz, Zeev Nutov

J. Algorithms, 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

On an Algorithm of Zemlyachenko for Subtree Isomorphism.

Yefim Dinitz, Alon Itai, Michael Rodeh

Inf. Process. Lett., 1999

On the Single-Source Unsplittable Flow Problem.

Yefim Dinitz, Naveen Garg, Michel X. Goemans

Comb., 1999

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).

Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Some Compact Layouts of the Butterfly.

Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998

Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.

Yefim Dinitz, Jeffery R. Westbrook

Algorithmica, 1998

1997

On Optimal Graphs Embedded into Path and Rings, with Analysis Using l₁-Spheres.

Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

On the total_k-diameter of connection networks.

Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

Finding Optimum <i>k</i>-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for <i>k</i>=3, 4, 5.

Yefim Dinitz, Zeev Nutov

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

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

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses.

Yefim Dinitz, Alek Vainshtein

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

The connectivity carcass of a vertex subset in a graph and its incremental maintenance.

Yefim Dinitz, Alek Vainshtein

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Maintaining the 4-Edge-Connected Components of a Graph On-Line.

Yefim Dinitz

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992

The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph.

Yefim Dinitz

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992