Yefim Dinitz

发表

Multi-Agent Coordination Off-Line: Structure and Complexity

C. Domshlak, Yefim Dinitz, 2014 .

Algorithm for Scheduling with AND / OR Precedence Constraints

Paz Carmi, Yefim Dinitz, 2011 .

An O ( | V | | E | ) Algorithm for AND / OR Scheduling Problem : General Non-Negative Weight Case

Paz Carmi, Yefim Dinitz, Shahar Golan, 2006 .

Multi-agent off-line coordination: Structure and complexity

Carmel Domshlak, Yefim Dinitz, C. Domshlak, 2001 .

Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)

Shlomo Moran, Sergio Rajsbaum, Yefim Dinitz, 1999, Symposium on the Theory of Computing.

Planarity of the 2-level Ca tus

D. Wagner, Yefim Dinitz, M. Cornelsen, 2001 .

Partially Disjoint k Shortest Paths

S. Dolev, B. Schieber, Yefim Dinitz, 2022, ArXiv.

Bit complexity of breaking and achieving symmetry in chains and rings

Shlomo Moran, Sergio Rajsbaum, Yefim Dinitz, 2008, JACM.

Some compact layouts of the butterfly

Shimon Even, Yefim Dinitz, Roni Kupershtok, 1999, SPAA '99.

Algorithms and Bounds for Tower of Hanoi Problems on Graphs

Yefim Dinitz, Rafi Cohen, Yefim Dinitz, 2008 .

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

Yefim Dinitz, Yefim Dinitz, 2006, Essays in Memory of Shimon Even.

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

Jeffery R. Westbrook, Yefim Dinitz, J. Westbrook, 1998, Algorithmica.

Two-dimensional mapping for wireless OFDMA systems

Yefim Dinitz, Itzik Kitroser, Yehuda Ben-Shimol, 2006, IEEE Transactions on Broadcasting.

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

Yefim Dinitz, Shlomi Dolev, Manish Kumar, 2021, ArXiv.

On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres

Shmuel Zaks, Yefim Dinitz, Marcelo Feighelstein, 1997, WG.

On the totalk-diameter of connection networks

Shmuel Zaks, Shlomo Moran, Tamar Eilam, 2000, Theor. Comput. Sci..

On the total/sub k/-diameter of connection networks

Shmuel Zaks, Shlomo Moran, Tamar Eilam, 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

Guarding Rectangular Partitions

Matthew J. Katz, Roi Krakovski, Yefim Dinitz, 2009, Int. J. Comput. Geom. Appl..

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

Mimmo Parente, Vincenzo Auletta, Zeev Nutov, 1999, J. Algorithms.

Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5

Zeev Nutov, Yefim Dinitz, Zeev Nutov, 1997, CIAC.

Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

Shay Solomon, Yefim Dinitz, Shay Solomon, 2006, ISAAC.

The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case

YEFIM DINITZ, ALEK VAINSHTEIN, A. Vainshtein, 2000, SIAM J. Comput..

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance

Zeev Nutov, Yefim Dinitz, Zeev Nutov, 1995, STOC '95.

Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses

Alek Vainshtein, Yefim Dinitz, A. Vainshtein, 1995, SODA '95.

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

Alek Vainshtein, Yefim Dinitz, A. Vainshtein, 1994, STOC '94.

Unrooted unordered homeomorphic subtree alignment of RNA trees

Michal Ziv-Ukelson, Eitan Bachmat, Nimrod Milo, 2013, Algorithms for Molecular Biology.

Planarity of the 2-Level Cactus Model

Dorothea Wagner, Sabine Cornelsen, Yefim Dinitz, 2001, WG.

RNA Tree Comparisons via Unrooted Unordered Alignments

Michal Ziv-Ukelson, Eitan Bachmat, Nimrod Milo, 2012, WABI.

RNA Tree Comparisons Via Unrooted Unordered Alignments ( Supplemental Materials )

Michal Ziv-Ukelson, Shay Zakov, E. Bachmat, 2012 .

Two absolute bounds for distributed bit complexity

Yefim Dinitz, Noam Solomon, Noam Solomon, 2005, Theor. Comput. Sci..

Exact communication costs for consensus and leader in a tree

Shlomo Moran, Sergio Rajsbaum, Yefim Dinitz, 2003, J. Discrete Algorithms.

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

Shay Solomon, Yefim Dinitz, Shay Solomon, 2008, TALG.

On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

Shay Solomon, Yefim Dinitz, Shay Solomon, 2007, SOFSEM.

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

Michael Elkin, Shay Solomon, Yefim Dinitz, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

Ronit Nossenson, Yefim Dinitz, Yefim Dinitz, 2000, SWAT.

On the Single-Source Unsplittable Flow Problem

Michel X. Goemans, Naveen Garg, Yefim Dinitz, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

S. Dolev, Yefim Dinitz, Manish Kumar, 2022, Theory of Computing Systems.

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

Yefim Dinitz, Manish Kumar, Shlomi Dolev, 2020, ArXiv.

THE GENERAL STRUCTURE

Alek Vainshtein, A. Vainshtein, Yefim Dinitz, 1994 .