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
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
Efficient neighbourhood encoding for interval graphs and permutation graphs and O(n) breadth-first search, th International Workshop on Combinatorial Algorithms (IWOCA'09), no. 5874 in LNCS, pp.20-146, 2009. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00415935
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
Representations of indifference relations, 1968. ,
Compressing Large Boolean Matrices Using Reordering Techniques, Proceedings of the Thirtieth international conference on Very Large Data Bases (VLDB'04), pp.13-23, 2004. ,
DOI : 10.1016/B978-012088469-8.50005-X
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
The Compactness of Interval Routing, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.459-473, 1999. ,
DOI : 10.1137/S0895480197328631
Learning decision trees from random examples, Information and Computation, vol.82, issue.3, pp.231-246, 1989. ,
DOI : 10.1016/0890-5401(89)90001-1
Algebraic Characterizations of Small Classes of Boolean Functions, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), pp.331-342, 2003. ,
DOI : 10.1007/3-540-36494-3_30
Graph minor theory, Bulletin of the American Mathematical Society, vol.43, issue.01, pp.75-86, 2006. ,
DOI : 10.1090/S0273-0979-05-01088-8