Optimal edge ranking of trees in linear time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Constructing a minimum height elimination tree of a tree in linear time
Information Sciences: an International Journal
Easy and hard instances of arc ranking in directed graphs
Discrete Applied Mathematics
Deterministic conflict-free coloring for intervals: From offline to online
ACM Transactions on Algorithms (TALG)
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
Information Processing Letters
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Hitting sets online and vertex ranking
ESA'11 Proceedings of the 19th European conference on Algorithms
Forbidden graphs for tree-depth
European Journal of Combinatorics
Ordered coloring grids and related graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Graph unique-maximum and conflict-free colorings
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Ordered coloring of grids and related graphs
Theoretical Computer Science
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics
| Hi-index | 0.05 |