Directed graphs requiring large numbers of shortcuts
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Transitive-closure spanners: a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science
Efficient provably-secure hierarchical key assignment schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |