• Efficient Measurement of Complex Networks Using Link Queries. Fabien Tarissan, Matthieu Latapy and Christophe Prieur. Proceedings of the IEEE International Workshop on Network Science For Communication Networks (NetSciCom'09). 2009.
• Measurement of eDonkey Activity with Distributed Honeypots. Oussama Allali, Matthieu Latapy and Clémence Magnien. Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P'09), May 29, 2009, Rome, Italy.
• Ten weeks in the life of an eDonkey server. Frédéric Aidouni, Matthieu Latapy and Clémence Magnien. Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P'09), May 29, 2009, Rome, Italy. Data.
• Fast dynamics in Internet topology: preliminary observations and explanations. Clémence Magnien, Frédéric Ouedraogo, Guillaume Valadon, Matthieu Latapy. Fourth International Conference on Internet Monitoring and Protection (ICIMP 2009), May 24-28, 2009, Venice, Italy.
• A Radar for the Internet with Clémence Magnien and Frédéric Ouédraogo. Proceedings of the 1st International Workshop on Analysis of Dynamic Networks (ADN'08). Programs and data.
• Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs with Clémence Magnien and Michel Habib. ACM Journal of Experimental Algorithmics (JEA) 13, 2009. Programs and data.
• Complex Network Measurements: Estimating the Relevance of Observed Properties with Clémence Magnien. Infocom'08, 2008, Phoenix, USA. Programs and data.
• Main-memory Triangle Computations for Very Large (Sparse (Power-Law)) Graphs. Theoretical Computer Science (TCS) 407 (1-3), pages 458-473, 2008. Programs.
• Detection, Understanding, and Prevention of Traceroute Measurement Artifacts with Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Timur Friedman and Renata Teixeira. Computer Networks 52, p. 998-1018, 2008. Extended abstract published in the proceedings of the 6-th Internet Measurement Conference IMC'06, 2006, Rio de Janeiro, Brazil.
• Basic Notions for the Analysis of Large Two-mode Networks with Clémence Magnien and Nathalie Del Vecchio. Social Networks 30 (1), p. 31-48, 2008. Programs and data.
• Theoretical Computer Science special issue on Complex Networks -- foreword with Ravi Kumar. Theoretical Computer Science (TCS), special issue on Complex Networks.
• Computing communities in large networks using random walks with Pascal Pons. Journal of Graph Algorithms and Applications (JGAA) vol. 10, no. 2, pages 191-218, 2006. Extended abstract published in LNCS, proceedings of the 20-th International Symposium on Computer and Information Sciences ISCIS'05, 2005, Istambul, Turquie. Programs.
• Random generation of large connected simple graphs with prescribed degree distribution with Fabien Viger. Submitted. Extended abstract published in LNCS, proceedings of the 11-th international conference on Computing and Combinatorics COCOON'05, 2005, Kunming, Yunnan, Chine. Programs.
• Describing and simulating routes on the Internet with Timur Friedman, Jérémie Leguay and Kavé Salamatian. Computer Networks 51, pages 2067-2087, 2007. Extended abstract published in LNCS, proceedings of the 4-th IFIP international conference on Networking, 2005, Waterloo, Canada.
• Relevance of Massively Distributed Explorations of the Internet Topology: Qualitative Results with Jean-Loup Guillaume and Damien Magoni. Computer Networks 50, pages 3197-3224, 2006. Extended abstract published in the proceedings of the 24-th IEEE international conference Infocom'05, 2005, Miami, USA.
• Multi-level analysis of an interaction network between individuals in a mailing-list with Rémi Dorat, Bernard Conein and Nicolas Auray. Annals of Telecommunications 62 (3-4), 2007.
• Dynamics of three-state excitable units on Poisson vs power-law random networks with Anne-Ruxandra Carvunis, Annick Lesne, Clémence Magnien and Laurent Pezard. Physica A 367, pages 585-612, 2006.
• Impact of failures and attacks on random and scale-free networks with Clémence Magnien and Jean-Loup Guillaume. To appear in ACM Computing Surveys. Extended abstract published in LNCS, proceedings of the 8-th International Conference On Principles Of Distributed Systems OPODIS'04, 2004, Grenoble, France (title: Comparison of Failures and Attacks on Random and Scale-free Networks).
• Bipartite graphs as Models of Complex Networks with Jean-Loup Guillaume. Physica A 371, pages 795-813, 2006. Extended abstract published in LNCS, proceedings of the 1-st international workshop on Combinatorial and Algorithmic Aspects of Networking CAAN'04, 2004, Banff, Canada. Programs.
• Complex Network Metrology with Jean-Loup Guillaume. Complex Systems 16, pages 83-94, 2005.
• Combining the use of clustering and scale-free nature of user exchanges into a simple and efficient P2P system with Philippe Gauron and Pierre Fraigniaud. LNCS, proceedings of the 11-th international conference Euro-Par, 2005, Lisbonne, Portugal.
• Clustering in P2P exchanges and consequences on performances with Jean-Loup Guillaume and Stevens Le-Blond. LNCS, proceedings of the 4-th International workshop on Peer-to-Peer Systems IPTPS'05, 2005, Ithaka, New York, USA.
• Bipartite Structure of all Complex Networks with Jean-Loup Guillaume. Information Processing Letters (IPL) 90:5, pages 215-221, 2004.
• Statistical analysis of a P2P query graph based on degrees and their time-evolution with Jean-Loup Guillaume and Stevens Le-Blond. LNCS, proceedings of the 6-th International Workshop on Distributed Computing IWDC'04, 2004, Kolkata, Inde.
• Efficient and Simple Encodings for the Web Graph with Jean-Loup Guillaume and Laurent Viennot. LNCS, proceedings of the 3-rd international conference Web-Age Information Management WAIM'02, 2002, Beijing, Chine. Abstract published in the proceedings of the 11-th international conference World Wide Web WWW'02, 2002, Honolulu, Hawaï.

• The lattice of integer partitions and its infinite extension with Ha Duong Phan. Discrete Mathematics 309 (6), 2009.
• Graph Encoding of 2D-gons tilings with Frédéric Chavanon, Michel Morvan, Eric Rémila and Laurent Vuillon. Theoretical Computer Science (TCS) 346, pages 226-253, 2005.
• Sandpile Models and Lattices: a Comprehensive Survey with Eric Goles, Clémence Magnien, Michel Morvan and Ha Duong Phan. Theoretical Computer Science (TCS) 322, pages 383-407, 2004.
• Generalized Tilings with Height Functions with Olivier Bodini. Morfismos 7:1, pages 47-68, 2003.
• The lattice of Delannoy paths with Jean-Michel Autebert and Sylviane Schwer. Discrete Mathematics 258:1-3, pages 225-234, 2002.
• Coding Distributive Lattices with Edge Firing Games with Clémence Magnien. Information Processing Letters (IPL) 83, pages 125-128, 2002.
• Integer Partitions, Tilings of 2D-gons and Lattices RAIRO-Theoretical Informatics and Applications (TIA) 36:4, pages 389-399, 2002. Extended abstract published in the proceedings of the 12-th international conference Formal Power Series and Algebraic Combinatorics FPSAC'00, Springer Verlag, 2000, Moscou, Russie (title: Generalized integer partitions, tilings of zonotopes and lattices).
• The lattice structure of Chip Firing Games and related models with Ha Duong Phan. Physica D 155, pages 69-82, 2001.
• Structure of some sand pile model with Roberto Mantaci, Michel Morvan and Ha Duong Phan. Theoretical Computer Science (TCS) 262, pages 525-556, 2001.
• Partitions of an integer into powers Discrete Mathematics and Theoretical Computer Science (DMTCS), proceedings of the 1-st international conference Discrete Models - Computation, Combinatorics and Geometry DM-CCG'01, 2001, Paris, France.
• Pseudo-permutations I: first combinatorial and lattice properties with Daniel Krob, Jean-Christophe Novelli, Ha Duong Phan and Sylviane Schwer. Proceedings of the 13-th international conference Formal Power Series and Algebraic Combinatorics FPSAC'01, 2001, Arizona, USA.

Matthieu.Latapy@lip6.fr
http://latapy.complexnetworks.fr