| 2008 |
|---|
| 34 | EE | Yefim Dinitz,
Michael Elkin,
Shay Solomon:
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
FOCS 2008: 519-528 |
| 33 | EE | Yefim Dinitz,
Shay Solomon:
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.
ACM Transactions on Algorithms 4(3): (2008) |
| 32 | EE | Yefim Dinitz,
Michael Elkin,
Shay Solomon:
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
CoRR abs/0801.3581: (2008) |
| 31 | EE | Yefim Dinitz,
Shlomo Moran,
Sergio Rajsbaum:
Bit complexity of breaking and achieving symmetry in chains and rings.
J. ACM 55(1): (2008) |
| 2007 |
|---|
| 30 | | Boaz Ben-Moshe,
Yefim Dinitz:
Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies.
CCCG 2007: 53-56 |
| 29 | EE | Yefim Dinitz,
Shay Solomon:
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.
SOFSEM (1) 2007: 248-259 |
| 28 | EE | Maria Artishchev-Zapolotsky,
Yefim Dinitz,
Shimon Even,
Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.
Journal of Interconnection Networks 8(2): 101-118 (2007) |
| 27 | EE | Yefim Dinitz,
Noam Solomon:
Two absolute bounds for distributed bit complexity.
Theor. Comput. Sci. 384(2-3): 168-183 (2007) |
| 2006 |
|---|
| 26 | EE | Yefim Dinitz:
Dinitz' Algorithm: The Original Version and Even's Version.
Essays in Memory of Shimon Even 2006: 218-240 |
| 25 | EE | Yefim Dinitz,
Shay Solomon:
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.
ISAAC 2006: 36-47 |
| 2005 |
|---|
| 24 | EE | Yefim Dinitz,
Noam Solomon:
Two Absolute Bounds for Distributed Bit Complexity.
SIROCCO 2005: 115-126 |
| 2003 |
|---|
| 23 | EE | Yefim Dinitz,
Shlomo Moran,
Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree.
J. Discrete Algorithms 1(2): 167-183 (2003) |
| 22 | EE | Yefim Dinitz,
Shimon Even,
Maria Zapolotsky:
A Compact Layout of the Butterfly.
Journal of Interconnection Networks 4(1): 53-75 (2003) |
| 2001 |
|---|
| 21 | EE | Sabine Cornelsen,
Yefim Dinitz,
Dorothea Wagner:
Planarity of the 2-Level Cactus Model.
WG 2001: 91-102 |
| 2000 |
|---|
| 20 | | Yefim Dinitz,
Shlomo Moran,
Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree.
SIROCCO 2000: 63-77 |
| 19 | EE | Yefim Dinitz,
Ronit Nossenson:
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph.
SWAT 2000: 272-285 |
| 18 | EE | 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): 753-808 (2000) |
| 17 | EE | Yefim Dinitz,
Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
On the totalk-diameter of connection networks.
Theor. Comput. Sci. 247(1-2): 213-228 (2000) |
| 1999 |
|---|
| 16 | EE | Yefim Dinitz,
Shimon Even,
Roni Kupershtok,
Maria Zapolotsky:
Some Compact Layouts of the Butterfly.
SPAA 1999: 54-63 |
| 15 | EE | Yefim Dinitz,
Shlomo Moran,
Sergio Rajsbaum:
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).
STOC 1999: 265-274 |
| 14 | EE | Yefim Dinitz,
Naveen Garg,
Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem.
Combinatorica 19(1): 17-41 (1999) |
| 13 | EE | Yefim Dinitz,
Alon Itai,
Michael Rodeh:
On an Algorithm of Zemlyachenko for Subtree Isomorphism.
Inf. Process. Lett. 70(3): 141-146 (1999) |
| 12 | | 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): 21-30 (1999) |
| 11 | | Yefim Dinitz,
Zeev Nutov:
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.
J. Algorithms 32(1): 31-40 (1999) |
| 1998 |
|---|
| 10 | EE | Yefim Dinitz,
Naveen Garg,
Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem.
FOCS 1998: 290-299 |
| 9 | | Yefim Dinitz,
Jeffery Westbrook:
Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.
Algorithmica 20(3): 242-276 (1998) |
| 1997 |
|---|
| 8 | | Yefim Dinitz,
Zeev Nutov:
Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5.
CIAC 1997: 13-24 |
| 7 | EE | Yefim Dinitz,
Tamar Eilam,
Shlomo Moran,
Shmuel Zaks:
On the totalk-diameter of connection networks.
ISTCS 1997: 96-106 |
| 6 | | Yefim Dinitz,
Marcelo Feighelstein,
Shmuel Zaks:
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres.
WG 1997: 171-183 |
| 1995 |
|---|
| 5 | | Yefim Dinitz,
Alek Vainshtein:
Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses.
SODA 1995: 302-311 |
| 4 | EE | 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: 509-518 |
| 1994 |
|---|
| 3 | EE | Yefim Dinitz,
Alek Vainshtein:
The connectivity carcass of a vertex subset in a graph and its incremental maintenance.
STOC 1994: 716-725 |
| 1993 |
|---|
| 2 | | Yefim Dinitz:
Maintaining the 4-Edge-Connected Components of a Graph On-Line.
ISTCS 1993: 88-97 |
| 1992 |
|---|
| 1 | | Yefim Dinitz:
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph.
WG 1992: 145-157 |
