Space-efficient routing in vertex-symmetric networks (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A note on the consecutive ones submatrix problem
Information Processing Letters
On the hardness of minimizing space for all-shortest-path interval routing schemes
Theoretical Computer Science
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |