The webgraph framework I, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.595-602, 2004. ,
DOI : 10.1145/988672.988752
Codes for the World Wide Web, Internet Mathematics, vol.2, issue.4, pp.407-429, 2005. ,
DOI : 10.1080/15427951.2005.10129113
Scaling and related techniques for geometry problems, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.135-143, 1984. ,
DOI : 10.1145/800057.808675
The Compactness of Interval Routing, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.459-473, 1999. ,
DOI : 10.1137/S0895480197328631
Four Strikes Against Physical Mapping of DNA, Journal of Computational Biology, vol.2, issue.1, pp.139-152, 1995. ,
DOI : 10.1089/cmb.1995.2.139
Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol.57, 2004. ,
Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984. ,
DOI : 10.1137/0213024
Representations of Indifference Relations, 1968. ,
Efficient graph representations, volume 19 of Fields Institute Monographs, 2003. ,
On the succinct representation of graphs, Discrete Applied Mathematics, vol.8, issue.3, pp.289-294, 1984. ,
DOI : 10.1016/0166-218X(84)90126-4
A unifying look at data structures, Communications of the ACM, vol.23, issue.4, pp.229-239, 1980. ,
DOI : 10.1145/358841.358852
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, Discrete Applied Mathematics, vol.155, issue.17, pp.2312-2320, 2007. ,
DOI : 10.1016/j.dam.2007.06.009