1 PhD graduated 2015

2009-2017 Publications

• 2017
  • M. Latapy, E. Rotenberg, Ch. Crespelle, F. Tarissan : “Rigorous Measurement of the Internet Degree Distribution”, Complex Systems, vol. 26 (1), (Complex Systems Publications, Inc.) (2017)
• 2015
  • Ch. Crespelle, M. Latapy, Th. Phan : “On the termination of some biclique operators on multipartite graphs”, Discrete Applied Mathematics, vol. 195, pp. 59–73, (Elsevier) (2015)
• 2014
  • F. Tarissan, E. Rotenberg, M. Latapy, Ch. Crespelle : “UDP PING: a dedicated tool for improving measurements of the Internet topology”, MASCOTS'14 : IEEE 22^nd International Symposium on Modeling Analysis and Simulation of Computer and Telecomunication Systems, Paris, France, pp. 506-509 (2014)
  • M. Latapy, E. Rotenberg, Ch. Crespelle, F. Tarissan : “Measuring the degree distribution of routers in the core internet”, Proceedings of the 13^th IFIP International Conference on Networking, Trondheim, Norway, pp. 1-9, (IEEE) (2014)
  • E. Rotenberg, Ch. Crespelle, M. Latapy : “Measuring routing tables in the internet”, Proceedings of NetSciCom 2014, Toronto, Canada, pp. 795-800 (2014)
• 2011
  • Ch. Crespelle, F. Tarissan : “Evaluation of a new method for measuring the internet degree distribution: Simulation results”, Computer Communications, vol. 34 (5), pp. 635-648, (Elsevier) (2011)
• 2010
  • M. Latapy, Th. Phan, Ch. Crespelle, Th. Nguyen : “Termination of Multipartite Graph Series Arising from Complex Network Modelling”, 4^th Annual International Conference on Combinatorial Optimization and Applications - COCOA'10, vol. 6508, Lecture Notes in Computer science, Hawaii, Big Island, United States, pp. 1-10 (2010)
  • Ch. Crespelle, I. Todinca : “An $O(n^2)$-time Algorithm for the Minimal Interval Completion Problem”, TAMC 2010 - 7^th Annual Conference on Theory and Applications of Model of Computation, vol. 6108, Lecture Notes in Computer Science, Prague, Czechia, pp. 175–186, (IEEE) (2010)
  • Ch. Crespelle, M. Latapy, E. Rotenberg : “Rigorous Measurement of IP-Level Neighborhood of Internet Core Routers”, Second International Workshop on Network Scienece for Communication Networks (NetSciCom 2010), San Diego, CA, United States, pp. 499-504 (2010)
  • Ch. Crespelle, Ph. Gambette : “Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time”, Information Processing Letters, vol. 110, pp. 497-502, (Elsevier) (2010)
• 2009
  • Ch. Crespelle, Ph. Gambette : “Efficient Neighbourhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search”, IWOCA'09: 20^th International Workshop on Combinatorial Algorithms, vol. 5874, Lecture Notes in Computer Science, Hradec nad Moravicí, Czechia, pp. 146-157, (Springer Berlin / Heidelberg) (2009)