Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
LCA queries in directed acyclic graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.89 |