The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Simulating binary trees on X-trees (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Mixing time and long paths in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimum Universal Graphs for Graphs with Bounded Degrees
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Regular pairs in sparse random graphs I
Random Structures & Algorithms
Sparse networks tolerating random faults
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sparse universal graphs for bounded-degree graphs
Random Structures & Algorithms
Optimal universal graphs with deterministic embedding
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Global Maker-Breaker games on sparse graphs
European Journal of Combinatorics
SIAM Journal on Discrete Mathematics
Embedding Spanning Trees in Random Graphs
SIAM Journal on Discrete Mathematics
Expanders are universal for the class of all spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The size Ramsey number of a directed path
Journal of Combinatorial Theory Series B
Fast embedding of spanning trees in biased Maker-Breaker games
European Journal of Combinatorics
Sharp threshold for the appearance of certain spanning trees in random graphs
Random Structures & Algorithms
Degree Ramsey numbers for cycles and blowups of trees
European Journal of Combinatorics
| Hi-index | 0.01 |