Optimal node ranking of trees

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

Constructing a minimum height elimination tree of a tree in linear time

Information Sciences: an International Journal

Deterministic conflict-free coloring for intervals: From offline to online

ACM Transactions on Algorithms (TALG)

Optimal vertex ranking of block graphs

Information and Computation

Greedy rankings and arank numbers

Information Processing Letters

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

Vertex Ranking with Capacity

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

Ranking numbers of graphs

Information Processing Letters

Graph unique-maximum and conflict-free colorings

Journal of Discrete Algorithms

Hitting sets online and vertex ranking

ESA'11 Proceedings of the 19th European conference on Algorithms

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

Finding the edge ranking number through vertex partitions

Discrete Applied Mathematics