- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j16 |      | Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson: Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms for Molecular Biology 8: 13 (2013) |
| 2012 | ||
| c21 | | Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson: RNA Tree Comparisons via Unrooted Unordered Alignments. WABI 2012: 135-148 |
| 2010 | ||
| j15 | | Yefim Dinitz, Michael Elkin, Shay Solomon: Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discrete & Computational Geometry 43(4): 736-783 (2010) |
| 2009 | ||
| j14 | | Yefim Dinitz, Matthew J. Katz, Roi Krakovski: Guarding Rectangular Partitions. Int. J. Comput. Geometry Appl. 19(6): 579-594 (2009) |
| 2008 | ||
| j13 | | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1) (2008) |
| j12 | | Yefim Dinitz, Shay Solomon: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms 4(3) (2008) |
| c20 | | Yefim Dinitz, Michael Elkin, Shay Solomon: Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528 |
| i1 | | Yefim Dinitz, Michael Elkin, Shay Solomon: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners. CoRR abs/0801.3581 (2008) |
| 2007 | ||
| j11 | | 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) |
| j10 | | Yefim Dinitz, Noam Solomon: Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2-3): 168-183 (2007) |
| c19 |  | 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 |
| c18 | | Yefim Dinitz, Shay Solomon: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259 |
| 2006 | ||
| c17 | | Yefim Dinitz: Dinitz' Algorithm: The Original Version and Even's Version. Essays in Memory of Shimon Even 2006: 218-240 |
| c16 | | Yefim Dinitz, Shay Solomon: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47 |
| 2005 | ||
| c15 | | Yefim Dinitz, Noam Solomon: Two Absolute Bounds for Distributed Bit Complexity. SIROCCO 2005: 115-126 |
| 2003 | ||
| j9 | | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1(2): 167-183 (2003) |
| j8 | | Yefim Dinitz, Shimon Even, Maria Zapolotsky: A Compact Layout of the Butterfly. Journal of Interconnection Networks 4(1): 53-75 (2003) |
| 2001 | ||
| c14 | | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner: Planarity of the 2-Level Cactus Model. WG 2001: 91-102 |
| 2000 | ||
| j7 | | 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) |
| j6 | | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000) |
| c13 | | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Exact communication costs for consensus and leader in a tree. SIROCCO 2000: 63-77 |
| c12 | | Yefim Dinitz, Ronit Nossenson: Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. SWAT 2000: 272-285 |
| 1999 | ||
| j5 | | Yefim Dinitz, Naveen Garg, Michel X. Goemans: On the Single-Source Unsplittable Flow Problem. Combinatorica 19(1): 17-41 (1999) |
| j4 | | Yefim Dinitz, Alon Itai, Michael Rodeh: On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. 70(3): 141-146 (1999) |
| j3 | | 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) |
| j2 | | Yefim Dinitz, Zeev Nutov: A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms 32(1): 31-40 (1999) |
| c11 | | Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky: Some Compact Layouts of the Butterfly. SPAA 1999: 54-63 |
| c10 | | Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum: Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC 1999: 265-274 |
| 1998 | ||
| j1 | | Yefim Dinitz, Jeffery Westbrook: Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. Algorithmica 20(3): 242-276 (1998) |
| c9 | | Yefim Dinitz, Naveen Garg, Michel X. Goemans: On the Single-Source Unsplittable Flow Problem. FOCS 1998: 290-299 |
| 1997 | ||
| c8 | | Yefim Dinitz, Zeev Nutov: Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. CIAC 1997: 13-24 |
| c7 | | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106 |
| c6 | | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks: On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. WG 1997: 171-183 |
| 1995 | ||
| c5 | | Yefim Dinitz, Alek Vainshtein: Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. SODA 1995: 302-311 |
| c4 | | 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 | ||
| c3 | | Yefim Dinitz, Alek Vainshtein: The connectivity carcass of a vertex subset in a graph and its incremental maintenance. STOC 1994: 716-725 |
| 1993 | ||
| c2 | | |
| 1992 | ||
| c1 | | Yefim Dinitz: The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG 1992: 145-157 |
Colors in the list of coauthors
Last update Tue May 21 11:33:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page