Information Processing Letters
Discrete Applied Mathematics
Optimal node ranking of trees in linear time
Information Processing Letters
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
On an edge ranking problem of trees and graphs
Discrete Applied Mathematics
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Discrete Mathematics
SIAM Journal on Discrete Mathematics
Finding optimal edge-rankings of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On Minimum Edge Ranking Spanning Trees
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Edge ranking of weighted trees
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Information Processing Letters
Easy and hard instances of arc ranking in directed graphs
Discrete Applied Mathematics
Edge ranking and searching in partial orders
Discrete Applied Mathematics
Edge ranking of weighted trees
Discrete Applied Mathematics
On the complexity of searching in trees: average-case minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Binary identification problems for weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the complexity of searching in trees and partially ordered structures
Theoretical Computer Science
Parallel query processing and edge ranking of graphs
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
The binary identification problem for weighted trees
Theoretical Computer Science
| Hi-index | 0.00 |