Optimal edge ranking to trees in polynomial time
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Finding optimal edge-rankings of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Optimal edge ranking of trees in linear time
Proceedings of the ninth 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
Minimum Edge Ranking Spanning Trees of Threshold Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Edge ranking of weighted trees
Discrete Applied Mathematics
Minimum edge ranking spanning trees of split graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
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
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Optimal vertex ranking of block graphs
Information and Computation
Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
An On-Line Parallel Algorithm for Node Ranking of Trees
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Edge ranking of weighted trees
Discrete Applied Mathematics
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
The binary identification problem for weighted trees
Theoretical Computer Science
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics
| Hi-index | 0.05 |