1. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 143(1-3):54-61, 2004.
   

   @Article{CFK+04,
   
    author = {I. Caragiannis and A. Ferreira and C. Kaklamanis and S. P\'erennes and P. Persiano and H. Rivano},
   
    title = {Approximate Constrained Bipartite Edge Coloring},
   
    journal = {Discrete Applied Mathematics},
   
    year = {2004},
   
    OPTkey = {},
   
    volume = {143},
   
    number = {1-3},
   
    pages = {54-61},
   
    OPTmonth = {},
   
    OPTnote = {To be published},
   
    KEYWORDS = {approximation, coloration}
    
   }

2. A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24--29, 2004.
   

   @Article{Fer04,
   
    title={Building a reference combinatorial model for MANETs},
   
    author={A. Ferreira},
   
    journal={IEEE Network},
   
    volume={18},
   
    number={5},
   
    year={2004},
   
    pages={24--29},
   
    KEYWORDS={telecoms, dynamic networks, evolving graphs}
    
   }

1. A. Ferreira and A. Jarry. Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem. In Proceedings of WiOpt'04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, University of Cambridge, UK, March 2004.
   

   @InProceedings{FeJa04,
   
    author = {A. Ferreira and A. Jarry},
   
    title = {Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem},
   
    booktitle = {Proceedings of WiOpt'04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks},
   
    OPTcrossref = {},
   
    OPTkey = {},
   
    OPTpages = {},
   
    year = {2004},
   
    OPTeditor = {},
   
    OPTvolume = {},
   
    OPTnumber = {},
   
    OPTseries = {},
   
    address = {University of Cambridge, UK},
   
    month = {March},
   
    OPTorganization = {},
   
    OPTpublisher = {},
   
    OPTnote = {},
   
    keywords = {dynamic networks, evolving graphs, energy aware, trees},
   
    OPTannote = {}
    
   }

BACK TO INDEX