Publications of year 2005

1. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, Springer Monograph. Springer-Verlag, 2005. [bibtex-entry]

1. A. Jarry. Connexité dans les réseaux de télécommunications. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, March 2005. [bibtex-entry]

1. L. Addario-Berry, R. E. L. Aldred, K. Dalal, and B. Reed. Vertex colouring edge partitions. J. Combin. Theory Ser. B, 94(2):237--244, 2005. [bibtex-entry]


2. D. Avis, C. De Simone, and B. Reed. On the fractional chromatic index of a graph and its complement. Oper. Res. Lett., 33(4):385--388, 2005. [bibtex-entry]


3. R. Bayon, N. Lygeros, and J.-S. Sereni. New progress in enumeration of mixed models. Applied Mathematics E-Notes, 5:60--65, 2005. [WWW ] [PDF ] [bibtex-entry]


4. J-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic Grooming in Unidirectional WDM Rings With Grooming Ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005. [PDF ] [Abstract] [bibtex-entry]


5. S. Choplin, A. Jarry, and S. Pérennes. Virtual network embedding in the cycle. Discrete Applied Mathematics, 145(3):368--375, 2005. [bibtex-entry]


6. C. Cooper, R. Klasing, and M. Zito. Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics, 2(3):275--300, 2005. [bibtex-entry]


7. D. J. Dougherty, P. Lescanne, L. Liquori, and F. Lang. Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. TERMGRAPH: International Workshop on Computing with Terms and Graphs. Electr. Notes Theor. Comput. Sci., 127(5):57--82, 2005. [POSTSCRIPT ] [bibtex-entry]


8. H. Everett, C. M. H. de Figueiredo, S. Klein, and B. Reed. The perfection and recognition of bull-reducible Berge graphs. Theor. Inform. Appl., 39(1):145--160, 2005. [bibtex-entry]


9. B. Farzad, M. Molloy, and B. Reed. $(\Delta-k)$-critical graphs. J. Combin. Theory Ser. B, 93(2):173--185, 2005. [bibtex-entry]


10. M. Flammini and S. Pérennes. Lower bounds on systolic gossip. Information and Computation, 196(2):71--94, 2005. [bibtex-entry]


11. L. Liquori and S. Ronchi Della Rocca. Towards an Intersection Typed System à la Church. ITRS: Workshop on Intersection Types and Related Systems. Electr. Notes Theor. Comput. Sci., 136:43--56, 2005. [POSTSCRIPT ] [bibtex-entry]


12. L. Liquori and B. Wack. The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference]. WRLA: International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci., 117:89--111, 2005. [POSTSCRIPT ] [bibtex-entry]


13. B. Reed and B. Sudakov. List colouring when the chromatic number is close to the order of the graph. Combinatorica, 25(1):117--123, 2005. [bibtex-entry]

1. L. Addario-Berry, K. Dalal, and B. Reed. Degree constrained subgraphs. In Proceedings of GRACO2005, volume 19 of Electron. Notes Discrete Math., Amsterdam, pages 257--263 (electronic), 2005. Elsevier. [bibtex-entry]


2. S. Alouf, E. Altman, J. Galtier, J.-F. Lalande, and C. Touati. Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites. In IEEE INFOCOM 2005, Miami, FL, pages 71--94, March 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


3. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. In 12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Le Mont Saint-Michel, France, pages 34-48, May 24-26 2005. LNCS 3499. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


4. J.-C. Bermond and J. Peters. Efficient Gathering in Radio Grids with Interference. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 103--106, May 2005. [PDF ] [bibtex-entry]


5. C. Chaudet, E. Fleury, I. Guérin-Lassous, H. Rivano, and M.-E. Voge. Optimal positioning of active and passive monitoring devices. In CoNEXT 2005, Toulouse, France, October 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. C. Chaudet, E. Fleury, I. Guérin-Lassous, H. Rivano, and M.-E. Voge. Surveillance passive dans l'Internet. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 121--124, May 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. D. Coudert, S. Perennes, Q-C. Pham, and J-S. Sereni. Rerouting requests in WDM networks. In AlgoTel'05, Presqu'île de Giens, France, pages 17-20, mai 2005. [PDF ] [Abstract] [bibtex-entry]


8. S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Approximate min-max relations for odd cycles in planar graphs. In Integer programming and combinatorial optimization, volume 3509 of Lecture Notes in Comput. Sci., Berlin, pages 35--50, 2005. Springer. [bibtex-entry]


9. S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Planar graph bipartization in linear time. In Proceedings of GRACO2005, volume 19 of Electron. Notes Discrete Math., Amsterdam, pages 265--271 (electronic), 2005. Elsevier. [bibtex-entry]


10. M. Flammini, L. Moscardelli, A. Navarra, and S. Pérennes. Asymptotically Optimal Solutions for Small World Graphs. In Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005), volume 3724 of Lecture Notes in Computer Science, pages 414--428, September 2005. Springer Verlag. [WWW ] [bibtex-entry]


11. M. Flammini, A. Navarra, and S. Pérennes. The Real approximation factor of the MST heuristic for the Minimum Energy Broadcasting. In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005), volume 3503 of Lecture Notes in Computer Science, pages 22--31, May 2005. Springer Verlag. [WWW ] [bibtex-entry]


12. F. V. Fomin, P. Fraigniaud, and N. Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 364-375, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. P. Fraigniaud and N. Nisse. Stratégies d'encerclement connexes dans un réseau. In 7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), pages 13-16, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. J. Galtier, A. Laugier, and P. Pons. Algorithms to evaluate the reliability of a network. In The 5th International Workshop on Design of Reliable Communication Networks, pages 93--100, 2005. [WWW ] [PDF ] [bibtex-entry]


15. F. Giroire. Order statistics and estimating cardinalities of massive data sets. In Conrado Martínez, editor, 2005 International Conference on Analysis of Algorithms, volume AD of DMTCS Proceedings, pages 157-166, 2005. Discrete Mathematics and Theoretical Computer Science. [WWW ] [PDF ] [Abstract] [bibtex-entry]


16. C. Gomes and G. Robson Mateus. Low-Cost Design Approach to WDM Mesh Networks. In 4th International Conference on Networking (ICN), pages 60-67, 2005. [bibtex-entry]


17. A. Guitton and J. Moulierac. Scalable Tree Aggregation for Multicast. In 8th International Conference on Telecommunications (ConTEL), pages 129--134, June 2005.
    Note: Best Student Paper Award. [PDF ] [Abstract] [bibtex-entry]


18. F. Havet, R. J. Kang, and J.-S. Sereni. Improper colouring of unit disk graphs. In Proceedings of the 7th International Conference on Graph Theory (ICGT'05), volume 22 of Electronic Notes in Discrete Mathematics, pages 123--128, September 2005. Elsevier. [WWW ] [PDF ] [bibtex-entry]


19. F. Havet and J.-S. Sereni. Channel assignment and improper choosability of graphs. In Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), volume 3787 of Lecture Notes in Computer Science, pages 81--90, June 2005. Springer Verlag. [WWW ] [PDF ] [bibtex-entry]


20. G. Huiban and G. Robson Mateus. A MILP model for the reconfiguration problem in multi-fiber WDM networks. In SBRC Simpósio Brasileiro de Redes de Computadores, May 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


21. G. Huiban and G. Robson Mateus. A multiobjective approach of the virtual topology design and routing problem in WDM networks. In ICT International Conference on Telecommunications, May 2005. IEEE Computer Society Press. [WWW ] [PDF ] [Abstract] [bibtex-entry]


22. R. J. Kang, T. Müller, and J.-S. Sereni. Improper colouring of (random) unit disk graphs. In Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005), Discrete Mathematics and Theoretical Computer Science, pages 193--198, September 2005. [WWW ] [PDF ] [bibtex-entry]


23. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From Balls and Bins to Points and Vertices. In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), volume 3827 of Lecture Notes in Computer Science, pages 757--766, December 2005. Springer Verlag. [WWW ] [PDF ] [bibtex-entry]


24. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Approximation bounds for Black Hole Search problems. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005), volume 3974 of Lecture Notes in Computer Science, December 2005. Springer Verlag. [WWW ] [bibtex-entry]


25. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), volume 3499 of Lecture Notes in Computer Science, pages 200--215, May 2005. Springer Verlag. [WWW ] [bibtex-entry]


26. J.-F. Lalande, M. Syska, and Y. Verhoeven. Arrondi aléatoire et protection des réseaux WDM. In Ecole Polytechnique de l'Université de Tours, editor, ROADEF, number 6, Tours, France, pages 241--242, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


27. A. Laugier and S. Raymond. Recherche de graphes expansifs dans le graphe du Web. In Roadef, 2005. [WWW ] [bibtex-entry]


28. Z. Li and B. Reed. Heap building bounds. In Algorithms and data structures, volume 3608 of Lecture Notes in Comput. Sci., Berlin, pages 14--23, 2005. Springer. [bibtex-entry]


29. C. Meagher and B. Reed. Fractionally total colouring $G\sb {n,p}$. In Proceedings of GRACO2005, volume 19 of Electron. Notes Discrete Math., Amsterdam, pages 297--303 (electronic), 2005. Elsevier. [bibtex-entry]


30. J. Moulierac and A. Guitton. QoS Scalable Tree Aggregation. In IFIP Networking, number 3462 of LNCS, pages 1405--1408, May 2005. [PDF ] [Abstract] [bibtex-entry]


31. S. Petat and M.-E. Voge. Groupage sur un chemin orienté. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 21--24, May 2005. [PDF ] [bibtex-entry]


32. H. Rivano, F. Théoleyre, and F. Valois. Influence de l'auto-organisation sur la capacité des réseaux ad hoc. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 53--56, May 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]

1. L. Addario-Berry, F. Havet, and S. Thomassé. Paths with two blocks in $n$-chromatic digraphs. Research report, INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


2. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Technical report, INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


3. J-C. Bermond, M. Cosnard, D. Coudert, and S. Perennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Technical report, INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


4. C. Cooper, R. Klasing, and M. Zito. Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Technical report, INRIA Research Report RR-5529 and I3S Research Report I3S/RR-2005-09-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


5. D. Coudert, P. Datta, H. Rivano, and M.-E. Voge. Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks. Research Report, I3S Research Report I3S/RR-2005-37-FR, 2005. [WWW ] [PDF ] [bibtex-entry]


6. C. Gomes and H. Rivano. WDM Mesh Networks with Dynamic Traffic. Research report, INRIA Research Report 5713, 2005. [WWW ] [Abstract] [bibtex-entry]


7. F. Havet. Repartitors, selectors and superselectors. Research report, INRIA Research Report 5686, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


8. G. Huiban and P. Datta. Virtual topology reconfiguration issues in evolution of WDM optical networks. Research report 5711, INRIA, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. G. Huiban and G. Robson Mateus. Optimization aspects of the reconfiguration problem in WDM networks. Research report, INRIA Research Report 5730 and I3S Research Report I3S/RR-2005-33-FR, 2005. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. R. J. Kang, T. Müller, and J.-S. Sereni. Improper colouring of (random) unit disk graphs. Research report, INRIA Research Report 5761 and I3S Research Report I3S/RR-2005-35-FR, November 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


11. R. Klasing, C. Laforest, J. Peters, and N. Thibault. Constructing Incremental Sequences in Graphs. Research Report, INRIA Research Report RR-5648 and I3S Research Report I3S/RR-2005-22-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


12. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Approximation Results for Black Hole Search in Arbitrary Networks. Research Report, INRIA Research Report RR-5659 and I3S Research Report I3S/RR-2005-23-FR, 2005. [PDF ] [POSTSCRIPT ] [bibtex-entry]


13. J. Moulierac and A. Guitton. Distributed Multicast Tree Aggregation. Technical report 5636, Inria, July 2005. [PDF ] [Abstract] [bibtex-entry]


14. J. Moulierac and M. Molnàr. Active monitoring of delays with asymmetric routes. Technical report 5635, Inria, July 2005. [PDF ] [Abstract] [bibtex-entry]

1. M.-L. Gnemmi. Mise en place de démonstrations pas-à-pas d'algorithmes de graphes. Rapport de première année d'élève ingénieur, 2 mois, encadrant D. Coudert, ENSEA, 2005. [PDF ] [bibtex-entry]


2. C. Lepelletier. Problèmes de charge et de longueur d'onde sur des réseaux tolérants des pannes. Mémoire de DEA, 3 mois, encadrants J.-C. Bermond and S. Bessy, DEA MDFI, Marseille, 2005. [bibtex-entry]


3. C. Savio. Estimation de Matrices Origine-Destination en Temps Réel. Rapport de Mastère Recherche, 6 mois, encadrant P. Mussi, ENTPE Vaulx-en-Velin, 2005. [PDF ] [bibtex-entry]


4. C. Savio. Estimation de Matrices Origine-Destination en Temps Réel: Utilisation de données issues de véhicules instrumentés en milieu urbain. Rapport de fin d'études TPE, 3 mois, encadrant P. Mussi, ENTPE Vaulx-en-Velin, 2005. [PDF ] [bibtex-entry]

This document was translated from BibT_EX by bibtex2html