| Publication | Date of Publication | Type |
|---|
| On the single-source unsplittable flow problem | 2025-10-29 | Paper |
| Dinitz' algorithm: the original version and Even's version | 2025-03-19 | Paper |
| 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
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Hybrid Bellman-Ford-Dijkstra algorithm
Journal of Discrete Algorithms | 2017-02-14 | Paper |
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On an algorithm of Zemlyachenko for subtree isomorphism
Information Processing Letters | 2016-06-16 | Paper |
Georgy Maksimovich Adelson-Velsky (obituary)
Russian Mathematical Surveys | 2014-12-17 | Paper |
Low-light trees, and tight lower bounds for Euclidean spanners
Discrete & Computational Geometry | 2010-05-21 | Paper |
GUARDING RECTANGULAR PARTITIONS
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM | 2008-12-21 | Paper |
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
Algorithms and Computation | 2008-04-24 | Paper |
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Two absolute bounds for distributed bit complexity
Theoretical Computer Science | 2007-10-02 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2044925 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1263227 (Why is no real title available?) | 2002-01-29 | Paper |
| scientific article; zbMATH DE number 1617266 (Why is no real title available?) | 2001-07-11 | Paper |
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
Journal of Algorithms | 2001-01-07 | Paper |
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
Journal of Algorithms | 2000-12-18 | Paper |
On the total\(_k\)-diameter of connection networks
Theoretical Computer Science | 2000-10-26 | Paper |
The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
SIAM Journal on Computing | 2000-10-18 | Paper |
On the single-source unsplittable flow problem
Combinatorica | 1999-12-08 | Paper |
| scientific article; zbMATH DE number 1107731 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 910886 (Why is no real title available?) | 1996-09-23 | Paper |
| scientific article; zbMATH DE number 3340123 (Why is no real title available?) | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3338967 (Why is no real title available?) | 1969-01-01 | Paper |
