The following pages link to Yefim Dinitz (Q5615774):
Displaying 31 items.
- (Q294681) (redirect page) (← links)
- (Q1583251) (redirect page) (← links)
- On an algorithm of Zemlyachenko for subtree isomorphism (Q294684) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- On the single-source unsplittable flow problem (Q1125608) (← links)
- On the total\(_k\)-diameter of connection networks (Q1583253) (← links)
- Make\&activate-before-break: policy preserving seamless routes replacement in SDN (Q1713886) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Two absolute bounds for distributed bit complexity (Q2382670) (← links)
- Incremental maintenance of the 5-edge-connectivity classes of a graph (Q2721987) (← links)
- The connectivity carcass of a vertex subset in a graph and its incremental maintenance (Q2817666) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- (Q2936522) (redirect page) (← links)
- Georgy Maksimovich Adelson-Velsky (obituary) (Q2936525) (← links)
- GUARDING RECTANGULAR PARTITIONS (Q3405972) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359) (← links)
- (Q4234099) (← links)
- (Q4373680) (← links)
- Planarity of the 2-level cactus model (Q4448750) (← links)
- The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case (Q4507372) (← links)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338) (← links)
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs (Q4719339) (← links)
- Locally orientable graphs, cell structures, and a new algorithm for the incremental maintenance of connectivity carcasses (Q4886060) (← links)
- Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem (Q4962728) (← links)
- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem (Q5448776) (← links)
- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules (Q5459100) (← links)
- (Q5615775) (← links)
- (Q5616735) (← links)
- Structural Information and Communication Complexity (Q5710078) (← links)
- On Existence of Must-Include Paths and Cycles in Undirected Graphs (Q6426949) (← links)
- Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs (Q6487900) (← links)
