BACK TO COATI PUBLICATION INDEX

Publications of year 2003

Books and proceedings
  1. B. Reed and C. Linhares-Sales, editors. Recent advances in algorithms and combinatorics, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, 11. Springer-Verlag, New York, 2003. [bibtex-entry]
     
Thesis
  1. H. Rivano. Algorithmique et télécommunications : coloration et multiflot approchés et applications aux réseaux d'infrastructure. PhD thesis, Université de Nice-Sophia Antipolis, November 2003. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  2. C. Touati. Les principes d'équité appliqués aux réseaux de télécommunications. PhD thesis, Université de Nice-Sophia Antipolis, September 2003. [bibtex-entry]
     
Articles in journal or book's chapters
  1. D. Coudert and X. Muñoz. Recent Research Developments in Optics, 3, chapter 37, Graph Theory and Traffic Grooming in WDM Rings, pages 759-778. Research Signpost. Kerala, India, 2003.
    Note: ISBN: 81-271-0028-5. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  2. B. Reed. Algorithmic aspects of tree width. In Recent advances in algorithms and combinatorics, volume 11 of CMS Books Math./Ouvrages Math. SMC, pages 85--107. Springer, New York, 2003. [bibtex-entry]
     
  3. R. Balakhrishnan, J-C. Bermond, P. Paulraja, and M-L. Yu. On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Mathematics, 268:49--58, 2003. [PDF ] [bibtex-entry]
     
  4. O. Barrientos, R. Correa, P. Reyes, and A. Valdebenito. A Branch and Bound Method for Solving Integer Separable Concave Problems. Comput. Optim. Appl., 26(2):155--171, 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. The power of small coalitions in graphs. Discrete Applied Mathematics, Editor's Choice, 127(3):399-414, 2003. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond and S. Ceroi. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks, 41(2):83--86, 2003. [PDF ] [bibtex-entry]
     
  7. J-C. Bermond, S. Choplin, and S. Pérennes. Hierarchical ring networks design. Theory of Computing Systems, 36(6):663--682, 2003. [PDF ] [bibtex-entry]
     
  8. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Journal of Combinatorial Designs, 11(2):100-112, 2003. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennes. Acyclic orientations for deadlock prevention in usual networks. Discrete Applied Mathematics, 129(1):31--47, 2003. [PDF ] [bibtex-entry]
     
  10. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed Virtual Path Layout in ATM networks. Theoretical Computer Science, 291(1):3--28, 2003. [PDF ] [bibtex-entry]
     
  11. 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]
     
  12. G. Calinescu, C. G. Fernandes, and B. Reed. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms, 48(2):333--359, 2003. [bibtex-entry]
     
  13. H. Cirstea, C. Kirchner, L. Liquori, and B. Wack. Rewrite strategies in the Rewriting Calculus. WRS, International Workshop on Reduction Strategies in Rewriting and Programming. Electr. Notes Theor. Comput. Sci., 86(4), 2003. [POSTSCRIPT ] [bibtex-entry]
     
  14. A. Clementi, A. Ferreira, P. Penna, S. Pérennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica, 35(2):95--110, 2003. [bibtex-entry]
     
  15. 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):123--138, October 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  16. J. Galtier, F. Hurtado, M. Noy, S. Pérennes, and J. Hurrutia. Simultaneous edge flipping in triangulations. International Journal of Computational Geometry and Applications, 13(2):113--133, 2003. [bibtex-entry]
     
  17. O. Goldschmidt, A. Laugier, and E. Olinick. SONET/SDH ring assignment with capacity constraints. Discrete Applied Math., 129:99--128, June 2003. [PDF ] [bibtex-entry]
     
  18. F. Havet. On unavoidability of trees with $k$ leaves. Graphs and Combinatorics, 19:101--110, 2003. [PDF ] [bibtex-entry]
     
  19. M. Loebl, J. Nesetril, and B. Reed. A note on random homomorphism from arbitrary graphs to $\mathbb Z$. Discrete Math., 273(1-3):173--181, 2003.
    Note: EuroComb'01 (Barcelona). [bibtex-entry]
     
  20. C. McDiarmid and B. Reed. Channel assignment on graphs of bounded treewidth. Discrete Math., 273(1-3):183--192, 2003.
    Note: EuroComb'01 (Barcelona). [bibtex-entry]
     
  21. B. Reed. The height of a random binary search tree. J. ACM, 50(3):306--332 (electronic), 2003. [bibtex-entry]
     
  22. C. Touati, E. Altman, and J. Galtier. Semi-definite programming approach for bandwidth allocation and routing in networks. Game Theory and Applications, 9:169--179, 2003. [bibtex-entry]
     
Conference's articles
  1. E. Altman, I. Buret, B. Fabre, J. Galtier, C. Guiraud, T. Tocker, and C. Touati. Slot allocation in a TDMA satellite system: simulated annealing approach. In Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit, Yokohama, Japan, April 2003. [PDF ] [bibtex-entry]
     
  2. E. Altman, J. Galtier, and C. Touati. Radio Planning in Multibeam Geostationary Satellite Networks. In Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit, Yokohama, Japan, April 2003. [PDF ] [bibtex-entry]
     
  3. E. Altman, J. Galtier, and C. Touati. Semi-definite programming approach for bandwidth allocation and routing in networks. In Proceedings of ITC 18, Berlin, Germany, pages 1091--1100, August/September 2003. [PDF ] [bibtex-entry]
     
  4. G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori. Pure Patterns Type Systems. In POPL, Symposium on Principles of Programming Languages, pages 250--261, 2003. ACM. [POSTSCRIPT ] [bibtex-entry]
     
  5. R. Bayon, N. Lygeros, and J.-S. Sereni. Nouveaux progrès dans l'énumération des modèles mixtes. In Knowledge discovery and discrete mathematics : JIM'2003, Université de Metz, France, pages 243--246, 2003. INRIA. [WWW ] [PDF ] [bibtex-entry]
     
  6. J-C. Bermond and D. Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE ICC, volume 2, Anchorage, Alaska, pages 1402-1406, May 2003.
    Note: ON07-3. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, D. Coudert, and X. Muñoz. Traffic Grooming in Unidirectional WDM Ring Networks: The All-to-all Unitary Case. In The 7th IFIP Working Conference on Optical Network Design & Modelling -- ONDM, Budapest, Hongrie, pages 1135-1153, 2003. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  8. J-C. Bermond, O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Réseaux de télécommunications minimaux embarqués tolérants. In Conference ALGOTEL2003, Banyuls, May 2003, pages 27--32, 2003. [PDF ] [bibtex-entry]
     
  9. J-C. Bermond, O. DeRivoyre, S. Pérennes, and M. Syska. Groupage par tubes. In Conference ALGOTEL2003, Banyuls, May 2003, pages 169--174, 2003. [PDF ] [bibtex-entry]
     
  10. 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]
     
  11. 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]
     
  12. M. Bouklit, D. Coudert, J-F. Lalande, C. Paul, and H. Rivano. Approximate multicommodity flow for WDM networks design. In J. Sibeyn, editor, SIROCCO 10, number 17 of Proceedings in Informatics, Umea, Sweden, pages 43--56, 2003. Carleton Scientific. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  13. M. Bouklit, D. Coudert, J-F. Lalande, and H. Rivano. Approximation combinatoire de multiflot fractionnaire : améliorations. In AlgoTel'03, Banyuls-sur-mer, France, mai 2003. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  14. 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]
     
  15. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract). In Proc. 5th Italian Conference on Algorithms and Complexity ( CIAC 2003), volume 2653 of Lecture Notes in Computer Science, pages 189--200, 2003. Springer-Verlag. [bibtex-entry]
     
  16. A. Ciaffaglione, L. Liquori, and M. Miculan. Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax. In MERLIN, International Workshop on Mechanized Reasoning about Languages with Variable Binding, 2003. ACM. [PDF ] [bibtex-entry]
     
  17. A. Ciaffaglione, L. Liquori, and M. Miculan. Imperative Object-Based Calculi in Co-inductive Type Theories. In LPAR, International Conference on Logic for Programming Artificial Intelligence and Reasoning, volume 2850 of Lecture Notes in Computer Science, pages 59--77, 2003. [PDF ] [bibtex-entry]
     
  18. H. Cirstea, L. Liquori, and B. Wack. Rewriting Calculus with Fixpoints: Untyped and First-order Systems. In TYPES, International Workshop on Types for Proof and Programs, volume 3085 of Lecture Notes in Computer Science, pages 147--161, 2003. Springer Verlag. [POSTSCRIPT ] [bibtex-entry]
     
  19. A. Clementi, G. Huiban, G. Rossi, and Y. Verhoeven. On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks. In Parallel and Distributed Processing Symposium (IPDPS), pages 8, April 2003. IEEE Computer Society Press. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  20. D. Coudert, H. Rivano, and X. Roche. A combinatorial approximation algorithm for the multicommodity flow problem. In K. Jansen and R. Solis-Oba, editors, WAOA 03, number 2909 of Lecture Notes in Computer Science, Budapest, Hungary, pages 256--259, September 2003. Springer-Verlag. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  21. O. Dalle and P. Mussi. Cooperative Software Development and Computational Resource Sharing. In NMSC System Simulation Workshop, ESTEC, Noordwijk, The Netherlands, March 2003. European Space Agency. [bibtex-entry]
     
  22. A. Ferreira, S. Perennes, A.W. Richa, H. Rivano, and N. Stier Moses. Models, complexity and algorithms for the design of multifiber WDM networks. In Telecommunications, 2003. ICT 2003. 10th International Conference on, volume 1, pages 12--18, 23 Feb.-1 March 2003. [PDF ] [Abstract] [bibtex-entry]
     
  23. F. Giroire, A. Nucci, N. Taft, and C. Diot. Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection. In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  24. C. Gomes and G. Robson Mateus. Alocação de Caminhos Comutatos por Rótulo em Redes Multiplexadas por Comprimento de Onda. In SPG, 2003. [bibtex-entry]
     
  25. A. Jarry and A. Laugier. Graphes 2-connexes à diamètre donné. In ROADEF 2003, number 5 of Proceedings in Informatics, Avignon, France, pages 102--104, June 2003. Université d'Avignon et des Pays de Vaucluse. [bibtex-entry]
     
  26. J.-F. Lalande, S. Pérennes, and M. Syska. Groupage dans les réseaux dorsaux WDM. In ROADEF 2003, number 5 of Proceedings in Informatics, Avignon, France, pages 254--255, June 2003. Université d'Avignon et des Pays de Vaucluse. [bibtex-entry]
     
  27. A. Laugier and S. Petat. Network Design and b-matching. In Proc. of International Network Optimization Conference, pages 374--379, 2003. [POSTSCRIPT ] [bibtex-entry]
     
  28. E. Trajano, D. Guigue, E. Costa, C. Gomes, H. Almeida, K. Silva, and N. Cavalcanti. SOS - A Tool for the Automatic Segmentation of Musical Flows. In IX SBCM, 2003. [bibtex-entry]
     
Internal reports
  1. F. Havet. Stable set meeting every longest path. Research Report, INRIA Research Report 5009 and I3S Research Report I3S/RR-2003-29-FR, 2003. [WWW ] [PDF ] [bibtex-entry]
     
  2. F. Havet. Upper bound for the span of (s,1)-total labelling of graphs. Research Report, INRIA Research Report 4816 and I3S Research Report I3S/RR-2003-13-FR, 2003. [WWW ] [PDF ] [bibtex-entry]
     
Miscellaneous
  1. A. Acosta. MOEDIG : Environnement de simulation pour modèles à évènements discrets généralisés. Rapport de Magistère en Ingénierie Electronique et Informatique, 6 mois, encadrants O. Dalle et P. Mussi, ENS Bretagne, 2003. [bibtex-entry]
     
  2. O. de Rivoyre. Optimisation du groupage dans les réseaux de télécommunication. Rapport de DEA RSD, 5 mois, encadrants J-C. Bermond et M. Syska, Université de Nice Sophia-Antipolis, 2003. [bibtex-entry]
     
  3. L. Esperet. Coloration $(d,1)$-totale et méthode probabiliste. Rapport de Magistère d'Informatique, 5 semaines, encadrant F. Havet, ENS Lyon, 2003. [bibtex-entry]
     
  4. F. Giroire. Etude de Problèmes Combinatoires liés à l'Analyse du Génome : Séquençage et Polymorphisme. Master's thesis, DEA Algorithmique, Université Paris VI., 2003. [PDF ] [bibtex-entry]
     
  5. G. Joutel. Synthèse de réseau. Rapport de Magistère d'Informatique, 6 semaines, encadrant J. Galtier, Université Claude Bernard, Lyon I, 2003. [bibtex-entry]
     
  6. N. Morales. Robust models for simultaneous open pit and underground mines. Rapport de stage Chilean pre-doc, 4 mois et 1/2, encadrant R. Klasing, 2003. [bibtex-entry]
     
  7. A. Papadopoulos. Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. Rapport de Master, Grèce, 6 mois, encadrant R. Klasing, 2003. [bibtex-entry]
     
  8. X. Roche. Approximation du multiflot fractionnaire. Rapport de Magistère d'Informatique, 5 semaines, encadrants D. Coudert et H. Rivano, ENS Lyon, 2003. [bibtex-entry]
     
  9. M.-E. Voge. Conception de réseaux SDH en anneaux. Rapport de DEA ROCO, 4 mois, encadrants M.Burlet et A.Laugier, INP Grenoble, 2003. [bibtex-entry]
     
  10. O. Dalle and O. Françoise. Building High Performance Communications Through the Virtual File System API. Solutions Linux International Conference, February 2003. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Tue Jul 25 17:12:04 2017