Accepted and published papers

  1. Dimitri Papadimitriou (2014) Routing for the Internet's growth. net-Xperiment future. (PDF) (BibTeX)
  2. Matthieu Latapy, Assia Hamzaoui and Clémence Magnien (2013) Detecting Events in the Dynamics of Ego-centered Measurements of the Internet Topology. Journal of Complex Networks, 2(1):38-59. (PDF) (BibTeX)
  3. Coupechoux, Émilie and Tarissan, Fabien (2013) Un modèle pour les graphes bipartis aléatoires avec redondance. In 4ème Conférence sur les Modèles et l'Analyse des Réseaux : Approches Mathématiques et Informatique (MARAMI)., pages 1-10. (PDF) (BibTeX)
  4. Korman, Amos, Sereni, Jean-Sébastien and Viennot, Laurent (2013) Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Computing, 26(5-6):289-308. (PDF) (BibTeX)
  5. Aur\'elien Lancin and Dimitri Papadimitriou (2013) DRMSim: A Routing-Model Simulator for Large-Scale Networks. ERCIM News, 94:31-32. (PDF) (BibTeX)
  6. Daniel F. Bernardes, Matthieu Latapy and Fabien Tarissan (2013) Inadequacy of SIR model to reproduce key properties of real-world spreading cascades: experiments on a large-scale P2P system. Social Network Analysis and Mining, 3(4):1195-1208. (PDF) (BibTeX)
  7. Gavoille, Cyril, Glacet, Christian, Hanusse, Nicolas and Ilcinkas, David (2013) On the Communication Complexity of Distributed Name-Independent Routing Schemes. In $27^{th}$ International Symposium on Distributed Computing (DISC). oct. Springer, page 12. ((URL)) (PDF) (BibTeX)
  8. Elie Rotenberg, Christophe Crespelle and Matthieu Latapy (2014) Measuring Routing Tables in the Internet. In Proceedings of the IEEE International Workshop on Network Science for Communication Networks (NetSciCom). May. (BibTeX)
  9. Fabien Tarissan, Elie Rotenberg, Matthieu Latapy and Christophe Crespelle (2014) UDP Ping: a dedicated tool for improving measurements of the Internet topology. In IEEE 22nd International Symposium on Modeling Analysis and Simulation of Computer and Telecomunication Systems (MASCOTS'14).. (BibTeX)
  10. Ioannis Caragiannis and Alexandros Voudouris (2014) Welfare guarantees for proportional allocations. In 7th International Symposium on Algorithmic Game Theory (SAGT).. (BibTeX)
  11. Dimitri Papadimitriou, Didier Colle, Pieter Audenaert and Piet Demeester (2013) Geometric Information Routing. In Proceedings of Seventh IEEE International Conference on Advanced Networks and Telecommunication Systems (ANTS) 2013 To appear. Chennai, India, December. (BibTeX)
  12. Clémence Magnien, Amélie Medem, Serguey Kirgizov and Fabien Tarissan (2013) Towards realistic modeling of IP-level routing topology dynamics. Networking Science, 3(1-4):24-33. (BibTeX)
  13. Coudert, David, Hogie, Luc, Lancin, Aur{\'e}lien, Papadimitriou, Dimitri, P{\'e}rennes, St{\'e}phane and Tahiri, Issam (2013) Feasibility study on distributed simulations of BGP. Research Report RR-8283, INRIA. ((URL)) (PDF) (BibTeX)
  14. Giroire, F., Modrzejewski, R., Nisse, N. and P\'erennes, S. (2013) Maintaining Balanced Trees For Structured Distributed Streaming Systems. In Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO).. Springer. ((URL)) (PDF) (BibTeX)
  15. Aynaud, Thomas, Blondel, Vincent D., Guillaume, Jean-Loup and Lambiotte, Renaud (2013) Multilevel Local Optimization of Modularity. In Graph Partitioning., John Wiley & Sons, Inc., pages 315-345. ((URL)) (BibTeX)
  16. Sahhaf, S., Dixit, A, Tavernier, W., Colle, D., Pickavet, M. and Demeester, P. (2013) Scalable and energy-efficient optical tree-based greedy router. In Transparent Optical Networks (ICTON), 2013 15th International Conference on. June, pages 1-4. (BibTeX)
  17. Lambiotte, Renaud, Tabourier, Lionel and Delvenne, Jean-Charles (2013) Burstiness and spreading on temporal networks. The European Physical Journal B, 86(7). ((URL)) (BibTeX)
  18. Giroire, Frederic, Modrzejewski, Remigiusz, Nisse, Nicolas and P{\'e}rennes, St{\'e}phane (2013) Maintaining Balanced Trees For Structured Distributed Streaming Systems. Research Report RR-8309, INRIA. ((URL)) (BibTeX)
  19. Papadimitriou, D., Careglio, D., Tarissan, F. and Demeester, P. (2013) Method of reliability and availability analysis from the dynamic properties of routing and forwarding paths. In Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2013 5th International Congress on. Sept, pages 222-228. (BibTeX)
  20. Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou (2013) Summary and Conclusions. In Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. (Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou, Eds.) Springer, pages 195-203. (BibTeX)
  21. Gavoille, Cyril, Glacet, Christian, Hanusse, Nicolas and Ilcinkas, David (2013) Algorithme distribu\'e de routage compact en temps optimal. In 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel). may. (Nisse, Nicolas et Rousseau, Franck et Busnel, Yann, Eds.) HAL, pages 117-120. ((URL)) (PDF) (BibTeX)
  22. (2013) Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. (Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou, Eds.)volume 7586 of Lecture Notes in Computer Science, Springer. (BibTeX)
  23. Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou (2013) Introduction. In Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. (Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou, Eds.) Springer, pages 1-4. (BibTeX)
  24. Dimitri Papadimitriou and Florin Coras and Alberto Rodriguez and Valentin Carela and Davide Careglio and Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Piet Demeester (2013) Iterative Research Method Applied to the Design and Evaluation of a Dynamic Multicast Routing Scheme. In Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. (Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou, Eds.) Springer, pages 107-126. (BibTeX)
  25. Dimitri Papadimitriou and Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Piet Demeester (2013) Measurement-Based Experimental Research Methodology. In Measurement Methodology and Tools - First European Workshop, FP7 FIRE/EULER Project, Aalborg, Denmark, May 9, 2012, Revised and Extended Papers. (Llu\'{\i}s F{\`a}brega and Pere Vil{\`a} and Davide Careglio and Dimitri Papadimitriou, Eds.) Springer, pages 5-22. (BibTeX)
  26. Matthieu Latapy, Elie Rotenberg, Christophe Crespelle, Fabien Tarissan (2014) Measuring the Degree Distribution of Routers in the Core Internet. In IFIP Networking 2014.. (BibTeX)
  27. Papadimitriou, D., Careglio, D. and Demeester, P. (2014) Performance analysis of multicast routing algorithms. In Computing, Networking and Communications (ICNC), 2014 International Conference on. Honolulu (Hawaii), United States, Feb, pages 455-461. (BibTeX)
  28. Dimitri Papadimitriou (2014) Probe Placement Problem. NMRG Meeting - IETF 89. ((URL)) (BibTeX)
  29. Dimitri Papadimitriou (2014) Complexity: the good, the bad, and the ugly. NMRG Meeting - IETF 89. ((URL)) (BibTeX)
  30. Dimitri Papadimitriou (2014) Geometric analysis of flow betweenness centrality. In Proc. SIAM Workshop on Network Science (NS14), co­located with the 2014 SIAM Annual Meeting. Chicago, Illinois, USA, jul. SIAM. (BibTeX)
  31. Dimitri Papadimitriou (2014) Geometric analysis of flow betweenness centrality. In Proc. SIAM Workshop on Network Science (NS14), co­located with the 2014 SIAM Annual Meeting. Chicago, Illinois, USA, jul. SIAM. (BibTeX)
  32. Dimitri Papadimitriou (2014) Geometric foundation to information networks. In Proc. SIAM Conference on Discrete Mathematics. Minneapolis, MN, USA, jun. SIAM. (BibTeX)
  33. G. Karagiannis, A. Petrescu, D. Papadimitriou and B. Wissingh (2014) Problem Statement for Internet-wide Geo-networking. IETF draft http://tools.ietf.org/html/draft-karagiannis-problem-statement-geonetworking-01. ((URL)) (BibTeX)
  34. Coudert, David and Ducoffe, Guillaume (2014) Recognition of C4-free and 1/2-hyperbolic graphs. {Siam Journal on Discrete Mathematics}, 28(3):1601-1617. ((URL)(approve sites)) (PDF)(approve sites) (BibTeX)
  35. Coudert, David and Ducoffe, Guillaume (2014) On the recognition of $C\_4$-free and $1/2$-hyperbolic graphs. Research Report RR-8458, INRIA. ((URL)) (BibTeX)
  36. Camelo, M., Papadimitriou, D., Fàbrega, L., Vilà, P. (2014) Geometric Routing With Word-Metric Spaces. IEEE Communications Letters, 18(12):2125-2128. ((URL)) (BibTeX)
  37. A. Kumar and J.-C. Delvenne (2014) A new route discovery scheme. IETF draft http://tools.ietf.org/html/draft-kumar-route-discovery-00. ((URL)) (BibTeX)
  38. Sahhaf, S., Tavernier, W., Colle, D., Pickavet, M. and Demeester, P. (2014) Availability analysis of resilient geometric routing on Internet topology. In Design of Reliable Communication Networks (DRCN), 2014 10th International Conference on the. April, pages 1-8. (BibTeX)
  39. Dimitri Papadimitriou and Bernard Fortz (2014) Time-dependent combined network design and optimization. In Proc. 2014 IEEE International Conference on Communications (ICC 2014). Sidney, Australia, jun. IEEE. (BibTeX)
  40. Dimitri Papadimitriou and Bernard Fortz (2014) Methods for time-dependent combined network design and routing optimization. In Proc. 2014 IEEE International Global Communications Conference (Globecom 2014). Austin, TX, USA, dec. IEEE. (BibTeX)
  41. Miguel Camelo, Pere Vilà, Lluís Fàbrega and Dimitri Papadimitriou (2014) Cayley-Graph-based Data Centers and Space Requirements of a Routing Scheme using Automata. In 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops. June. IEEE Computer Society, pages 63-69. (BibTeX)
  42. Miguel Camelo, Dimitri Papadimitriou, Lluís Fàbrega and Pere Vilà (2014) Efficient Routing in Data Center with Underlying Cayley Graph. In Complex Networks V, pages 189-197. . Springer International Publishing. ((URL)) (BibTeX)
  43. Davide Careglio, Dimitri Papadimitriou, Fernando Agraz, Sahel Sahhaf, Jordi Perelló and Wouter Tavernier (2014) On the experimentation of the novel GCMR multicast routing in a large-scale testbed. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications - Demo session (Infocom 2014). Toronto, Canada, April. (BibTeX)
  44. Davide Careglio, Dimitri Papadimitriou, Fernando Agraz, Sahel Sahhaf, Jordi Perelló, Wouter Tavernier, Salvatore Spadaro and Didier Colle (2014) Development and experimentation towards a multicast-enabled Internet. In Proceedings of the 17th IEEE Global Internet Symposium (GI2014), co-located with IEEE Infocom 2014. Toronto, Canada, April. (BibTeX)
  45. Coudert, David, Mazauric, Dorian and Nisse, Nicolas (2014) Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth. In 13th International Symposium on Experimental Algorithms. Copenhagen, Denmark, pages 46-58. ((URL)) (BibTeX)
  46. Kosowski, A., Li, B., Nisse, N. and Suchan, K. (2014) k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica. ((URL)) (BibTeX)
  47. A. Petrescu, M. Shore, G. Karagiannis, D. Farinacci, D. Papadimitriou, A. Chaiken, B. Wissingh, D. Shihui, R. Buddenberg, C. Reed and B. Dickson (2014) An Overview of the GeoNet BoF.. ((URL)) (BibTeX)
  48. sahel sahhaf, Abhishek Dixit, Wouter Tavernier, Didier Colle, Mario Pickavet and Piet Demeester (2014) All-Optical Tree-based Greedy Router. In Optical Fiber Communication Conference.. Optical Society of America, W2A.7. ((URL)) (BibTeX)
  49. Li, Bi, Moataz, Fatima Zahra and Nisse, Nicolas (2014) Minimum Size Tree-Decompositions. In {9th International colloquium on graph theory and combinatorics (ICGT)}. Grenoble, France. ((URL)) (BibTeX)
  50. Becker, Florent, Kosowski, Adrian, Matamala, Martin, Nisse, Nicolas, Rapaport, Ivan, Suchan, Karol and Todinca, Ioan (2014) Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Computing. ((URL)) (BibTeX)
  51. Hendrickx, J.M. (2014) Views in a Graph: To Which Depth Must Equality Be Checked? Parallel and Distributed Systems, IEEE Transactions on, 25(7):1907-1912. (BibTeX)
  52. Sahel Sahhaf, Wouter Tavernier, Didier Colle, Mario Pickavet and Piet Demeester (2013) Link failure recovery technique for greedy routing in the hyperbolic plane. Computer Communications, 36(6):698 - 707. ((URL)) (BibTeX)
  53. Sahhaf, S., Tavernier, W., Colle, D., Pickavet, M. and Demeester, P. (2013) Single failure resiliency in greedy routing. In Design of Reliable Communication Networks (DRCN), 2013 9th International Conference on the. March, pages 306-313. (BibTeX)
  54. Pedro Pedroso, Dimitri Papadimitriou and Davide Careglio (2011) Dynamic compact multicast routing on power-law graphs. In in Proceedings of 2011 IEEE Global Communication Conference (Globecom 2011). Houston, TX, USA, dec. ((URL)) (PDF) (BibTeX)
  55. Ioannis Caragiannis, Angelo Fanelli, Nick Gravin and Alexander Skopalik (2011) Efficient computation of approximate pure Nash equilibria in congestion games. In 52th annual IEEE Symposium on Foundations of Computer Science (FOCS11). Palm Springs, CA, USA, oct. IEEE, pages 532-541. ((URL)) (PDF) (BibTeX)
  56. Atsonios, Ioannis, Beaumont, Olivier, Hanusse, Nicolas and Kim, Yusik (2011) On Power-Law Distributed Balls in Bins and its Applications to View Size Estimation. In 22nd International Symposium on Algorithms and Computation (ISAAC). Yokohama, Japon, dec. Springer, pages 504-513. ((URL)) (PDF) (BibTeX)
  57. Papadimitriou, Dimitri, Coras, Florin and Cabellos, Albert (2011) Path-vector routing stability analysis. SIGMETRICS Perform. Eval. Rev., 39(3):22-24. ((URL)) (BibTeX)
  58. Christian Glacet, David Ilcinkas and Nicolas Hanusse (2011) The impact of edge deletions on the number of errors in networks. In 15th International Conference on Principles of Distributed Systems (OPODIS). dec. Springer, pages 378-391. ((URL)) (PDF) (BibTeX)
  59. Gavoille, Cyril, Godfroy, Quentin and Viennot, Laurent (2011) Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners. In 15th International Conference on Principles of Distributed Systems (OPODIS). Toulouse, France, dec. Springer, pages 143-158. ((URL)) (PDF) (BibTeX)
  60. Dimitri, Papadimitriou and Albert, Cabellos (2012) Stability Analysis of Path-vector Routing. In {14{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications (AlgoTel)}. La Grande Motte, France, may. (Mathieu, Fabien et Hanusse, Nicolas, Eds.) Pages 1-4. ((URL)) (PDF) (BibTeX)
  61. Kosowski, A., Li, B., Nisse, N. and Suchan, K. (2012) k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In 14es Rencontres Francophones sur les Aspects Algorithmiques de T{\'e}l{\'e}communications (AlgoTel). may, pages 83-86. ((URL)) (PDF) (BibTeX)
  62. Coudert, David, Hogie, Luc, Lancin, Aur\'elien, Papadimitriou, Dimitri, Perennes, St\'ephane and Tahiri, Issam (2012) Feasibility Study on Distributed Simulations of BGP. In 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS). Zhangjiajie, China, jul. IEEE, page 3. (PDF) (BibTeX)
  63. de Montgolfier, Fabien, Soto, Mauricio and Viennot, Laurent (2011) Asymptotic Modularity of some Graph Classes. In 22nd International Symposium on Algorithms and Computation (ISAAC). Yokohama, dec. Springer, pages 435-444. ((URL)) (PDF) (BibTeX)
  64. Fabien Tarissan, Bruno Quoitin, Pascal Mérindol, Benoit Donnet, Jean-Jacques Pansiot and Matthieu Latapy (2013) Towards a bipartite graph modeling of the internet topology. Computer Networks, 57(11):2331-2347. (PDF) (BibTeX)
  65. Qin, Xin, Jean-Charles, Delvenne, Zhanlong, Zhang and Wei, He (2011) Improved Compact Routing Scheme with Applications in Static Sensor Networks and Internet. In The 2011 IEEE International Conference on Cyber, Physical, and Social Computing. Dalian, China, oct. (PDF) (BibTeX)
  66. de Montgolfier, Fabien, Soto, Mauricio and Viennot, Laurent (2011) Treewidth and Hyperbolicity of the Internet. In 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA). Boston, aug, pages 25-32. (PDF) (BibTeX)
  67. P. Pedroso, D. Papadimitriou and D. Careglio (2011) A name-independent compact multicast routing algorithm. Research Report UPC-DAC-RRCBA-2011-15, UPC. ((URL)) (BibTeX)
  68. Lambiotte, R., Sinatra, R., Delvenne, J.-C., Evans, T. S., Barahona, M. and Latora, V. (2011) Flow graphs: Interweaving dynamics and structure. Phys. Rev. E, 84:017102. ((URL)) (BibTeX)
  69. C. Caillouet, F. Huc, N. Nisse, S. P\'erennes and H. Rivano (2010) Stability of a localized and greedy routing algorithm. In 12th Workshop on Advances in Parallel and Distributed Computational Models (APDCM).. IEEE, 8p. ((URL)) (PDF) (BibTeX)
  70. Nicolas Hanusse and David Ilcinkas and Adrian Kosowski and Nicolas Nisse (2010) Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. (Andr{\'e}a W. Richa and Rachid Guerraoui, Eds.) ACM, pages 355-364. (BibTeX)
  71. Delvenne, Jean-Charles and Libert, Anne-Sophie (2011) Centrality measures and thermodynamic formalism for complex networks. Phys. Rev. E, 83:046117. ((URL)) (BibTeX)
  72. Becker, F., Matamala, M., Nisse, N., Rapaport, I., Suchan, K. and Todinca, I. (2011) Reconstruire un graphe en une ronde. In 13es Rencontres Francophones sur les Aspects Algorithmiques de T\'el\'ecommunications (AlgoTel). Cap Est\'erel, France, may. (Ducourthial and Bertrand et Felber and Pascal, Eds.). ((URL)) (BibTeX)
  73. Abraham, Ittai and Gavoille, Cyril (2011) On approximate distance labels and routing schemes with affine stretch. In 25th International Symposium on DIStributed Computing (DISC'11). Roma, Italy, sep. Springer, pages 404-415. ((URL)) (PDF) (BibTeX)
  74. Miguel H. Camelo, Pere Vilà, Lluís Fàbrega, Pedro Pedroso, Davide Careglio and Dimitri Papadimitriou (2011) Functional Model of a Routing System Architecture. In in Proceedings of the 1st Workshop "Future Internet: Efficiency in high-speed networks" (W-FIERRO 2011), Ed. Pablo Pavón Mariño, pp. 19-26, ISBN: 978-84-96997-69-1. jul. (PDF) (BibTeX)
  75. Abdelhamid Salah Brahim, Bénédicte Le Grand, Lionel Tabourier and Matthieu Latapy (2011) Citations among blogs in a hierarchy of communities: method and case study. Journal of Computer Science, 2(3):247-252. (PDF) (BibTeX)
  76. Florent Becker and Mart\'{\i}n Matamala and Nicolas Nisse and Ivan Rapaport and Karol Suchan and Ioan Todinca (2011) Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. In 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May, 2011 - Conference Proceedings. may. IEEE, pages 508-514. (BibTeX)
  77. Matthieu Latapy, Clémence Magnien and Frédéric Ouédraogo (2011) A Radar for the Internet. Complex Systems, 20(1). (PDF) (BibTeX)
  78. Kosowski, Adrian, Li, Bi, Nisse, Nicolas and Suchan, Karol (2012) k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. In 39th International Colloquium on Automata, Languages and Programming (ICALP, track C). jul. Springer, pages 610-622. ((URL)) (PDF) (BibTeX)
  79. Florent Becker and Adrian Kosowski and Nicolas Nisse and Ivan Rapaport and Karol Suchan (2012) Allowing each node to communicate only once in a distributed system: shared whiteboard models.. In 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). jun. ACM, pages 11-17. (PDF) (BibTeX)
  80. Dimitri Papadimitriou, Lluís Fàbrega, Pere Vilà, Davide Careglio and Piet Demeester (2012) Measurement-based research: methodology, experiments and tools. ACM SIGCOMM Computer Communication Review, 42(5):62-68. ((URL)) (BibTeX)
  81. Clémence Magnien, Amélie Medem and Fabien Tarissan (2012) Towards realistic modeling of IP-level routing topology dynamics. In {14{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications (AlgoTel)}. La Grande Motte, France, Apr. (PDF) (BibTeX)
  82. Daniel Bernardes, Matthieu Latapy and Fabien Tarissan (2012) Examining Key Properties of Diffusion Models for Large-Scale Real-World Networks. In {14{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications (AlgoTel)}. La Grande Motte, France, Apr. (PDF) (BibTeX)
  83. Daniel F. Bernardes, Matthieu Latapy and Fabien Tarissan (2012) Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System. In Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). aug. (PDF) (BibTeX)
  84. Ioannis Caragiannis and Michele Flammini and Luca Moscardelli (2013) An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. IEEE/ACM Trans. Netw., 21(4):1322-1331. (BibTeX)
  85. Dimitri Papadimitriou, Albert Cabellos-Aparicio and Florin Coras (2013) Stability metrics and criteria for path-vector routing. In Proc. of International Conference on Computing, Networking and Communications (ICNC 2013). San Diego (CA), USA, January. IEEE. (BibTeX)
  86. Nisse, Nicolas and Soares, Ronan (2013) On the Monotonicity of Process Number. In {7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)}. Mexico, Mexico, apr. Elsevier, pages 141-147. ((URL)) (BibTeX)
  87. Delvenne, Jean-Charles, Schaub, MichaelT., Yaliraki, SophiaN. and Barahona, Mauricio (2013) The Stability of a Graph Partition: A Dynamics-Based Framework for Community Detection. In Dynamics On and Of Complex Networks, Volume 2, pages 221-242. . Springer New York. ((URL)) (BibTeX)
  88. Cucuringu, Mihai, Blondel, Vincent D. and Van Dooren, Paul (2013) Extracting spatial information from networks with low-order eigenvectors. Phys. Rev. E, 87:032803. ((URL)) (BibTeX)
  89. Cohen, Nathann, Coudert, David and Lancin, Aurélien (2013) Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. In 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel). Pornic, France, May. (Nisse, Nicolas et Rousseau, Franck et Busnel, Yann, Eds.) Pages 1-4. ((URL)) (PDF) (BibTeX)
  90. Dimitri Papadimitriou, Davide Careglio, Fabien Tarissan, and Piet Demeester (2013) Internet routing paths stability model and relation to forwarding paths. In Design of Reliable Communication Networks (DRCN), 2013 9th International Conference on the. Budapest, Hungary, March. IEEE, pages 20-27. (PDF) (BibTeX)
  91. Sébastien Heymann, Matthieu Latapy and Clémence Magnien (2012) Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. In Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012). aug. (PDF) (BibTeX)
  92. Xiaomin Wang, Matthieu Latapy and Michèle Soria, (2012) Deciding on the type of the degree distribution of a graph from traceroute-like measurements. International Journal of Computer Networks & Communications, 4(2):1-20. (PDF) (BibTeX)
  93. John Augustine and Ioannis Caragiannis and Angelo Fanelli and Christos Kalaitzis (2012) Enforcing efficient equilibria in network design games via subsidies. In 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '12). jun, pages 277-286. (PDF) (BibTeX)
  94. Gautier M Krings, Márton Karsai, Sebastian Bernharsson, Vincent D Blondel and Jari Saramäki (2012) Effects of time window size and placement on the structure of aggregated networks. EPJ Data Science, 1(4). (PDF) (BibTeX)
  95. Papadimitriou, Dimitri, Zahariadis, Theodore, Martinez-Julia, Pedro, Papafili, Ioanna, Morreale, Vito, Torelli, Francesco, Sales, Bernard and Demeester, Piet (2012) Design Principles for the Future Internet Architecture. In The Future Internet, pages 55-67. . Springer Berlin Heidelberg. ((URL)) (BibTeX)
  96. Abraham, Ittai, Chechik, Shiri and Gavoille, Cyril (2012) Fully Dynamic Approximate Distance Oracles for Planar Graphs via Forbidden-Set Distance Labels. In {$44^{th}$} Annual ACM Symposium on Theory of Computing (STOC). may. ACM Press, pages 1199-1218. ((URL)) (PDF) (BibTeX)
  97. Ioannis Caragiannis and Christos Kalaitzis (2012) Space Lower Bounds for Low-Stretch Greedy Embeddings. In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO '12). jul, pages 1-12. (PDF) (BibTeX)
  98. Ioannis Caragiannis and Angelo Fanelli and Nick Gravin and Alexander Skopalik (2012) Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure. In 13th ACM Conference on Electronic Commerce (EC '12). jun, pages 284-301. (PDF) (BibTeX)
  99. Amélie Medem, Clémence Magnien and Fabien Tarissan (2012) Impact of power-law topology on IP-level routing dynamics: simulation results. In Proceedings of Fourth International Workshop on Network Science for Communication Networks (NetSciCom 2012). mar. (PDF) (BibTeX)
  100. Nicolas Nisse, Ivan Rapaport and Karol Suchan (2012) Distributed computing of efficient routing schemes in generalized chordal graphs. Theoretical Compututer Science, 444:17-27. (PDF) (BibTeX)
  101. Schaub, , Michael T. AND Delvenne, , Jean-Charles AND Yaliraki, , Sophia N. AND Barahona, , Mauricio (2012) Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit. PLoS ONE, 7(2):e32210. ((URL)) (BibTeX)
  102. Ioannis Caragiannis and Edith Elkind and Mario Szegedy and Lan Yu (2012) Mechanism design: from partial to probabilistic verification. In 13th ACM Conference on Electronic Commerce (EC '12). jun, pages 266-283. (PDF) (BibTeX)
  103. Ioannis Caragiannis and Angelo Fanelli and Nick Gravin and Alexander Skopalik (2012) Computing approximate pure Nash equilibria in congestion games. SIGecom Exchanges, 11(1):26-29. (BibTeX)