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
An optimal parallel algorithm for c-vertex-ranking of trees
Information Processing Letters
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tree-depth, subgraph coloring and homomorphism bounds
European Journal of Combinatorics
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Constructing a minimum height elimination tree of a tree in linear time
Information Sciences: an International Journal
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Information Processing Letters
Grad and classes with bounded expansion I. Decompositions
European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Optimal vertex ranking of block graphs
Information and 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
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
An optimal parallel algorithm for c-vertex-ranking of trees
Information Processing Letters
Information Processing Letters
On the complexity of searching in trees: average-case minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
European Journal of Combinatorics
Hitting sets online and vertex ranking
ESA'11 Proceedings of the 19th European conference on Algorithms
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics
Search-Space size in contraction hierarchies
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.89 |