Finding minimum-quotient cuts in planar graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A near optimal algorithm for edge separators (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the performance of spectral graph partitioning methods
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The path resistance method for bounding &lgr;2 of a Laplacian
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Diffusive load balancing schemes on heterogeneous networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On spectral bounds for cutsets
Discrete Mathematics
Laplacian spectra and invariants of graphs
Discrete Mathematics
The exact isoperimetric inequality for ternary and quaternary cubes
Discrete Mathematics - Algebraic and topological methods in graph theory
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
Load balancing of unit size tokens and expansion properties of graphs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Note: on Cheeger inequalities of a graph
Discrete Mathematics
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing
Isoperimetric Inequalities for Cartesian Products of Graphs
Combinatorics, Probability and Computing
The bisection width and the isoperimetric number of arrays
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science
Isoperimetric Graph Partitioning for Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Laplacian spectral bounds for clique and independence numbers of graphs
Journal of Combinatorial Theory Series B
The isoperimetric constant of the random graph process
Random Structures & Algorithms
Bipartite isoperimetric graph partitioning for data co-clustering
Data Mining and Knowledge Discovery
Proceedings of the 17th international conference on World Wide Web
Elasticity: topological characterization of robustness in complex networks
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
The bisection width and the isoperimetric number of arrays
Discrete Applied Mathematics
On the isoperimetric spectrum of graphs and its approximations
Journal of Combinatorial Theory Series B
Brief paper: Design of highly synchronizable and robust networks
Automatica (Journal of IFAC)
Determining edge expansion and other connectivity measures of graphs of bounded genus
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Characterising the robustness of complex networks
International Journal of Internet Technology and Secured Transactions
Expansion properties of large social graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
On the complexity of isoperimetric problems on trees
Discrete Applied Mathematics
Shadows under the word-subword relation
Problems of Information Transmission
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Measuring robustness of complex networks under MVC attack
Proceedings of the 21st ACM international conference on Information and knowledge management
An overview of algorithms for network survivability
ISRN Communications and Networking
Clustering and outlier detection using isoperimetric number of trees
Pattern Recognition
| Hi-index | 0.01 |