Efficient parallel algorithms
SIAM Journal on Computing
Intersection graphs of vertex disjoint paths in a tree
Discrete Mathematics
Efficient Parallel Algorithms for Chordal Graphs
SIAM Journal on Computing
Efficient parallel algorithms for some graph problems
Communications of the ACM
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
A New Class of Separators and Planarity of Chordal Graphs
Proceedings of the Ninth Conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |