dblp.uni-trier.dewww.uni-trier.de

Yefim Dinitz Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
34EEYefim Dinitz, Michael Elkin, Shay Solomon: Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528
33EEYefim Dinitz, Shay Solomon: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms 4(3): (2008)
32EEYefim Dinitz, Michael Elkin, Shay Solomon: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR abs/0801.3581: (2008)
31EEYefim 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
29EEYefim Dinitz, Shay Solomon: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259
28EEMaria 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)
27EEYefim Dinitz, Noam Solomon: Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2-3): 168-183 (2007)
2006
26EEYefim Dinitz: Dinitz' Algorithm: The Original Version and Even's Version. Essays in Memory of Shimon Even 2006: 218-240
25EEYefim Dinitz, Shay Solomon: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47
2005
24EEYefim Dinitz, Noam Solomon: Two Absolute Bounds for Distributed Bit Complexity. SIROCCO 2005: 115-126
2003
23EEYefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1(2): 167-183 (2003)
22EEYefim Dinitz, Shimon Even, Maria Zapolotsky: A Compact Layout of the Butterfly. Journal of Interconnection Networks 4(1): 53-75 (2003)
2001
21EESabine 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
19EEYefim Dinitz, Ronit Nossenson: Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. SWAT 2000: 272-285
18EEYefim 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)
17EEYefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
1999
16EEYefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky: Some Compact Layouts of the Butterfly. SPAA 1999: 54-63
15EEYefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC 1999: 265-274
14EEYefim Dinitz, Naveen Garg, Michel X. Goemans: On the Single-Source Unsplittable Flow Problem. Combinatorica 19(1): 17-41 (1999)
13EEYefim 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
10EEYefim 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
8EEYefim Dinitz, Zeev Nutov: Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. CIAC 1997: 13-24
7EEYefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106
6EEYefim 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
4EEYefim 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
3EEYefim 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
1EEYefim Dinitz: The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG 1992: 145-157

Coauthor Index

1Maria Artishchev-Zapolotsky (Maria Zapolotsky) [16] [22] [28]
2Vincenzo Auletta [12]
3Boaz Ben-Moshe [30]
4Sabine Cornelsen [21]
5Tamar Eilam [7] [17]
6Michael Elkin [32] [34]
7Shimon Even [16] [22] [28]
8Marcelo Feighelstein [6]
9Naveen Garg [10] [14]
10Michel X. Goemans [10] [14]
11Alon Itai [13]
12Roni Kupershtok [16]
13Shlomo Moran [7] [15] [17] [20] [23] [31]
14Ronit Nossenson [19]
15Zeev Nutov [4] [8] [11] [12]
16Mimmo Parente (Domenico Parente) [12]
17Sergio Rajsbaum [15] [20] [23] [31]
18Michael Rodeh [13]
19Noam Solomon [24] [27]
20Shay Solomon [25] [29] [32] [33] [34]
21Alek Vainshtein (Alexander Vainshtein) [3] [5] [18]
22Dorothea Wagner [21]
23Jeffery Westbrook [9]
24Vladimir Yanovski [28]
25Shmuel Zaks [6] [7] [17]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)