Yefim Dinitz

Available identifiers

zbMath Open dinic.e-aDBLP28/1197WikidataQ124032879 ScholiaQ124032879MaRDI QIDQ5615774

List of research outcomes

Publication	Date of Publication	Type
Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs	2023-03-21	Paper
On Existence of Must-Include Paths and Cycles in Undirected Graphs	2023-02-19	Paper
Make\&activate-before-break: policy preserving seamless routes replacement in SDN	2019-01-30	Paper
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem	2018-11-05	Paper
Hybrid Bellman-Ford-Dijkstra algorithm	2017-02-14	Paper
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)	2016-09-29	Paper
The connectivity carcass of a vertex subset in a graph and its incremental maintenance	2016-09-01	Paper
On an algorithm of Zemlyachenko for subtree isomorphism	2016-06-16	Paper
Georgy Maksimovich Adelson-Velsky (obituary)	2014-12-17	Paper
Low-light trees, and tight lower bounds for Euclidean spanners	2010-05-21	Paper
GUARDING RECTANGULAR PARTITIONS	2010-02-12	Paper
Bit complexity of breaking and achieving symmetry in chains and rings	2008-12-21	Paper
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules	2008-04-24	Paper
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem	2008-03-07	Paper
Two absolute bounds for distributed bit complexity	2007-10-02	Paper
Structural Information and Communication Complexity	2005-11-30	Paper
Exact communication costs for consensus and leader in a tree	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4448750	2004-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4234099	2002-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q2721987	2001-07-11	Paper
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs	2001-01-07	Paper
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph	2000-12-18	Paper
On the total\(_k\)-diameter of connection networks	2000-10-26	Paper
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case	2000-10-18	Paper
On the single-source unsplittable flow problem	1999-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q4373680	1998-06-11	Paper
https://portal.mardi4nfdi.de/entity/Q4886060	1996-09-23	Paper
https://portal.mardi4nfdi.de/entity/Q5616735	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5615775	1969-01-01	Paper

Research outcomes over time

This page was built for person: Yefim Dinitz