A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
An approach to emulating separable graphs (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Competitive fault-tolerance in area-universal networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A VLSI decomposition of the deBruijn graph
Journal of the ACM (JACM)
A tight layout of the butterfly network
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Tighter Layouts of the Cube-Connected Cycles
IEEE Transactions on Parallel and Distributed Systems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Discrete Mathematics - Kleitman and combinatorics: a celebration
A Benes-Like Theorem for the Shuffle-Exchange Graph
IEEE Transactions on Computers
A Generalized Simultaneous Access Dictionary Machine
IEEE Transactions on Parallel and Distributed Systems
A Processor-Time-Minimal Systolic Array for Transitive Closure
IEEE Transactions on Parallel and Distributed Systems
3-Dimensional Single Active Layer Routing
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Emulating Direct Products by Index-Shuffle Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the twenty-second annual symposium on Computational geometry
Routing vertex disjoint steiner-trees in a cubic grid and connections to VLSI
Discrete Applied Mathematics
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
An algorithm for the graph crossing number problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Graphs that admit right angle crossing drawings
Computational Geometry: Theory and Applications
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |