BACK TO COATI PUBLICATION INDEX

Publications of year 2006

Books and proceedings
  1. T. Ören, L. Torres, F. Amblard, J.-P. Belaud, J. Caussanel, O. Dalle, R. Duboz, A. Ferrarini, C. Frydman, E.-A. M. Hamri, D. Hill, A. Naamane, P. Siron, E. Tranvouez, and G. Zacharewicz. Modeling and Simulation Dictionary: English-French-Turkish. Prof. Tuncer Ören, 2006. [bibtex-entry]
     
Thesis
  1. F. Giroire. Réseaux, algorithmique et analyse combinatoire de grands ensembles. PhD thesis, Université Paris VI, November 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. G. Huiban. The reconfiguration problem in multifiber WDM networks. PhD thesis, University of Nice Sophia Antipolis & Federal University of Minas Gerais, July 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. J.-S. Sereni. Colorations de graphes et applications. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, Juillet 2006. [bibtex-entry]
     
  4. M-E. Voge. Optimisation des réseaux de télécommunications: réseaux multicouches, tolérance aux pannes et surveillance de trafic. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, November 17 2006. [PDF ] [bibtex-entry]
     
Articles in journal or book's chapters
  1. J. Bang-Jensen, B. Reed, M. Schacht, R. Sámal, B. Toft, and U. Wagner. Topics in Discrete Mathematics, Dedicated to Jarik Nesetril on the Occasion of his 60th birthday, volume 26 of Algorithms and Combinatorics, chapter On six problems posed by Jarik Nesetril, pages 613--627. Springer, Berlin, M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr edition, 2006. [bibtex-entry]
     
  2. J-C. Bermond and D. Coudert. Handbook of Combinatorial Designs (2nd edition), volume 42 of Discrete mathematics and Applications, chapter VI.27, Grooming, pages 494-496. Chapman & Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz, November 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. S. Alouf, E. Altman, J. Galtier, J.-F. Lalande, and C. Touati. Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA Satellite Networks. In M. Cheng, Y. Li, and D.-Z. Du, editors,Combinatorial Optimization in Communication Networks, chapter 12, pages 325-366. Kluwer Academic Publishers, 2006. [PDF ] [bibtex-entry]
     
  4. D. Bartha, P. Berthomé, M. Diallo, and A. Ferreira. Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discrete Optimization, 3(3):195--205, September 2006. [bibtex-entry]
     
  5. J. Becker, Z. Csizmadia, J. Galtier, A. Laugier, J. Szabó, and L. Szego. An integer programming approach to routing in Daisy networks. Networks, 47(2):116--121, 2006. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of Gathering in static radio networks. Parallel Processing Letters, 16(2):165--183, 2006. [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, F. Havet, and D. Tóth. Fault tolerant on board networks with priorities. Networks, 47(1):9--25, 2006. [PDF ] [Abstract] [bibtex-entry]
     
  8. S. Bessy, E. Birmelé, and F. Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. Journal of Graph Theory, 53(4):315--332, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  9. A. Bondy, J. Shen, S. Thomassé, and C. Thomassen. Density conditions for triangles in multipartite graphs. Combinatorica, 26(2):121--131, 2006. [bibtex-entry]
     
  10. D. J. Dougherty, P. Lescanne, and L. Liquori. Addressed Term Rewriting Systems: Application to a Typed Object Calculus. Journal of Mathematical Structures in Computer Science, 16(4):667--709, 2006. [PDF ] [bibtex-entry]
     
  11. M. Flammini, A. Navarra, and S. Pérennes. The Real Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting. ACM Journal of Experimental Algorithmics, 11:1--13, 2006.
    Note: (Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005)). [bibtex-entry]
     
  12. F. Havet. Repartitors, selectors and superselectors. Journal of Interconnection Networks, 7(3):391--415, 2006. [PDF ] [bibtex-entry]
     
  13. F. Havet and J.-S. Sereni. Improper choosability of graphs and maximum average degree. Journal of Graph Theory, 52(3):181--199, 2006. [PDF ] [bibtex-entry]
     
  14. C. McDiarmid and B. Reed. Concentration for self-bounding functions and an inequality of talagrand. Random Structures and Algorithms, 29:549--557, 2006. [bibtex-entry]
     
  15. J. Moulierac, A. Guitton, and M. Molnár. Hierarchical Aggregation of Multicast Trees in Large Domains. Journal of Communications (JCM), 6(1):33--44, September 2006. [PDF ] [Abstract] [bibtex-entry]
     
  16. C. Touati, E. Altman, and J. Galtier. Generalized Nash Bargaining Solution for bandwidth allocation. Computer Networks, 50:3242--3263, 2006. [PDF ] [bibtex-entry]
     
Conference's articles
  1. E. Altman, J. Galtier, and C. Touati. Fair power and transmission rate control in wireless networks. In The Third Annual Conference on Wireless On demand Network Systems and Services, pages 134--143, 2006. [PDF ] [bibtex-entry]
     
  2. O. Amini, J-C. Bermond, F. Giroire, F. Huc, and S. Pérennes. Design of Minimal Fault Tolerant Networks: Asymptotic Bounds. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, France, pages 37--40, May 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. M. Ancona, W. Cazzola, S. Drago, and G. Quercini. Visualizing and Managing Network Topologies via Rectangular Dualization. In ISCC '06: Proceedings of the 11th IEEE Symposium on Computers and Communications, Washington, DC, USA, pages 1000-1005, 2006. IEEE Computer Society. [PDF ] [Abstract] [bibtex-entry]
     
  4. R. Bayon, N. Lygeros, and J.-S. Sereni. Orders with ten elements are circle orders. In Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity, Thessaloniki, pages 1p, July 2006. [WWW ] [PDF ] [bibtex-entry]
     
  5. D. Benza, M. Cosnard, L. Liquori, and M. Vesin. Arigatoni: Overlaying Internet via Low Level Network Protocols. In JVA: John Vincent Atanasoff International Symposium on Modern Computing, pages 82--91, 2006. IEEE. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, R. Corrêa, and M-L. Yu. Gathering algorithms on paths under interference constraints. In 6th Conference on Algorithms and Complexity, volume 3998 of Lecture Notes in Computer Science, Roma, Italy, pages 115--126, May 2006. [WWW ] [PDF ] [bibtex-entry]
     
  7. J-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Advanced International Conference on Telecommunications (AICT), pages 6p, 2006. IEEE. [PDF ] [Abstract] [bibtex-entry]
     
  8. J-C. Bermond, D. Coudert, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM ring networks. In IEEE-LEOS ICTON / COST 293 GRAAL, volume 3, pages 19-22, June 2006. [PDF ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Gathering in specific radio networks. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, France, pages 85--88, May 2006. [WWW ] [PDF ] [bibtex-entry]
     
  10. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of Gathering in static radio networks. In FAWN06, Pisa, Italy, pages 75--79, March 2006. [WWW ] [PDF ] [bibtex-entry]
     
  11. L. Blin, P. Fraigniaud, N. Nisse, and S. Vial. Encerclement réparti d'un fugitif dans un réseau par des agents mobiles.. In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), pages 89-92, 2006. [WWW ] [Abstract] [bibtex-entry]
     
  12. L. Blin, P. Fraigniaud, N. Nisse, and S. Vial. Distributed Chasing of Network Intruders. In Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 4056 of Lecture Notes in Computer Science, Chester, UK, pages 70-84, July 2006. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. R. Chand, M. Cosnard, and L. Liquori. Resource Discovery in the Arigatoni Overlay Network. In Proceedings of the International Workshop on Innovative Internet Community Systems (I2CS), pages 13p, 2006. [PDF ] [bibtex-entry]
     
  14. R. Cilibrasi, Z. Lotker, A. Navarra, S. Pérennes, and P. Vitanyi. About the Lifespan of Peer to Peer Networks. In Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS), volume 4305 of Lecture Notes in Computer Science, Bordeaux, pages 290--304, December 2006. Springer-Verlag. [WWW ] [PDF ] [bibtex-entry]
     
  15. H. Cirstea, K. Claude, L. Liquori, and B. Wack. Polymorphic Type Inference for the Rewriting Calculus. In JFLA: Journées Francophones des Langages Applicatifs, pages 57--69, 2006. INRIA. [bibtex-entry]
     
  16. D. Coudert, S. Pérennes, H. Rivano, and M-E. Voge. Shared Risk Resource Groups and Survivability in Multilayer Networks. In IEEE-LEOS ICTON / COST 293 GRAAL, volume 3, pages 235-238, June 2006.
    Note: Invited Paper. [PDF ] [Abstract] [bibtex-entry]
     
  17. O. Dalle. OSA: an Open Component-based Architecture for Discrete-Event Simulation. In 20th European Conference on Modeling and Simulation (ECMS), Bonn, Germany, pages 253--259, May 2006. [PDF ] [bibtex-entry]
     
  18. A. Ferreira, A. Goldman, and J. Monteiro. Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. In Proceedings of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2006), Montreal, CA, pages 173--180, June 2006.
    Note: Best Student Paper Award. [WWW ] [bibtex-entry]
     
  19. F. V. Fomin, P. Fraigniaud, and N. Nisse. Strategies d'encerclement non deterministes. In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), pages 81-84, 2006. [WWW ] [Abstract] [bibtex-entry]
     
  20. P. Fraigniaud and N. Nisse. Connected Treewidth and Connected Graph Searching. In Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN), pages 479-490, 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. P. Fraigniaud and N. Nisse. Monotony Properties of Connected Visible Graph Searching. In Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 5911 of Lecture Notes in Computer Science, Montpellier, France, pages 229-240, June 2006. Springer. [Abstract] [bibtex-entry]
     
  22. J. Galtier. Analysis of the slotted non-persistent CSMA protocol with poissonian packet size using a semi-Markov graph representation. In 8th International Conference on Transparent Optical Networks, volume 3, pages 258--262, June 2006. IEEE. [PDF ] [bibtex-entry]
     
  23. J. Galtier. Adaptive power and transmission rate control in cellular CDMA networks. In IEEE GLOBECOM, pages 6p, 2006. [PDF ] [bibtex-entry]
     
  24. F. Giroire. Directions to use Probabilistic Algorithms for Cardinality for DNA Analysis. In Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2006), pages 3-5, July 2006. [PDF ] [Abstract] [bibtex-entry]
     
  25. L. Hogie, Pascal Bouvry, and Frédéric Guinand. An Overview of MANETs Simulation. In L. Brim and I. Linden, editors, Electronic Notes in Theoretical Computer Science, in the proceedings of MTCoord'05, volume 150 of LNCS, Namur, Belgium, pages 81--101, March 2006. Elsevier. [WWW ] [Abstract] [bibtex-entry]
     
  26. L. Hogie, P. Bouvry, F. Guinand, G. Danoy, and E. Alba. Simulating Realistic Mobility Models for Large Heterogeneous MANETs. In Demo proceeding of the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06), pages 1p, October 2006. IEEE. [WWW ] [Abstract] [bibtex-entry]
     
  27. L. Hogie, P. Bouvry, F. Guinand, G. Danoy, and E. Alba. A Bandwidth-Efficient Broadcasting Protocol for Mobile Multi-hop Ad hoc Networks. In ICN/ICONS/MCL '06: Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, pages 71-71, October 2006. IEEE Computer Society. [WWW ] [Abstract] [bibtex-entry]
     
  28. L. Liquori. iRho: the Software: [System Description]. In Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005), volume 135 of Electronic Notes in Theoretical Computer Science, pages 85--94, 2006. Elsevier. [PDF ] [bibtex-entry]
     
  29. L. Liquori, F. Honsell, and R. Redamalla. A Language for Verification and Manipulation of Web Documents. In Proceedings of the International Workshop on Automated Specification and Verification of Web Sites (WWV 2005), volume 157 of Electronic Notes in Theoretical Computer Science, pages 67--78, 2006. Elsevier. [bibtex-entry]
     
  30. F. Luna, A. J. Nebro, B. Dorronsoro, E. Alba, P. Bouvry, and L. Hogie. Optimal Broadcasting in Metropolitan MANETs Using Multiobjective Scatter Search. In Applications of Evolutionary Computing, volume 3907 of Lecture Notes in Computer Science, pages 255-266, March 2006. Springer. [WWW ] [Abstract] [bibtex-entry]
     
  31. J. Moulierac, A. Guitton, and M. Molnár. Multicast Tree Aggregation in Large Domains. In IFIP Networking, number 3976, pages 691--702, 2006. [PDF ] [Abstract] [bibtex-entry]
     
  32. J. Moulierac, A. Guitton, and M. Molnár. On the number of MPLS LSP using Multicast Tree Aggregation. In IEEE Globecom, pages 5p, November 2006. [PDF ] [Abstract] [bibtex-entry]
     
  33. J. Moulierac and M. Molnàr. Active Monitoring of Link Delays in Case of Asymmetric Routes. In IEEE International Conference on Networking (ICN), pages 6p, April 2006. [PDF ] [Abstract] [bibtex-entry]
     
  34. J. Moulierac. On the number of multicast aggregated trees in a domain. In 2nd Student Workshop of IEEE Infocom, pages 2p, April 2006. [PDF ] [Abstract] [bibtex-entry]
     
  35. N. Nepomuceno, P. Rogério Pinheiro, and A. L. V. Coelho. Metaheurìstica e Programação Linear Inteira: Um Algoritmo Hìbrido para o Problema de Carregamento de Contêineres. In XIII Congreso Latino-Iberoamericano de Investigación Operativa (CLAIO), Montevideo, Uruguay, pages 6p, 2006. [PDF ] [bibtex-entry]
     
  36. N. Nepomuceno, P. Rogério Pinheiro, and A. L. V. Coelho. Aplicação de uma Metodologia Hìbrida ao Problema de Carregamento de Contêineres. In XXXVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO), Goiania, Brazil, pages 1596-1603, 2006. [PDF ] [bibtex-entry]
     
  37. H. Rivano, F. Theoleyre, and F. Valois. Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes. In Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN 2006), volume 3, pages 779--785, 28-28 Sept. 2006. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  38. M.-E. Voge. How to transform a multilayer network into a colored graph. In IEEE-LEOS ICTON/COST 293 GRAAL, volume 3, pages 116--119, June 2006. [bibtex-entry]
     
  39. M.-E. Voge. Graphes Colorés - Arbre Couvrant Coloré. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, pages 41--44, May 2006. [WWW ] [bibtex-entry]
     
Internal reports
  1. O. Amini, F. Giroire, F. Huc, and S. Pérennes. Minimal selectors and fault tolerant networks. Research report, INRIA Research Report HAL-00082015, July 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  2. O. Amini, F. Huc, and S. Pérennes. On the pathwidth of planar graphs. Research report, INRIA Research Report HAL-00082035, July 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  3. J-C. Bermond, D. Coudert, H. Rivano, and M. Syska. Critical resource sharing, State of the art Survey. Technical report Deliverable 2.2.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. Research Report 5936, INRIA, 06 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the first year. Technical report Deliverable 2.O.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]
     
  6. D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M-E. Voge. Complexity and approximability issues of Shared Risk Resource Group. Technical report, INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR, 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  7. D. Coudert, F. Huc, and J.S. Sereni. Pathwidth of outerplanar graphs. Technical report, INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR, January 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  8. O. Dalle. OSA: an Open Component-based Architecture for Discrete-Event Simulation. Technical report RR-5762, version 2, INRIA, February 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Design of fault tolerant on-board networks. Research report, INRIA Research Report 5866, March 2006. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  10. F. Havet, R. J. Kang, T. Müller, and J.-S. Sereni. Circular Choosability. Research report, INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR, July 2006.
    Note: Submitted to Journal of Graph Theory. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  11. F. Havet, J.-S. Sereni, and R. Skrekovski. 3-facial colouring of plane graphs. Research report, INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR, July 2006.
    Note: Submitted to SIAM Journal on Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  12. F. Havet, S. Thomassé, and A. Yeo. Hoàng-Reed conjecture holds for tournaments. Research report, INRIA Research Report 5976, September 2006.
    Note: Submitted Discrete Mathematics. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Research report, INRIA Research Report 5800 and I3S Research Report I3S/RR-2006-01-FR, January 2006.
    Note: Submitted to Discrete Mathematics. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  14. M. Lenisa, F. Honsell, and L. Liquori. A Framework for Defining Logical Frameworks. Research Report, RR INRIA and University of Udine, 2006. [WWW ] [bibtex-entry]
     
  15. G. Méheut, S. Pérennes, and H. Rivano. Evaluation stochastique et simulation des réseaux radio. Research report 5989, INRIA, September 2006. [WWW ] [Abstract] [bibtex-entry]
     
  16. H. Rivano, F. Théoleyre, and F. Valois. About the Capacity of Flat and Self-Organized Ad Hoc and Hybrid Networks. Research Report, INRIA Research Report 5977, 2006. [WWW ] [Abstract] [bibtex-entry]
     
Miscellaneous
  1. F. Ben Hfaiedh. Reconfiguration dans les réseaux WDM. Master's thesis, Master STIC 2 RSD, 2006. [bibtex-entry]
     
  2. C. Molle. Evaluation de la capacité et routage pour les réseaux radio. Master's thesis, Université Pierre et Marie Curie, Paris VI, 2006. [bibtex-entry]
     
  3. G. Méheut. Evaluation stochastique et simulation des réseaux radio. Master's thesis, Ecole Polytechnique, Palaiseaux, 2006. [bibtex-entry]
     
  4. I. Sau. Minimizing the number of ADMs in WDM Optical Rings with Traffic Grooming. Master's thesis, Université Polytechnique de Barcelone, Espagne, 2006. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



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