Online conflict-free coloring for intervals
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Homomorphism preservation theorems
Journal of the ACM (JACM)
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
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Forbidden graphs for tree-depth
European Journal of Combinatorics
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the tree-depth of random graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |