• Julian Monteiro, Alfredo Goldman, and Afonso Ferreira. Using Evolving Graphs Foremost Journeys to Evaluate Ad-Hoc Routing Protocols. In Proc. of the 25th Brazilian Symposium on Computer Networks (SBRC’07), pages 17-30, Belém/PA, Brasil, May 2007. [ bibtex ]

• Julian Monteiro, Alfredo Goldman, and Afonso Ferreira. Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. In Proc. of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob’06), pages 173-180, Montreal, CA, Jun 2006. Best Student Paper Award. [ bibtex ]

• Afonso Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24-29, Set 2004.[ bibtex ]
  

• Afonso Ferreira and Aubin Jarry. Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem. In Procedings of Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt’04), pages 55-61, Cambridge, UK, Mar 2004.[ bibtex ]
  

• Aubin Jarry and Zvi Lotker. Connectivity in evolving graphs with geometric properties. In Proceedings of the 2004 joint workshop on Foundations of Mobile Computing (DIALM-POMC), pages 24-30, Philadelphia, USA, 2004. ACM Press. [ bibtex ]
  

• Afonso Ferreira. Building a Reference Combinatorial Model for Dynamic Networks: Initial Results in Evolving Graphs. Research Report 5041, INRIA, Dec 2003.[ bibtex ]
  

• Sandeep Bhadra and Afonso Ferreira. Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks. In Proceedings of Adhoc-Now’03, volume 2865 of Lecture Notes in Computer Science, pages 259-270. Springer Verlag, Oct 2003.[ bibtex ]
  

• Binh Bui-Xuan, Afonso Ferreira, and Aubin Jarry. Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. International Journal of Foundations of Computer Science, 14(2):267-285, Apr 2003.[ bibtex ]
  

• Binh Bui-Xuan, Afonso Ferreira, and Aubin Jarry. Evolving graphs and least cost journeys in dynamic networks. In Proceedings of Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt’03), pages 141-150. INRIA Press, March 2003.[ bibtex ]
  

• Binh Bui Xuan, Afonso Ferreira, and Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Research Report RR-4589, INRIA, October 2002. [ bibtex ][ .html ]
  

• Sandeep Bhadra and Afonso Ferreira. Computing multicast trees in dynamic networks using evolving graphs. Research Report 4531, INRIA, Ago 2002.[ bibtex ][ .html ]
  

• Afonso Ferreira. On models and algorithms for dynamic communication networks: The case for evolving graphs. In 4e rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL’2002), Mèze, France, May 2002. [ bibtex ]
  

bibtex