MASCOTTE no longer exists => visit the new COATI project-team
 


BACK TO MASCOTTE PUBLICATION INDEX

Publications of year 2001

Books and proceedings
  1. A. Ferreira and D. Krob, editors. Mobile Networks & Applications (MONET) -- Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM/Baltzer, 2001. [bibtex-entry]

  2. A. Ferreira and H. Reichel, editors. Proceedings of STACS 2001, volume 2010 of Lecture Notes in Computer Science. Springer-Verlag, 2001. [bibtex-entry]

  3. J. L. Ramìrez Alfonsìn and B. Reed, editors. Perfect graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Ltd., Chichester, 2001. [bibtex-entry]

Thesis
  1. D. Coudert. Algorithmique et optimisation de réseaux de communications optiques. PhD thesis, Université de Nice Sophia-Antipolis (UNSA), Décembre 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]

Articles in journal or book chapters
  1. H. Everett, C. M. H. de Figueiredo, C. Linhares-Sales, F. Maffray, O. Porto, and B. Reed. Even pairs. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 67--92. Wiley, Chichester, 2001. [bibtex-entry]

  2. A. Ferreira. Parallel Computing: Models. In C. A. Floudas and P. Pardalos, editors,Encyclopedia of Optimization -- Vol. IV, pages 264--269. Kluwer Academic Publisher, Boston (USA), 2001. [bibtex-entry]

  3. R. Hayward and B. Reed. Forbidding holes and antiholes. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 113--137. Wiley, Chichester, 2001. [bibtex-entry]

  4. B. Reed. A gentle introduction to semi-definite programming. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 233--259. Wiley, Chichester, 2001. [bibtex-entry]

  5. B. Reed. From conjecture to theorem. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 13--24. Wiley, Chichester, 2001. [bibtex-entry]

  6. J.-P. Allouche and M. Cosnard. Non-integer bases, iteration of continuous real maps, and an arithmetic self-similar set. Acta Mathematica Hungarica, 91:325--332, 2001. [bibtex-entry]

  7. E. Altman, E. Baçsar, T. Jiménez, and N. Shimkin. Competitive Routing in Networks with Polynomial Cost. IEEE Trans. on Automatic Control, 2001. [bibtex-entry]

  8. E. Altman, T. Jiménez, and G. Koole. Comparing tandem queueing systems and their fluid limits. PEIS, (2), 2001. [bibtex-entry]

  9. B. Beauquier, O. Delmas, and S. Pérennes. Tight Bounds for Broadcasting in the Linear Cost Model. Journal of Interconnection Network, 2(2):175--188, 2001. [bibtex-entry]

  10. P. Bergé, A. Ferreira, J. Galtier, and J.-N. Petit. A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations. International Journal on Telecommunication Systems, 18(1-3):123--135, 2001. [PDF ] [bibtex-entry]

  11. J.-C. Bermond, X. Muñoz, and A. Marchetti-Spaccamela. A Broadcasting Protocol in Line Digraphs. Journal of Parallel and Distributed Computing, 61(8):1013--1032, August 2001. [PDF ] [bibtex-entry]

  12. M. Cosnard and E. Jeannot. Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. Parallel Processing Letters, 11(1):151--168, 2001. [bibtex-entry]

  13. M. Diallo, A. Ferreira, and A. Rau-Chaplin. A note on communication-efficient deterministic p aralle algorithms for planar point location and 2D Voronoi diagram. Parallel Processing Letters, 11(2/3):327--340, 2001. [bibtex-entry]

  14. A. Ferreira, J. Galtier, J.-N. Petit, and H. Rivano. Re-routing algorithms in a meshed satellite constellation. Annals of Telecommunications, 56(3/4):169--174, march/april 2001. [PDF ] [Abstract] [bibtex-entry]

  15. M. Flammini and S. Pérennes. On the optimality of general lower bounds for broadcasting and gossiping. SIAM J. Discrete Math., 14(2):267--282, 2001. [bibtex-entry]

  16. P. Fraigniaud, A. Pelc, D. Peleg, and S. Pérennes. Assigning labels in unknown network with a leader. Distributed Computing, 14(3):163--183, 2001. [bibtex-entry]

  17. J. Galtier. Geographical reservation for guaranteed handover and routing in low earth orbit constellations. Telecommunication Systems, 18(1/3):101--121, 2001. [PDF ] [bibtex-entry]

  18. L. Gargano, P. Hell, and S. Pérennes. Coloring all directed paths in a symmetric tree, with an application to optical networks. Journal of Graph Theory, 38(4):183--196, 2001. [bibtex-entry]

  19. L. Gargano, A. Pelc, S. Pérennes, and U. Vaccaro. Efficient communication in unknown networks. Networks, 38(1):39--49, 2001. [bibtex-entry]

  20. F. Havet. Channel assignement and multicolouring of the induced subgraphs of the triangular lattice. Discrete Mathematics, 233:219--231, 2001. [bibtex-entry]

  21. M.-C. Heydemann, N. Marlin, and S. Pérennes. Complete Rotations in Cayley Graphs. European Journal of Combinatorics, 22(2):179-196, 2001. [WWW ] [bibtex-entry]

  22. C. Linhares-Sales, F. Maffray, and B. Reed. Recognizing planar strict quasi-parity graphs. Graphs Combin., 17(4):745--757, 2001. [bibtex-entry]

  23. D. Rautenbach and B. Reed. The Erdos-Pósa property for odd cycles in highly connected graphs. Combinatorica, 21(2):267--278, 2001.
    Note: Paul Erdos and his mathematics (Budapest, 1999). [bibtex-entry]

Conference articles
  1. J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. A Note on Cycle Covering. In ACM Symposium on Parallel Algorithms and Architectures -- SPAA, Crete island, Greece, pages 310-311, 4-6 July 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]

  2. J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Cycle Covering. In International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Proceedings in Informatics 11, Vall de Nuria, Spain, pages 21-34, 27-29 June 2001. Carleton Scientific. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]

  3. J.-C. Bermond, F. Havet, and D. Tóth. Design of fault tolerant on board networks with priorities. In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), Saint-Jean-de-Luz , France, pages 95--98, Mai 2001. [bibtex-entry]

  4. S. Bertrand, A. Laugier, and P. Mahey. Routing flows in networks with heterogenous protocols and path-dependent edge costs. In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), Saint-Jean-de-Luz , France, pages 55--60, Mai 2001. [bibtex-entry]

  5. A. Caminada, A. Ferreira, and L. Floriani. Principal Component Analysis for data volume reduction in experimental analysis of heuristics. In Proceedings of GECCO 2001 Workshop on Real-life Evolutionary Design Optimisation, San Francisco (USA), 2001. [bibtex-entry]

  6. I. Caragianis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano. Fractional path coloring on bounded degree trees. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proceedings of the 28th ICALP, volume 2076 of Lecture Notes in Computer Science, Crete, Greece, pages 732--743, July 2001. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]

  7. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. In V.B. Le A. Branstädt, editor, 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), volume 2204 of Lecture Notes in Computer Science, Boltenhagen, Germany, pages 21--31, June 2001. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]

  8. S. Choplin. Virtual Path Layout in ATM Path with given hop count. In International Conference on Networking, ICN01, volume 2094, Part II of LNCS, pages 527--537, 2001. Springer. [bibtex-entry]

  9. H. Cirstea, C. Kirchner, and L. Liquori. Matching Power. In RTA, International Conference on Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science, pages 77--92, 2001. [POSTSCRIPT ] [bibtex-entry]

  10. H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. In FoSSaCS, International Conference on Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 168--183, 2001. [POSTSCRIPT ] [bibtex-entry]

  11. M. Cosnard and L. Grigori. A Parallel Algorithm for Sparse Symbolic LU Factorization without Pivoting on Out of Core Matrices. In 15th ACM International Conference on Supercomputing (ICS'01), 2001. [bibtex-entry]

  12. D. Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications -- AlgoTel, St-Jean de Luz, France, pages 47-53, 28-30 Mai 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]

  13. D. Coudert and X. Muñoz. How Graph Theory can help Communications Engineering. In D.K.Gautam, editor, Broad band optical fiber communications technology -- BBOFCT, Jalgaon, India, pages 47-61, December 2001. Nirtali Prakashan.
    Note: Invited paper. [POSTSCRIPT ] [Abstract] [bibtex-entry]

  14. S. Céroi and F. Havet. Trees with three leaves are (n + 1)-unavoidable. In Jayme Szwarcfiter and Siang Song, editors, Electronic Notes in Discrete Mathematics, volume 7, 2001. Elsevier Science Publishers. [bibtex-entry]

  15. O. Dalle, J. Radzik, C. Rigal, F. Rodière, and C. Saroléa. ASIMUT: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks. In 19th International Communications Satellite Systems Conference (ICSSC), Toulouse, France, April 2001. AIAA. [bibtex-entry]

  16. H. Everett, C. M. H. de Figueiredo, S. Klein, and B. Reed. Bull-reducible Berge graphs are perfect. In Comb01---Euroconference on Combinatorics, Graph Theory and Applications, volume 10 of Electron. Notes Discrete Math., Amsterdam, pages 3 pp. (electronic), 2001. Elsevier. [bibtex-entry]

  17. G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. In Graph-theoretic concepts in computer science (Boltenhagen, 2001), volume 2204 of Lecture Notes in Comput. Sci., Berlin, pages 140--153, 2001. Springer. [bibtex-entry]

  18. J. Galtier. Semi-Definite Programming as a Simple Extension to Linear Programming: Convex Optimization with Queueing, Equity and Other Telecom Functionals. In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), Saint-Jean-de-Luz, pages 21--28, May 2001. [bibtex-entry]

  19. J. Galtier and A. Oliveira. A proposal to study satellite constellation routing via classical linear programming methods. In 43rd conference of the Canadian Operations Research Society, 2001. [bibtex-entry]

  20. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance Labeling in Graphs. In SODA'01, pages 210--219, 2001. [bibtex-entry]

  21. C. Gomes and A. H. Dominguez. Modelagem e Implementação do módulo tutor do ambiente AVA-TA@ead. In Anais XI Encontro de Iniciação Cientìfica da Universidade Federal de Alagoas, 2001. [bibtex-entry]

  22. F. Havet and M. Wennink. The Push Tree Problem. In SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures, Crète , Grèce, pages 318--319, Juillet 2001. [bibtex-entry]

  23. C. McDiarmid and B. Reed. Channel assignment on nearly bipartite and bounded treewidth graphs. In Comb01---Euroconference on Combinatorics, Graph Theory and Applications, volume 10 of Electron. Notes Discrete Math., Amsterdam, pages 4 pp. (electronic), 2001. Elsevier. [bibtex-entry]

  24. M. Molloy and B. Reed. Colouring graphs when the number of colours is nearly the maximum degree. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, New York, pages 462--470 (electronic), 2001. ACM. [bibtex-entry]

  25. D. Rautenbach and B. Reed. Approximately covering by cycles in planar graphs. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001), Philadelphia, PA, pages 402--406, 2001. SIAM. [bibtex-entry]

  26. H. Rivano. Planification de réseaux optiques WDM k-fibres. In AlgoTel'01 - $3^{e}$ Rencontres Françaises sur les Aspects Algorithmiques des Télécommunications, Saint-Jean-de-Luz, France, pages 41--46, mai 2001. [WWW ] [PDF ] [Abstract] [bibtex-entry]

Internal reports
  1. E. Altman, J. Galtier, and C. Touati. On fairness in bandwidth allocation. Rapport de Recherche 4269, INRIA, Sophia Antipolis, septembre 2001. [bibtex-entry]

  2. O. Audouin, C. Blaizot, E. Dotaro, M. Vigoureux, B. Beauquier, J.-C. Bermond, B. Bongiovanni, S. Pérennes, M. Syska, S. Bibas, L. Chacon, B. Decocq, E. Didelet, A. Laugier, A. Lisser, A. Ouorou, and F. Tillerot. Planification et Optimisation des Réseaux de Transport Optiques. Rapport final RNRT PORTO, Alcatel Research & Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France Télécom R&D, Sophia Antipolis, December 2001. [bibtex-entry]

  3. J.-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Technical report, INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR, 2001. [PDF ] [POSTSCRIPT ] [bibtex-entry]

  4. A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. Research Report, INRIA Research Report 4244, August 2001. [WWW ] [Abstract] [bibtex-entry]

  5. A. Ferreira, S. Pérennes, and H. Rivano. Fractional coloring of bounded degree trees. Research Report, INRIA Research Report 4094, January 2001. [WWW ] [Abstract] [bibtex-entry]

Internship reports
  1. N. Baskiotis. Dimensionnement heuristique des réseaux optiques WDM multifibres. Rapport de stage, ENS Lyon, 2001. [bibtex-entry]

  2. O. Bernardi. Réseaux de permutation et tolérance aux pannes. Rapport de Licence d'Informatique, ENS Paris, 2001. [bibtex-entry]

  3. S. Bhadra. Technique de décodage. Rapport de stage, IIT Madras, 2001. [bibtex-entry]

  4. B. Boschat, A. Cusumano, S. Fourré, and P. Nassif-Bouery. Optimisation de réseaux. Rapport de projet, Maîtrise d'Informatique, Université de Nice Sophia Antipolis, 2001. [bibtex-entry]

  5. T. Crulli. Partition de domaine en boucles. Rapport de stage, Brown university, 2001. [bibtex-entry]

  6. T. Dilys. Allocation de fréquences. Rapport de stage, IIT Bombay, 2001. [bibtex-entry]

  7. F. Giroire. Minimisation des commutateurs de réseaux de satellites avec excès d'entrées et de sorties. Rapport de Maîtrise d'Informatique, ENS Paris, 2001. [bibtex-entry]

  8. A. Jarry. Protection dans les réseaux optiques: graphes 2-connexes de diamètre fixé. Rapport de DEA, ENS Lyon, 2001. [bibtex-entry]

  9. J.-F. Lalande. Protection dans les réseaux de télécommunications. Rapport de DEA, ISIMA Clermont-Ferrand, 2001. [PDF ] [POSTSCRIPT ] [bibtex-entry]

  10. C. Lekbir and C. Scherhag. Finance algorithmique. Rapport de projet, IMAFA, 2001. [bibtex-entry]

  11. S. Rai. Design and optimisation of WDM networks. Rapport de stage, IIT New Delhi, 2001. [bibtex-entry]

  12. A. Raux. Site WWW du projet MASCOTTE. Rapport de 2e année, I.U.T., 2001. [bibtex-entry]

  13. S. Romanet. Interface et visualisation 3D pour la simulation de trafic routier. Rapport de Maîtrise, ISTG Grenoble, 2001. [bibtex-entry]

  14. R. Saint-Gratien. Evaluation et optimisation des performances du système de fichiers MPCFS. Rapport de projet, ESSI, 2001. [bibtex-entry]

  15. J. Savaresse. Microsimulation de trafic routier. Rapport de 2e année, ISIMA Clermont-Ferrand, 2001. [bibtex-entry]

  16. R. Sood. Application du couplage au problème de tournée de véhicules. Rapport de stage, IIT New Delhi, 2001. [bibtex-entry]

  17. N. Stier. Optimisation de réseaux optiques. Rapport de stage, MIT Boston, 2001. [bibtex-entry]

  18. G. Temporal. Conception de réseaux embarqués tolérants aux pannes. Rapport de DEA, Université de Nice Sophia Antipolis, 2001. [bibtex-entry]

  19. C. Vallebella. Routage et groupage dans les réseaux de transport optiques. Rapport de 3e année, ESSI, 2001. [bibtex-entry]


BACK TO MASCOTTE PUBLICATION INDEX



Last modified: Thu Oct 10 14:10:00 2013

This document was translated from BibTEX by bibtex2html