2009 | ||
---|---|---|
41 | EE | Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy: Fast dynamics in Internet topology: preliminary observations and explanations CoRR abs/0904.2716: (2009) |
40 | EE | Clémence Magnien, Matthieu Latapy, Michel Habib: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs CoRR abs/0904.2728: (2009) |
39 | EE | Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira: Detection, Understanding, and Prevention of Traceroute Measurement Artifacts CoRR abs/0904.2733: (2009) |
38 | EE | Oussama Allali, Matthieu Latapy, Clémence Magnien: Measurement of eDonkey Activity with Distributed Honeypots CoRR abs/0904.3215: (2009) |
37 | EE | Fabien Tarissan, Matthieu Latapy, Christophe Prieur: Efficient Measurement of Complex Networks Using Link Queries CoRR abs/0904.3222: (2009) |
2008 | ||
36 | EE | Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo: A Radar for the Internet. ICDM Workshops 2008: 901-908 |
35 | EE | Matthieu Latapy, Clémence Magnien: Complex Network Measurements: Estimating the Relevance of Observed Properties. INFOCOM 2008: 1660-1668 |
34 | EE | Clémence Magnien, Matthieu Latapy, Michel Habib: Fast computation of empirically tight bounds for the diameter of massive graphs. ACM Journal of Experimental Algorithmics 13: (2008) |
33 | EE | Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo: A Radar for the Internet CoRR abs/0807.1603: (2008) |
32 | EE | Frederic Aidouni, Matthieu Latapy, Clémence Magnien: Ten weeks in the life of an eDonkey server CoRR abs/0809.3415: (2008) |
31 | EE | Matthieu Latapy, Walter Willinger: Complex computer and communication networks. Computer Networks 52(15): 2817-2818 (2008) |
30 | EE | Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira: Detection, understanding, and prevention of traceroute measurement artifacts. Computer Networks 52(5): 998-1018 (2008) |
29 | EE | Matthieu Latapy: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1-3): 458-473 (2008) |
2007 | ||
28 | EE | Jeremie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian: Describing and simulating internet routes. Computer Networks 51(8): 2067-2085 (2007) |
2006 | ||
27 | EE | Brice Augustin, Xavier Cuvellier, Benjamin Orgogozo, Fabien Viger, Timur Friedman, Matthieu Latapy, Clémence Magnien, Renata Teixeira: Avoiding traceroute anomalies with Paris traceroute. Internet Measurement Conference 2006: 153-158 |
26 | EE | Matthieu Latapy, Clémence Magnien: Measuring Fundamental Properties of Real-World Complex Networks CoRR abs/cs/0609115: (2006) |
25 | EE | Matthieu Latapy: Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs CoRR abs/cs/0609116: (2006) |
24 | EE | Jean-Loup Guillaume, Matthieu Latapy, Damien Magoni: Relevance of massively distributed explorations of the Internet topology: Qualitative results. Computer Networks 50(16): 3197-3224 (2006) |
23 | EE | Pascal Pons, Matthieu Latapy: Computing Communities in Large Networks Using Random Walks. J. Graph Algorithms Appl. 10(2): 191-218 (2006) |
22 | EE | Ravi Kumar, Matthieu Latapy: Preface. Theor. Comput. Sci. 355(1): 1-5 (2006) |
2005 | ||
21 | EE | Fabien Viger, Matthieu Latapy: Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. COCOON 2005: 440-449 |
20 | EE | Pierre Fraigniaud, Philippe Gauron, Matthieu Latapy: Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. Euro-Par 2005: 1163-1172 |
19 | EE | Jean-Loup Guillaume, Matthieu Latapy: Relevance of massively distributed explorations of the Internet topology: simulation results. INFOCOM 2005: 1084-1094 |
18 | EE | Stevens Le-Blond, Jean-Loup Guillaume, Matthieu Latapy: Clustering in P2P Exchanges and Consequences on Performances. IPTPS 2005: 193-204 |
17 | EE | Pascal Pons, Matthieu Latapy: Computing Communities in Large Networks Using Random Walks. ISCIS 2005: 284-293 |
16 | EE | Jeremie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian: Describing and Simulating Internet Routes. NETWORKING 2005: 659-670 |
15 | EE | Fabien Viger, Matthieu Latapy: Fast generation of random connected graphs with prescribed degrees CoRR abs/cs/0502085: (2005) |
14 | EE | Frédéric Chavanon, Matthieu Latapy, Michel Morvan, Eric Rémila, Laurent Vuillon: Graph encoding of 2D-gon tilings. Theor. Comput. Sci. 346(2-3): 226-253 (2005) |
2004 | ||
13 | EE | Jean-Loup Guillaume, Matthieu Latapy: Bipartite Graphs as Models of Complex Networks. CAAN 2004: 127-139 |
12 | EE | Jean-Loup Guillaume, Matthieu Latapy, Stevens Le-Blond: Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution. IWDC 2004: 126-137 |
11 | EE | Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien: Comparison of Failures and Attacks on Random and Scale-Free Networks. OPODIS 2004: 186-196 |
10 | EE | Jeremie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian: Describing and Simulating Internet Routes CoRR cs.NI/0411051: (2004) |
9 | EE | Jean-Loup Guillaume, Matthieu Latapy: Bipartite structure of all complex networks. Inf. Process. Lett. 90(5): 215-221 (2004) |
8 | EE | Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan: Sandpile models and lattices: a comprehensive survey. Theor. Comput. Sci. 322(2): 383-407 (2004) |
2002 | ||
7 | EE | Jean-Loup Guillaume, Matthieu Latapy, Laurent Viennot: Efficient and Simple Encodings for the Web Graph. WAIM 2002: 328-337 |
6 | EE | Jean-Michel Autebert, Matthieu Latapy, Sylviane R. Schwer: Le treillis des chemins de Delannoy. Discrete Mathematics 258(1-3): 225-234 (2002) |
5 | EE | Matthieu Latapy: Integer Partitions, Tilings of 2D-gons and Lattices. ITA 36(4): 389-399 (2002) |
4 | EE | Matthieu Latapy, Clémence Magnien: Coding distributive lattices with Edge Firing Games. Inf. Process. Lett. 83(3): 125-128 (2002) |
2001 | ||
3 | EE | Matthieu Latapy: Partitions of an Integer into Powers. DM-CCG 2001: 215-228 |
2 | EE | Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan: Structure of some sand piles model. Theor. Comput. Sci. 262(1): 525-556 (2001) |
2000 | ||
1 | EE | Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan: Structure of some sand pile model CoRR cs.DM/0008002: (2000) |