BACK TO COATI PUBLICATION INDEX

Publications of year 2002

Books and proceedings
  1. M. Molloy and B. Reed. Graph colouring and the probabilistic method, volume 23 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2002. [bibtex-entry]
     
  2. H. Alt and A. Ferreira, editors. Proceedings of STACS 2002, volume 2285 of Lecture Notes in Computer Science. Springer-Verlag, 2002. [bibtex-entry]
     
  3. O. Dalle, S. Frénot, and M. Riveill, editors. Cinquième Ecole d'Hiver des Télécommunications, Golfe Juan, France, December 2002. INRIA - CNRS - Univ. de Nice, INRIA. [bibtex-entry]
     
Thesis
  1. S. Choplin. Dimensionnement de réseaux virtuels de télécommunication. PhD thesis, Université de Nice - Sophia Antipolis, November 2002. [bibtex-entry]
     
  2. L. Floriani. Méthodes d'Analyse des Données Multivariables pour l'étude des Mécanismes des Heuristiques. PhD thesis, Université de Nice--Sophia Antipolis, January 2002. [bibtex-entry]
     
  3. A. Laugier. Cônes de Matrices et Programmation Mathématique : Quelques Applications. PhD thesis, Université de Nice--Sophia Antipolis, March 2002. [bibtex-entry]
     
Articles in journal or book's chapters
  1. M. Cosnard. Introduction to the Complexity of Parallel Algorithms. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications, Applied Optimization, chapter 1, part I, pages 3--25. Kluwer Academic Publishers, Boston (USA), 2002. [bibtex-entry]
     
  2. L. Devroye, C. McDiarmid, and B. Reed. Giant components for two expanding graph processes. In Mathematics and computer science, II (Versailles, 2002), Trends Math., pages 161--173. Birkhäuser, Basel, 2002. [bibtex-entry]
     
  3. A. Ferreira. Parallel Computing: Models. In C. Floudas and P. Pardalos, editors,Encyclopedia of Optimization. Kluwer Academic Publisher, Boston (USA), 2002. [bibtex-entry]
     
  4. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and hand-over in satellite networks. In I. Stojmenovic, editor,Handbook of Wireless Networks and Mobile Computing, pages 473--507. John Wiley and Sons, 2002. [PDF ] [bibtex-entry]
     
  5. A. Ferreira and I. Guérin-Lassous. Discrete Computing with Coarse Grained Systems. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications, Applied Optimization, chapter 5, part I, pages 117--143. Kluwer Academic Publishers, Boston (USA), 2002. [bibtex-entry]
     
  6. B. Beauquier and E. Darrot. On Arbitrary Size Waksman Networks and their Vulnerability. Parallel Processing Letters, 12(3), 2002. [bibtex-entry]
     
  7. J-C. Bermond, E. Darrot, and O. Delmas. Design of fault tolerant on-board networks in satellites. Networks, 40:202--207, 2002. [PDF ] [bibtex-entry]
     
  8. H.-J. Böckenhauer, J. Hromkovic, R. Klasing, S. Seibert, and W. Unger. Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. Theoretical Computer Science, 285(1):3--24, 2002. [bibtex-entry]
     
  9. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. Algorithmica, 33:183--200, 2002. [bibtex-entry]
     
  10. H. Cirstea, C. Kirchner, and L. Liquori. Rewriting Calculus with(out) Types. WRLA, International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci., 71, 2002. [POSTSCRIPT ] [bibtex-entry]
     
  11. C. Cooper, A. Frieze, B. Reed, and O. Riordan. Random regular graphs of non-constant degree: independence and chromatic number. Combin. Probab. Comput., 11(4):323--341, 2002. [bibtex-entry]
     
  12. C. Cooper, A. Frieze, and B. Reed. Random regular graphs of non-constant degree: connectivity and Hamiltonicity. Combin. Probab. Comput., 11(3):249--261, 2002. [bibtex-entry]
     
  13. D. Coudert, A. Ferreira, and S. Pérennes. Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks. Networks (Wiley-Interscience), 40(3):155-164, October 2002. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  14. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs: Algorithms and Experiments. Concurrency and Computation - Practice and Experience, 56(1):47--70, january 2002. [bibtex-entry]
     
  15. F. Havet. Trees in Tournament. Discrete Mathematics, 243(1--3):121--134, 2002. [PDF ] [bibtex-entry]
     
  16. F. Havet and J. Zerovnik. Finding a Five Bicolouring of a Triangle-Free Subgraph of the Triangular Lattice. Discrete Mathematics, 244:103--108, 2002. [bibtex-entry]
     
  17. B. Reed and B. Sudakov. Asymptotically the list colouring constants are 1. J. Combin. Theory Ser. B, 86(1):27--37, 2002. [bibtex-entry]
     
Conference's articles
  1. E. Altman, J. Galtier, and C. Touati. Fair power and transmission rate control in wireless networks. In Proc. of IEEE GlobeCom'02, Taipei, Taiwan, November 2002. [bibtex-entry]
     
  2. E. Altman, J. Galtier, and C. Touati. Utility Based Fair Bandwidth Allocation. In IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications (NPDPA 2002), 2002. [bibtex-entry]
     
  3. E. Altman, J. Galtier, and C. Touati. Semi-Definite Programming Approach for Bandwidth Allocation and Routing in Networks. In Proc. of 10th Int. Symp. on Dynamic Games and Application -- Networking Games & Resource Allocation Workshop (NGRA-2002), Petrozavodsk, Russia, July 2002. Altman and Mazaloz. [bibtex-entry]
     
  4. J-C. Bermond, S. Choplin, and S. Pérennes. Hierarchical Ring Network Design. In 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02), pages 1--16, 2002. Carleton Scientific. [bibtex-entry]
     
  5. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. In Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002), volume 2556 of Lecture Notes in Computer Science, pages 59--70, 2002. Springer-Verlag. [bibtex-entry]
     
  6. D. Coudert and H. Rivano. Routage optique dans les réseaux WDM multifibres avec conversion partielle.. In AlgoTel'02, Mèze, France, pages 17-24, May 2002. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  7. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM networks with wavelength translators. In Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, volume 3, pages 2686--2690vol.3, 17-21 Nov. 2002.
    Note: OPNT-01-5. [PDF ] [Abstract] [bibtex-entry]
     
  8. A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. In AlgoTel'02, Mèze, France, pages 25--32, May 2002. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  9. A. Ferreira. On models and algorithms for dynamic communication networks: The case for evolving graphs. In 4$^{\rm e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2002), Mèze, France, May 2002. [bibtex-entry]
     
  10. F. Havet. Robustness of a Routing Tree for the Push Tree Problem. In $4^{e}$ rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02), Mèze, France, pages 81--86, May 2002. [bibtex-entry]
     
  11. F. Havet. Design of Fault Tolerant Satellite Networks with Priorities via Selectors. In Proc. of SIROCCO'02, Andros, Greece, pages 165--180, June 2002. [bibtex-entry]
     
  12. G. Huiban, S. Pérennes, and M. Syska. Traffic Grooming in WDM Networks with Multi-Layer Switches. In IEEE ICC, New-York, April 2002.
    Note: CD-Rom. [bibtex-entry]
     
  13. A. Jarry. Disjoint Paths in Symmetric Digraphs. In International Colloquium on Structural Information and Communi cation Complexity -- SIROCCO, Andros, Greece, pages 211--222, June 2002. Carleton. [bibtex-entry]
     
  14. P. Mussi. Tuning Car Following Algorithms for Realistic Behaviour. In AI, Simulation & Planning in High Autonomy Systems, Lisbon, Portugal, pages 281--284, April 2002. [bibtex-entry]
     
  15. B. Reed and B. Sudakov. List colouring of graphs with at most $(2-o(1))\chi$ vertices. In Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002), Beijing, pages 587--603, 2002. Higher Ed. Press. [bibtex-entry]
     
Internal reports
  1. E. Altman, J. Galtier, and C. Touati. Fair Bandwidth allocation between service providers in a geostationary satellite network. Technical report RR-4421, INRIA, March 2002. [bibtex-entry]
     
  2. N. Baskiotis, S. Pérennes, and H. Rivano. Heuristic design of multifiber WDM optical networks by randomized rounding of multicommodity flow. Research Report RR-4418, INRIA Research Report 4418, 2002. [WWW ] [Abstract] [bibtex-entry]
     
  3. B. Beauquier, S. Pérennes, and M. Syska. Efficient Access to Optical Bandwidth, Routing and Grooming in WDM Networks: State-of-the-art survey. IST CRESCCO report, Projet MASCOTTE (CNRS/INRIA/UNSA), Sophia Antipolis, July 2002. [bibtex-entry]
     
  4. J-C. Bermond and S. Céroi. Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Technical report RR-4626, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
  5. S. Bessy, F. Havet, and J. Palaysi. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4522, Projet MASCOTTE, Sophia Antipolis, August 2002. [bibtex-entry]
     
  6. S. Bhadra and A. Ferreira. Computing multicast trees in dynamic networks using evolving graphs. Research Report 4531, INRIA, 2002. [bibtex-entry]
     
  7. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM optical networks with wavelength translators. Research Report, INRIA Research Report 4487, 2002. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. A. Ferreira and L. Viennot. A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks. Research Report 4403, INRIA, 2002. [bibtex-entry]
     
  9. F. Giroire, A. Nucci, N. Taft, and C. Diot. Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection. Technical Report, Sprint, 2002. [Abstract] [bibtex-entry]
     
  10. F. Havet and M-L. Yu. On $(d,1)$-total labelling of graphs. Rapport de recherche INRIA, Projet MASCOTTE, Sophia Antipolis, November 2002. [bibtex-entry]
     
  11. F. Havet. Pancyclic Arcs and Connectivity in Tournaments. Rapport de recherche INRIA/RR-4378, Projet MASCOTTE, Sophia Antipolis, March 2002. [bibtex-entry]
     
  12. A. Jarry and A. Laugier. Two-connected graphs with given diameter. Technical report RR-4307, INRIA, Sophia Antipolis, March 2002. [bibtex-entry]
     
  13. A. Jarry. Integral Symmetric 2-Commodity Flows. Technical report RR-4622, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
  14. B. Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Technical report RR-4589, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]
     
Miscellaneous
  1. O. de Rivoyre. Le Groupage par Tubes. Rapport de stage, 3e année d'Ingénieur, ESSI, September 2002. [bibtex-entry]
     
  2. O. Françoise. Conception d'une API de contrôle générique pour le noyau Linux basée sur le mécanisme de système de fichiers virtuels. Rapport de stage de DEA, ESSI, June 2002. [bibtex-entry]
     
  3. J-C. Godin. Choisissabilité de graphes et allocations de fréquences. Rapport de DEA MDFI, Université de Luminy, Marseille, 2002. [bibtex-entry]
     
  4. T. Guillier. Implantation au niveau utilisateur du protocole de contrôle de MPCFS. Rapport de stage, 2e année d'Ingénieur, ESSI, 2002. [bibtex-entry]
     
  5. B. Lévèque. Minimisation du nombre d'ADM dans les réseaux WDM. Rapport de stage, ENS Lyon, Licence d'Informatique, 2002. [bibtex-entry]
     
  6. P. Pons. Recherche d'algorithmes pour évaluer la disponibilité d'un réseau de télécommunications. Rapport de DEA, September 2002. [bibtex-entry]
     
  7. S. Rai. Design and optimization of WDM networks: Grooming. Rapport de stage, IIT New Delhi, 2002. [bibtex-entry]
     
  8. F. Viger. Modélisation de phénomènes complexes du trafic routier. Rapport de Maîtrise d'Informatique, ENS, 2002. [bibtex-entry]
     
  9. R. Vuillemot. Conception d'un modèle du protocole GMPLS pour l'environnement de simulation ASIMUT. Rapport de Licence d'Informatique, ENS Lyon, 2002. [bibtex-entry]
     
  10. M. Walter. Evaluation et validation d'un logiciel de dimensionnement de réseaux. Rapport de DESS, ESSI, 2002. [bibtex-entry]
     
  11. M. Syska. PORTO: Planification et Optimisation des Réseaux de Transport Optiques. Poster, Colloque annuel du RNRT, Grenoble, 7 février, 2002. [WWW ] [bibtex-entry]
     
  12. B. M. B. Xuan. Graphes évolutifs et réseaux dynamiques à calendrier fixé, 2002. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Fri Oct 20 15:06:03 2017