1. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267--285, April 2003. (bibtex entry)

2. A. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica, 35(2):95--110, 2003. (bibtex entry)

3. A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, and N. Stier. Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems, 24(2-4):123-138, October 2003. (bibtex entry)

1. P. Berthom, M. Diallo, and A. Ferreira. Generalized Parametric Multi-Terminal Flows Problem. In Proceedings of WG'03, volume 2880 of Lecture Notes in Computer Science, pages 71-80, June 2003. Springer Verlag. (bibtex entry)

2. S. Bhadra and A. Ferreira. Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks. In S. Pierre, M. Barbeau, and E. Kranakis, editors, Proceedings of Adhoc-Now'03, volume 2865 of Lecture Notes in Computer Science, Montreal, pages 259-270, October 2003. Springer Verlag. (bibtex entry)

3. B. Bui-Xuan, A. Ferreira, and A. Jarry. Evolving graphs and least cost journeys in dynamic networks. In Proceedings of WiOpt'03 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, Sophia Antipolis, pages 141--150, March 2003. INRIA Press. (bibtex entry)

4. A. Ferreira, S. P rennes, A. W. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. In Proceedings of the 10-th International Conference on Telecommunications -- ICT'2003, volume I, Tahiti, pages 12--18, 2003. IEEE. (bibtex entry)

BACK TO INDEX