The SCEAS System
| |||||||

## Search the dblp DataBase
Yefim Dinitz:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yefim Dinitz
**Dinitz' Algorithm: The Original Version and Even's Version.**[Citation Graph (0, 0)][DBLP] Essays in Memory of Shimon Even, 2006, pp:218-240 [Conf] - Yefim Dinitz, Zeev Nutov
**Finding Optimum**[Citation Graph (0, 0)][DBLP]*k*-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for*k*=3, 4, 5. CIAC, 1997, pp:13-24 [Conf] - Yefim Dinitz, Naveen Garg, Michel X. Goemans
**On the Single-Source Unsplittable Flow Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:290-299 [Conf] - Yefim Dinitz, Shay Solomon
**Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:36-47 [Conf] - Yefim Dinitz
**Maintaining the 4-Edge-Connected Components of a Graph On-Line.**[Citation Graph (0, 0)][DBLP] ISTCS, 1993, pp:88-97 [Conf] - Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
**On the total**[Citation Graph (0, 0)][DBLP]_{k}-diameter of connection networks. ISTCS, 1997, pp:96-106 [Conf] - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
**Exact communication costs for consensus and leader in a tree.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2000, pp:63-77 [Conf] - Yefim Dinitz, Noam Solomon
**Two Absolute Bounds for Distributed Bit Complexity.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:115-126 [Conf] - Yefim Dinitz, Alek Vainshtein
**Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses.**[Citation Graph (0, 0)][DBLP] SODA, 1995, pp:302-311 [Conf] - Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
**Some Compact Layouts of the Butterfly.**[Citation Graph (0, 0)][DBLP] SPAA, 1999, pp:54-63 [Conf] - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
**Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:265-274 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:509-518 [Conf] - Yefim Dinitz, Alek Vainshtein
**The connectivity carcass of a vertex subset in a graph and its incremental maintenance.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:716-725 [Conf] - Yefim Dinitz, Ronit Nossenson
**Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph.**[Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:272-285 [Conf] - Yefim Dinitz
**The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph.**[Citation Graph (0, 0)][DBLP] WG, 1992, pp:145-157 [Conf] - Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
**On Optimal Graphs Embedded into Path and Rings, with Analysis Using l**[Citation Graph (0, 0)][DBLP]_{1}-Spheres. WG, 1997, pp:171-183 [Conf] - Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
**Planarity of the 2-Level Cactus Model.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:91-102 [Conf] - Yefim Dinitz, Jeffery Westbrook
**Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:20, n:3, pp:242-276 [Journal] - Yefim Dinitz, Naveen Garg, Michel X. Goemans
**On the Single-Source Unsplittable Flow Problem.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1999, v:19, n:1, pp:17-41 [Journal] - Yefim Dinitz, Alon Itai, Michael Rodeh
**On an Algorithm of Zemlyachenko for Subtree Isomorphism.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:70, n:3, pp:141-146 [Journal] - Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
**A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:32, n:1, pp:21-30 [Journal] - Yefim Dinitz, Zeev Nutov
**A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:32, n:1, pp:31-40 [Journal] - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
**Exact communication costs for consensus and leader in a tree.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2003, v:1, n:2, pp:167-183 [Journal] - Yefim Dinitz, Shimon Even, Maria Zapolotsky
**A Compact Layout of the Butterfly.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2003, v:4, n:1, pp:53-75 [Journal] - Yefim Dinitz, Alek Vainshtein
**The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:3, pp:753-808 [Journal] - Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
**On the totalk-diameter of connection networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:247, n:1-2, pp:213-228 [Journal] - Boaz Ben-Moshe, Yefim Dinitz
**Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:53-56 [Conf] - Yefim Dinitz, Shay Solomon
**On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.**[Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:248-259 [Conf] - Yefim Dinitz, Noam Solomon
**Two absolute bounds for distributed bit complexity.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:384, n:2-3, pp:168-183 [Journal] **Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.**[Citation Graph (, )][DBLP]**Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners**[Citation Graph (, )][DBLP]**Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.**[Citation Graph (, )][DBLP]
Search in 0.052secs, Finished in 0.055secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |