On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Random regular graphs with edge faults: expansion through cores
Theoretical Computer Science
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Random Regular Graphs with Edge Faults: Expansion through Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
New Spectral Lower Bounds on the Bisection Width of Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Analysis of edge deletion processes on faulty random regular graphs
Theoretical Computer Science - Latin American theoretical informatics
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
On the Edge-Expansion of Graphs
Combinatorics, Probability and Computing
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science
Peer-to-peer networks based on random transformations of connected regular undirected graphs
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Random Lifts of Graphs: Edge Expansion
Combinatorics, Probability and Computing
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
The isoperimetric constant of the random graph process
Random Structures & Algorithms
Expansion properties of a random regular graph after random vertex deletions
European Journal of Combinatorics
Jellyfish: networking data centers randomly
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Survey: The cook-book approach to the differential equation method
Computer Science Review
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
A new routing scheme for Jellyfish and its performance with HPC workloads
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Expanders with respect to Hadamard spaces and random graphs: extended abstract
Proceedings of the 5th conference on Innovations in theoretical computer science
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.02 |