Recherche
-
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
(Algorithmic Operations Research. vol. 3, n° 1, pp. 43-50, 2008)Article de revue -
Fast Periodic Graph Exploration with Constant Memory
Communication dans un congrès -
Morphology based automatic acquisition of large-coverage lexica
Communication dans un congrès -
Content-based image retrieval using greedy routing
Communication dans un congrès -
Could any graph be turned into a small-world?
(Theoretical Computer Science. vol. 355, pp. 96--103, 2006)Article de revue -
Towards Small World Emergence
Communication dans un congrès -
Non-searchability of random power-law graphs
Communication dans un congrès -
Single nucleotide resolution QTL mapping of an enological trait from derived wild Saccharomyces cerevisiae strains
(FEMS Yeast Research. vol. in press, pp. 1295-1306, 2007)Article de revue