Yefim Dinitz

Affiliations:
  • Ben-Gurion University of the Negev, Israel


According to our database1, Yefim Dinitz authored at least 48 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs.
Theory Comput. Syst., April, 2023

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

2022
Partially Disjoint k Shortest Paths.
CoRR, 2022

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

Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract).
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

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

Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

2019
Network Cloudification - (Extended Abstract).
Proceedings of the Cyber Security Cryptography and Machine Learning, 2019

2018
Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN.
Proceedings of the Structural Information and Communication Complexity, 2018

2017
Hybrid Bellman-Ford-Dijkstra algorithm.
J. Discrete Algorithms, 2017

Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract).
Proceedings of the 16th IEEE International Symposium on Network Computing and Applications, 2017

2014
Recent Results on Three Problems in Comparative Structural RNAomics.
Proceedings of the 1st Workshop on Computational Methods for Structural RNAs (CMSR 2014), 2014

2013
Unrooted unordered homeomorphic subtree alignment of RNA trees.
Algorithms Mol. Biol., 2013

2012
RNA Tree Comparisons via Unrooted Unordered Alignments.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2010
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
Discret. Comput. Geom., 2010

2009
Guarding Rectangular Partitions.
Int. J. Comput. Geom. Appl., 2009

2008
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.
ACM Trans. Algorithms, 2008

Bit complexity of breaking and achieving symmetry in chains and rings.
J. ACM, 2008

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

Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Two absolute bounds for distributed bit complexity.
Theor. Comput. Sci., 2007

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
J. Interconnect. Networks, 2007

On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.
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.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Two-dimensional mapping for wireless OFDMA systems.
IEEE Trans. Broadcast., 2006

Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Dinitz' Algorithm: The Original Version and Even's Version.
Proceedings of the Theoretical Computer Science, 2006

2003
A Compact Layout of the Butterfly.
J. Interconnect. Networks, 2003

Exact communication costs for consensus and leader in a tree.
J. Discrete Algorithms, 2003

2001
Planarity of the 2-Level Cactus Model.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000
On the totalk-diameter of connection networks.
Theor. Comput. Sci., 2000

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case.
SIAM J. Comput., 2000

Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph.
Proceedings of the Algorithm Theory, 2000

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

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.
J. Algorithms, 1999

On an Algorithm of Zemlyachenko for Subtree Isomorphism.
Inf. Process. Lett., 1999

On the Single-Source Unsplittable Flow Problem.
Comb., 1999

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Some Compact Layouts of the Butterfly.
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.
Algorithmica, 1998

1997
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l<sub>1</sub>-Spheres.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

On the total<sub>k</sub>-diameter of connection networks.
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.
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.
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.
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.
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.
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.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992


  Loading...