Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Parallel algorithms for depth-first searches I. planar graphs
SIAM Journal on Computing
Parallel ear decomposition search (EDS) and st-numbering in graphs
Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A new graphy triconnectivity algorithm and its parallelization
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
SIAM Journal on Computing
An improved parallel algorithm that computes the BFS numbering of a directed graph
Information Processing Letters
An efficient parallel algorithm for planarity
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
VLSI Algorithms and Architectures
VLSI Algorithms and Architectures
Optimal parallel algorithms for transitive closure and point location in planar structures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Local reorientation, global order, and planar topology
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel depth-first search in general directed graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Finding Triconnected Components by Local Replacements
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Optimal Parallel Evaluation of Tree-Structured Computations by Raking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Efficient Parallel Triconnectivity in Logarithmic Time
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Deterministic Parallel List Ranking
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Graph Theory With Applications
Graph Theory With Applications
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A contraction procedure for planar directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the general planar monotone circuit value problem4
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding strongly connected components in parallel using O(log2n) reachability queries
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |