Yefim Dinitz - RankMe

56 papers A* 6B 11C 5Journal 25Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Brief Announcement: The Steiner Shortest Path Tree Problem. SSS Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber
2025	J	`jnl`	The Steiner Shortest Path Tree Problem. CoRR Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber
2024	B	`conf`	Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. SOCS Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz
2024	C	`conf`	Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. SSS Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber
2024	B	`conf`	Steiner Trees Composition and Scalable Video Coding for Satelite Video Multicast. NCA Alex Binun, Yefim Dinitz, Shlomi Dolev, Ofer Hadar, Adnan Jaber, Shevach Riabtsev
2023	J	`jnl`	Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput. Syst. Yefim Dinitz, Shlomi Dolev, Manish Kumar
2023	J	`jnl`	On Existence of Must-Include Paths and Cycles in Undirected Graphs. CoRR Yefim Dinitz, Solomon Eyal Shimony
2022	J	`jnl`	Partially Disjoint k Shortest Paths. CoRR Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber
2021	J	`jnl`	Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. CoRR Yefim Dinitz, Shlomi Dolev, Manish Kumar
2021	—	`conf`	Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract). CSCML Yefim Dinitz, Shlomi Dolev, Manish Kumar
2020	C	`conf`	Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. SSS Yefim Dinitz, Shlomi Dolev, Manish Kumar
2020	J	`jnl`	Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. CoRR Yefim Dinitz, Shlomi Dolev, Manish Kumar
2019	—	`conf`	Network Cloudification - (Extended Abstract). CSCML Yefim Dinitz, Shlomi Dolev, Sergey Frenkel, Alex Binun, Daniel Khankin
2018	B	`conf`	Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. SIROCCO Yefim Dinitz, Shlomi Dolev, Daniel Khankin
2017	B	`conf`	Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). NCA Yefim Dinitz, Shlomi Dolev, Daniel Khankin
2017	J	`jnl`	Hybrid Bellman-Ford-Dijkstra algorithm. J. Discrete Algorithms Yefim Dinitz, Rotem Itzhak
2014	—	`conf`	Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson
2013	J	`jnl`	Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson
2012	C	`conf`	RNA Tree Comparisons via Unrooted Unordered Alignments. WABI Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson
2010	J	`jnl`	Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discret. Comput. Geom. Yefim Dinitz, Michael Elkin, Shay Solomon
2009	J	`jnl`	Guarding Rectangular Partitions. Int. J. Comput. Geom. Appl. Yefim Dinitz, Matthew J. Katz, Roi Krakovski
2008	J	`jnl`	Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2008	J	`jnl`	Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms Yefim Dinitz, Shay Solomon
2008	J	`jnl`	Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR Yefim Dinitz, Michael Elkin, Shay Solomon
2008	A*	`conf`	Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS Yefim Dinitz, Michael Elkin, Shay Solomon
2007	—	`conf`	Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. CCCG Boaz Ben-Moshe, Yefim Dinitz
2007	J	`jnl`	Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski
2007	—	`conf`	On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) Yefim Dinitz, Shay Solomon
2007	J	`jnl`	Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. Yefim Dinitz, Noam Solomon
2006	—	`conf`	Dinitz' Algorithm: The Original Version and Even's Version. Essays in Memory of Shimon Even Yefim Dinitz
2006	B	`conf`	Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC Yefim Dinitz, Shay Solomon
2006	J	`jnl`	Two-dimensional mapping for wireless OFDMA systems. IEEE Trans. Broadcast. Yehuda Ben-Shimol, Itzik Kitroser, Yefim Dinitz
2005	B	`conf`	Two Absolute Bounds for Distributed Bit Complexity. SIROCCO Yefim Dinitz, Noam Solomon
2003	J	`jnl`	A Compact Layout of the Butterfly. J. Interconnect. Networks Yefim Dinitz, Shimon Even, Maria Zapolotsky
2003	J	`jnl`	Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2001	B	`conf`	Planarity of the 2-Level Cactus Model. WG Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
2000	B	`conf`	Exact communication costs for consensus and leader in a tree. SIROCCO Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
2000	—	`conf`	Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph. SWAT Yefim Dinitz, Ronit Nossenson
2000	J	`jnl`	On the totalk-diameter of connection networks. Theor. Comput. Sci. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
2000	J	`jnl`	The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. SIAM J. Comput. Yefim Dinitz, Alek Vainshtein
1999	J	`jnl`	A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. J. Algorithms Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
1999	J	`jnl`	A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms Yefim Dinitz, Zeev Nutov
1999	A*	`conf`	Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
1999	J	`jnl`	On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. Yefim Dinitz, Alon Itai, Michael Rodeh
1999	J	`jnl`	On the Single-Source Unsplittable Flow Problem. Comb. Yefim Dinitz, Naveen Garg, Michel X. Goemans
1999	B	`conf`	Some Compact Layouts of the Butterfly. SPAA Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
1998	J	`jnl`	Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. Algorithmica Yefim Dinitz, Jeffery R. Westbrook
1998	A*	`conf`	On the Single-Source Unsplittable Flow Problem. FOCS Yefim Dinitz, Naveen Garg, Michel X. Goemans
1997	C	`conf`	Finding Optimum CIAC Yefim Dinitz, Zeev Nutov
1997	B	`conf`	On Optimal Graphs Embedded into Path and Rings, with Analysis Using l WG Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks
1997	—	`conf`	On the total ISTCS Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
1995	A*	`conf`	A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. STOC Yefim Dinitz, Zeev Nutov
1995	A*	`conf`	Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. SODA Yefim Dinitz, Alek Vainshtein
1994	A*	`conf`	The connectivity carcass of a vertex subset in a graph and its incremental maintenance. STOC Yefim Dinitz, Alek Vainshtein
1993	—	`conf`	Maintaining the 4-Edge-Connected Components of a Graph On-Line. ISTCS Yefim Dinitz
1992	B	`conf`	The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG Yefim Dinitz