The maximum concurrent flow problem
Journal of the ACM (JACM)
A heuristic algorithm for small separators in arbitrary graphs
SIAM Journal on Computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A network flow approach for hierarchical tree partitioning
DAC '97 Proceedings of the 34th annual Design Automation Conference
Path optimization and near-greedy analysis for graph partitioning: an empirical study
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Combined path and server selection in dynamic multimedia environments
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Directory Based Composite Routing and Scheduling for Dynamic Multimedia Environments
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Linear Orderings of Random Geometric Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Combinatorics, Probability and Computing
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A nondifferentiable optimization approach to ratio-cut partitioning
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
| Hi-index | 0.00 |