default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYefim Dinitz
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz:
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. SOCS 2024: 28-36- [c28]Yefim Dinitz
, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. SSS 2024: 240-254 - 2023
- [j19]Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput. Syst. 67(2): 348-382 (2023) - [i5]Yefim Dinitz, Solomon Eyal Shimony:
On Existence of Must-Include Paths and Cycles in Undirected Graphs. CoRR abs/2302.09614 (2023) - 2022
- [i4]Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber:
Partially Disjoint k Shortest Paths. CoRR abs/2211.03335 (2022) - 2021
- [c27]Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths - (Extended Abstract). CSCML 2021: 266-274 - [i3]Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Polynomial Time Prioritized Multi-Criteria k-Shortest Paths and k-Disjoint All-Criteria-Shortest Paths. CoRR abs/2101.11514 (2021) - 2020
- [c26]Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. SSS 2020: 113-117 - [i2]Yefim Dinitz, Shlomi Dolev, Manish Kumar:
Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. CoRR abs/2010.02486 (2020)
2010 – 2019
- 2019
- [c25]Yefim Dinitz, Shlomi Dolev, Sergey Frenkel, Alex Binun, Daniel Khankin:
Network Cloudification - (Extended Abstract). CSCML 2019: 249-259 - 2018
- [c24]Yefim Dinitz, Shlomi Dolev, Daniel Khankin:
Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. SIROCCO 2018: 34-37 - 2017
- [j18]Yefim Dinitz, Rotem Itzhak:
Hybrid Bellman-Ford-Dijkstra algorithm. J. Discrete Algorithms 42: 35-44 (2017) - [c23]Yefim Dinitz, Shlomi Dolev, Daniel Khankin:
Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). NCA 2017: 415-421 - 2014
- [c22]Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson:
Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB 2014: 58-58 - 2013
- [j17]Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson:
Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. 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
- [j16]Yefim Dinitz, Michael Elkin, Shay Solomon:
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discret. Comput. Geom. 43(4): 736-783 (2010)
2000 – 2009
- 2009
- [j15]Yefim Dinitz, Matthew J. Katz, Roi Krakovski:
Guarding Rectangular Partitions. Int. J. Comput. Geom. Appl. 19(6): 579-594 (2009) - 2008
- [j14]Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1): 3:1-3:28 (2008) - [j13]Yefim Dinitz, Shay Solomon:
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms 4(3): 25:1-25:9 (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
- [j12]Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks 8(2): 101-118 (2007) - [j11]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
- [j10]Yehuda Ben-Shimol, Itzik Kitroser, Yefim Dinitz:
Two-dimensional mapping for wireless OFDMA systems. IEEE Trans. Broadcast. 52(3): 388-396 (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. J. Interconnect. 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
1990 – 1999
- 1999
- [j5]Yefim Dinitz, Naveen Garg, Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem. Comb. 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 R. 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]Yefim Dinitz:
Maintaining the 4-Edge-Connected Components of a Graph On-Line. ISTCS 1993: 88-97 - 1992
- [c1]Yefim Dinitz:
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG 1992: 145-157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
