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
On finding minimal 2-connected subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Proceedings of the 30th IEEE symposium on Foundations of computer science
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The complexity of planarity testing
Information and Computation
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Journal of Parallel and Distributed Computing
Optimal st-Orientations for Plane Triangulations
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Parameterized st-orientations of graphs: algorithms and experiments
GD'06 Proceedings of the 14th international conference on Graph drawing
Algorithms and theory of computation handbook
Pure topological mapping in mobile robotics
IEEE Transactions on Robotics
On the design of reliable wireless mesh network infrastructure with QoS constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast computation of small cuts via cycle space sampling
ACM Transactions on Algorithms (TALG)
A study on the locality behavior of minimum spanning tree algorithms
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Applications of parameterized st-orientations in graph drawing algorithms
GD'05 Proceedings of the 13th international conference on Graph Drawing
Brief announcement: speedups for parallel graph triconnectivity
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 5.23 |