Publications of year 2009

1. O. Dalle, J. R. Heath, and G. A. Wayne, editors. Mobile Networks and Applications (MONET) : Special Issue on Development Tools and Techniques for Mobile Telecommunications. Springer Netherlands, December 2009.
   Note: Online publication. [WWW ] [bibtex-entry]


2. O. Dalle, L.-F. Perrone, G. Stea, and G. A. Wainer, editors. 2nd International Conference on Simulation Tools and Techniques (SIMUTools 2009), Rome, Italy, March 2009. [bibtex-entry]

1. C. Gomes. Radio Mesh Networks and the Round Weighting Problem. PhD thesis, Université de Nice-Sophia Antipolis (UNS), December 1st 2009. [WWW ] [PDF ]
   Keywords: Radio Mesh Networks, Multi-objective Optimization, Bandwidth allocation problem, Flow problem, Coloring Problem, Fairness, Column Generation method, Convex Problems. [Abstract] [bibtex-entry]


2. C. Molle. Optimisation de la capacité des réseaux radio maillés. PhD thesis, Ecole doctorale STIC, Université de Nice-Sophia Antipolis, October 2009. [WWW ] [PDF ]
   Keywords: Optimisation, programmation linéaire, réseaux radio maillés, capacité, génération de colonnes. [Abstract] [bibtex-entry]


3. G. Monaco. Optimization and Non-Cooperative Issues in Communication Networks. PhD thesis, University of l'Aquila, October 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. J.-P. Perez Seva. Les optimisations d'algorithmes de traitement du signal sur les architectures modernes parallèles et embarquées. PhD thesis, Ecole doctorale STIC, Université de Nice-Sophia Antipolis, August 2009. [bibtex-entry]


5. P. Reyes. Data Gathering in Radio Networks. PhD thesis, Ecole doctorale STIC, Université de Nice-Sophia Antipolis, August 2009. [WWW ]
   Keywords: combinatorial optimization, algorithms, graph coloring, data gathering, wireless networks, sensor networks. [Abstract] [bibtex-entry]


6. I. Sau. Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks. PhD thesis, Université de Nice-Sophia Antipolis (UNS) and Universitat Politècnica de Catalunya (UPC), October 2009. [PDF ]
   Keywords: Graph theory, traffic grooming, optical networks, graph partitioning, computational complexity, approximation algorithms, parameterized complexity, branchwidth, dynamic programming, graphs on surfaces. [Abstract] [bibtex-entry]

1. V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Game-Theoretic Approaches to Optimization Problems in Communication Networks, pages 241-264. Springer, A. Koster and X. Muñoz edition, November 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. I. Sau and J. Zerovnik. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Permutation Routing and $(\ell,k)$-Routing on Plane Grids, pages 265-279. Springer, A. Koster and X. Muñoz edition, November 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. L. Addario-Berry, N. Broutin, and B. Reed. Critical random graphs and the structure of a minimum spanning tree. Random Structures and Algorithms, 35:323--347, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. L. Addario-Berry and B. Reed. Minima in branching random walks. Annals of Probability, 37:1044--1079, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. O. Amini, F. Huc, and S. Pérennes. On the pathwidth of planar graphs. SIAM Journal of Discrete Mathematics, 23(3):1311-1316, August 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. Submodular partition functions. Discrete Mathematics, 309(20):6000-6008, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. O. Amini, S. Pérennes, and I. Sau. Hardness and Approximation of Traffic Grooming. Theoretical Computer Science, 410(38-40):3751-3760, 2009. [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, R. Correa, and M.-L. Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics, 309(18):5574-5587, September 2009.
   Note: A preliminary version has been presented at CIAC06. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. E. Birmelé, J. A. Bondy, and B. Reed. Tree-width of graphs without a 3 by 3 grid minor. Discrete Applied Mathematics, 157:2577--2598, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. R. Correa, F. Havet, and J-S. Sereni. About a Brooks-type theorem for improper colouring. Australasian Journal of Combinatorics, 43:219--230, 2009. [PDF ] [Abstract] [bibtex-entry]


11. F. V. Fomin, P. Fraigniaud, and N. Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica, 53(3):358-373, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. J. Galtier. Real-time resource allocation for LEO satellite constellations. Wireless Networks, 15(6):791-803, August 2009. [WWW ] [Abstract] [bibtex-entry]


13. J. Geelen, B. Gerards, B. Reed, P. Seymour, and A. Vetta. On the odd-minor variant of Hadwiger's conjecture. Journal of Combinatorial Theory Ser. B, 99:20--29, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. F. Giroire. Order statistics and estimating cardinalities of massive data sets. Discrete Applied Mathematics, 157(2):406-427, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


15. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics, 309:3553--3563, 2009. [PDF ] [Abstract] [bibtex-entry]


16. F. Havet, R. Kang, T. Müller, and J.-S. Sereni. Circular choosability. Journal of Graph Theory, 61(4):241--334, 2009. [PDF ] [Abstract] [bibtex-entry]


17. F. Havet, R. Kang, and J.-S. Sereni. Improper Colouring of Unit Disk Graphs. Networks, 54(3):150--164, 2009. [Abstract] [bibtex-entry]


18. F. Havet and S. Thomassé. Complexity of $(p,1)$-total labelling. Dicrete Applied Mathematics, 157:2859--2870, 2009. [PDF ] [Abstract] [bibtex-entry]


19. F. Huc, I. Sau, and J. Zerovnik. $(\ell,k)$-Routing on Plane Grids. Journal of Interconnection Networks, 10(1-2):27-57, 2009. [PDF ] [Abstract] [bibtex-entry]


20. D. Ilcinkas, N. Nisse, and D. Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, 22(2):117-127, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


21. A. Jarry and S. Pérennes. Disjoint Path in symmetric Graphs. Discrete Applied Mathematics, 157(1):90-97, 2009. [bibtex-entry]


22. K. Kawarabayashi, O. Lee, and B. Reed. Removable cycles in non-bipartite graphs. Journal of Combinatorial Theory Ser. B, 99:30--38, 2009. [WWW ] [Abstract] [bibtex-entry]


23. K. Kawarabayashi and B. Reed. Highly parity linked graphs. Combinatorica, 29:215--225, 2009. [WWW ] [Abstract] [bibtex-entry]


24. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From Balls and Bins to Points and Vertices. Algorithmic Operations Research (AlgOR), 4(2):133-143, 2009. [Abstract] [bibtex-entry]


25. B. Lévêque, F. Maffray, B. Reed, and N. Trotignon. Coloring Artemis graphs. Theoretical Computer Science, 410:2234--2240, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


26. G. B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM Journal on Discrete Mathematics, 23:1800-1813, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


27. N. Nisse. Connected graph searching in chordal graphs. Discrete Applied Mathematics, 157(12):2603-2610, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


28. N. Nisse and D. Soguet. Graph Searching with Advice. Theoretical Computer Science, 410(14):1307-1318, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]

1. E. Altman, P. Nain, and J-C. Bermond. Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. In INFOCOM 2009, Rio De Janeiro, Brazil, pages 1431 - 1439, April 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), volume 35 of Electronic Notes in Discrete Mathematics, Gramado, Brazil, pages 275--280, December 2009. Springer. [PDF ] [Abstract] [bibtex-entry]


3. J. Araujo and C. Linhares Sales. Grundy number on $P_4$-classes. In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), volume 35 of Electronic Notes in Discrete Mathematics, Gramado, Brazil, pages 21--27, December 2009. Springer. [PDF ] [Abstract] [bibtex-entry]


4. J. Araujo, P. Moura, and M. Campêlo. Sobre a complexidade de Coloração Mista. In Encontro Regional de Pesquisa Operacional do Nordeste, Fortaleza, Brazil, pages 1--10, December 2009. [PDF ] [Abstract] [bibtex-entry]


5. D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, and F. Giroire. Impact of IT Monoculture on Behavioral End Host Intrusion Detection. In ACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN, Barcelona, Spain, pages 27--36, August 2009. ACM. [PDF ] [Abstract] [bibtex-entry]


6. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. In L. Fratta et al., editor, IFIP Networking, volume 5550 of Lecture Notes in Computer Science, Aachen, Germany, pages 809-820, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. Designing Hypergraph Layouts to GMPLS Routing Strategies. In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 57--71, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, D. Mazauric, and P. Nain. Algorithmes distribués d'ordonnancement dans les réseaux sans-fil. In 10èmes Journées Doctorales en Informatique et Réseaux (JDIR), Belfort, France, February 2009. [PDF ] [Abstract] [bibtex-entry]


9. J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Fast Data Gathering in Radio Grid Networks. In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09), pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. J. C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Minimum delay Data Gathering in Radio Networks. In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now), volume 5793 of Lecture Notes in Computer Science, pages 69-82, 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. V. Bilò, M. Flammini, G. Monaco, and L. Moscardelli. On the performances of Nash Equilibria in Isolation Games. In Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009), volume 5609 of Lecture Notes in Computer Science, Niagara Falls, New York, U.S.A., pages 17-26, July 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. A. Casteigts, S. Chaumette, and A. Ferreira. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. In Proc. of 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO'09), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 126-140, May 2009. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


13. N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, and A. Yeo. Algorithm for Finding -Vertex Out-trees and Its Application to -Internal Out-branching Problem. In 15th Annual International Conference on Computing and Combinatorics (COCOON), volume 5609 of Lecture Notes in Computer Science, pages 37-46, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. N. Cohen, F. Havet, and T. Müller. Acyclic edge-colouring of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 417-421, September 2009. [PDF ] [Abstract] [bibtex-entry]


15. D. Coudert, F. Giroire, and I. Sau. Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids. In J. Kratochvìl and M. Miller, editors, 20th International Workshop on Combinatorial Algorithms -- IWOCA, volume 5874 of Lecture Notes in Computer Science, Hradec nad Moravicì, Czech Republic, pages 134-145, June 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


16. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Reconfiguration dans les réseaux optiques. In A. Chaintreau and C. Magnien, editors, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


17. D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J-S. Sereni. Reconfiguration of the Routing in WDM Networks with Two Classes of Services. In 13th Conference on Optical Network Design and Modeling (ONDM), Braunschweig, Germany, pages 6p, February 2009. IEEE. [WWW ] [Abstract] [bibtex-entry]


18. D. Coudert, D. Mazauric, and N. Nisse. On Rerouting Connection Requests in Networks with Shared Bandwidth. In DIMAP workshop on Algorithmic Graph Theory (AGT09), volume 32 of Electronic Notes in Discrete Mathematics, Warwick, UK, pages 109-116, March 2009. Elsevier. [WWW ] [PDF ] [Abstract] [bibtex-entry]


19. D. Coudert, N. Nepomuceno, and H. Rivano. Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks. In A. Chaintreau and C. Magnien, editors, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


20. D. Coudert, N. Nepomuceno, and H. Rivano. Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. In First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), Kos, Greece, pages 6p, June 2009. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]


21. O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes. Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair. In Augustin Chaintreau and Clemence Magnien, editors, 11ème rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel'2009), Carry-Le-Rouet France, pages 4p, 2009.
    Note: Best Student Paper Award. [WWW ] [PDF ] [Abstract] [bibtex-entry]


22. O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes. Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. In Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P), pages 184--193, September 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


23. A. Ferreira. Road-mapping the Digital Revolution: Visions from COST Foresight 2030 (An exercise in multi-disciplinarity). In Proceedings of IEEE Wireless VITAE'09, Aalborg, Denmark, pages 5p, May 2009. IEEE Press. [PDF ] [Abstract] [bibtex-entry]


24. M. Flammini, A. Marchetti-Spaccamela, G. Monaco, L. Moscardelli, and S. Zaks. On the complexity of the regenerator placement problem in optical networks. In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009), Calgary, Canada, pages 154-162, August 2009. ACM. [WWW ] [PDF ] [Abstract] [bibtex-entry]


25. M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, and S. Zaks. Minimizing total busy time in parallel scheduling with application to optical networks. In Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009), Rome, Italy, pages 1-12, May 2009. IEEE. [WWW ] [PDF ] [Abstract] [bibtex-entry]


26. N. Fountoulakis and B. Reed. A general critical condition for the emergence of a giant component in random graphs with given degrees. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 639--645, September 2009. [bibtex-entry]


27. P. Giabbanelli. Why having in-person lectures when e-learning and podcasts are available?. In Proceedings of the 14th Western Canadian Conference on Computing Education (ACM SIGCSE), pages 42-44, 2009. [bibtex-entry]


28. F. Giroire, J. Chandrashekar, N. Taft, E. Schooler, and K. Papagiannaki. Exploiting Temporal Persistence to Detect Covert Botnet Channels. In Springer, editor, 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), volume 5758 of Lecture Notes in Computer Science, Saint Malo, France, pages 326--345, September 2009. [PDF ] [Abstract] [bibtex-entry]


29. F. Giroire, J. Monteiro, and S. Pérennes. P2P Storage Systems: How Much Locality Can They Tolerate?. In Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN), pages 320--323, October 2009. [PDF ]
    Keywords: P2P storage system, data placement, performance evaluation, data durability. [Abstract] [bibtex-entry]


30. C. Gomes and J. Galtier. Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks. In 8th International Conference on AD-HOC Networks & Wireless (ADHOC NOW), volume 5793 of Lecture Notes in Computer Science, Murcia, Spain, pages 327-340, September 2009. Springer. [PDF ] [Abstract] [bibtex-entry]


31. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. Spanning galaxies in digraphs. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 139--143, September 2009. [PDF ] [Abstract] [bibtex-entry]


32. F. Guinand and B. Onfroy. MANET : étude de l'impact de la mobilité sur la connexité du réseau. In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09), pages 2p, June 2009.
    Note: Poster. [PDF ]
    Keywords: réseau mobile ad-hoc, graphe dynamique, MANET, connexité, algorithme. [Abstract] [bibtex-entry]


33. F. Havet and C. Linhares Sales. Combinatória e Problemas em Redes de Telecomunicações. In Colloque d'Informatique: Brésil / INRIA, Coopérations, Avancées et Défis, Bento Gonçalves, Brazil, pages 4p, July 2009. [PDF ] [Abstract] [bibtex-entry]


34. J. Himmelspach, O. Dalle, and J. Ribault. Design considerations for M&S software. In D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, and R. G. Ingalls, editors, Proceedings of the Winter Simulation Conference (WSC'09), Austin, TX, pages 12p, December 2009.
    Note: Invited Paper. [WWW ] [PDF ] [Abstract] [bibtex-entry]


35. K. Kawarabayashi and B. Reed. A nearly linear time algorithm for the half integral parity disjoint paths packing problem. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2009), pages 1183--1192, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


36. K. Kawarabayashi and B. Reed. Hadwiger's Conjecture is decidable. In 41th ACM Symposium on Theory of Computing (STOC 2009), pages 445--454, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


37. S. Kennedy, C. Meagher, and B. Reed. Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), volume 34 of Electronic Notes on Discrete Mathematics, Bordeaux, France, pages 47--51, September 2009. [Abstract] [bibtex-entry]


38. Z. Li and I. Sau. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. In 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), volume 5911 of Lecture Notes in Computer Science, pages 250-261,, June 2009.
    Note: Best student paper award. [PDF ] [Abstract] [bibtex-entry]


39. C. Linhares Sales and L. Sampaio. b-coloring of m-tight graphs. In T. Liebling and J. Szwarcfiter, editors, LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, volume 35 of Electronic Notes in Discrete Mathematics, Gramado, Brazil, pages 209 - 214, March 2009. Elsevier. [WWW ] [PDF ] [bibtex-entry]


40. J-C. Maureira Bravo, D. Dujovne, and O. Dalle. Generation of Realistic 802.11 Interferences in the OMNeT++ INET Framework Based on Real Traffic Measurements. In Second International Workshop on OMNeT++, Rome, Italy, pages 8p, March 2009. [PDF ] [Abstract] [bibtex-entry]


41. J-C. Maureira Bravo, P. Uribe, O. Dalle, T. Asahi, and J. Amaya. Component based approach using OMNeT++ for Train Communication Modeling. In Proceedings of 9th International Conference on ITS Telecommunication, Lille, France, pages 6p, October 2009. [PDF ] [Abstract] [bibtex-entry]


42. G. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. In 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), volume 5911 of Lecture Notes in Computer Science, pages 285-295, 06 2009. [PDF ] [Abstract] [bibtex-entry]


43. C. Molle and M-E. Voge. Effects of the Acknowledgment Traffic on the Capacity of Wireless Mesh Networks. In 69th IEEE Vehicular Technology Conference (VTC2009-Spring), Barcelona, Spain, pages 5p, April 2009. [PDF ] [Abstract] [bibtex-entry]


44. M. Molloy and B. A. Reed. Asymptotically optimal frugal colouring. In Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 106-114, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


45. N. Nisse, I. Rapaport, and K. Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 252-265, 2009. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


46. J. Ribault and O. Dalle. OSA : A Federative Simulation Platform. In Proceedings of the Winter Simulation Conference (WSC'09), Austin, TX, USA, 2009.
    Note: Ph.D. Colloquium. [WWW ] [Abstract] [bibtex-entry]


47. I. Sau and D. M. Thilikos. On Self-Duality of Branchwidth in Graphs of Bounded Genus. In 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), Paris, France, pages 19-22, June 2009. [PDF ] [Abstract] [bibtex-entry]


48. I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. In DIMAP workshop on Algorithmic Graph Theory (AGT09), volume 32 of Electronic Notes in Discrete Mathematics, Warwick, UK, pages 59-66, March 2009. Elsevier. [PDF ] [Abstract] [bibtex-entry]


49. A. Silva, P. Reyes, and M. Debbah. Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks. In International Conference on Ultra Modern Telecommunications, St. Petersburg, Russia, pages 10p, October 2009. [WWW ] [PDF ]
    Keywords: Random Matrix Theory, Random Graph Theory, Wireless Ad-Hoc Networks, Wireless Sensor Networks. [Abstract] [bibtex-entry]


50. F. Solano Donado and J. Moulierac. Routing in All-Optical Label Switched-based Networks with Small Label Spaces. In 13th Conference on Optical Network Design and Modeling (ONDM), Braunschweig, Germany, pages 6p, February 2009. IFIP/IEEE. [WWW ] [Abstract] [bibtex-entry]

1. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. Research Report 6934, INRIA, 2009. [WWW ] [PDF ]
   Keywords: graph theory, complexity, edge-labelling, planar graphs, matching-cut, channel assignment. [Abstract] [bibtex-entry]


2. J-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop cost and wavelength optimal two-period grooming with ratio 4. Technical report RR-7101, INRIA, November 2009. [PDF ] [Abstract] [bibtex-entry]


3. J-C. Bermond, M. Cosnard, and S. Pérennes. Directed acyclic graphs with unique path property. Technical report 6932, INRIA, May 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. Technical report RR-6803, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Research Report RR-7071, INRIA, October 2009. [WWW ] [PDF ]
   Keywords: GMPLS, optical networks, label stacking, hypergraph layout, approximation algorithms, dynamic programming.. [Abstract] [bibtex-entry]


6. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. Technical report RR-6842, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. J-C. Bermond, D. Coudert, and J. Peters. Online Distributed Traffic Grooming on Path Networks. Technical report RR-6833, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Technical report RR-7080, INRIA, October 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Fast Data Gathering in Radio Grid Networks. Research Report RR-6851, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks.. Technical report RR-7047, INRIA, September 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Research Report RR-7098, November 2009. [WWW ]
    Keywords: edge-colouring, list colouring, List Colouring Conjecture, planar graphs. [Abstract] [bibtex-entry]


12. N. Cohen, F. Havet, and T. Müller. Acyclic edge-colouring of planar graphs. Research Report 6876, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. D. Coudert, F. Giroire, and I. Sau. Circuit visiting 10 ordered vertices in infinite grids. Technical report RR-6910, INRIA, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. D. Coudert, D. Mazauric, and N. Nisse. Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.. Technical report RR-6790, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


15. N. Eggemann, F. Havet, and S. Noble. $k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Research Report 6840, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


16. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. Research Report 7110, INRIA, November 2009. [Abstract] [bibtex-entry]


17. F. Giroire, J. Monteiro, and S. Pérennes. P2P Storage Systems: How Much Locality Can They Tolerate?. Research Report RR-7006, INRIA, July 2009. [WWW ] [PDF ]
    Keywords: P2P storage system, data placement, performance evaluation, data durability. [Abstract] [bibtex-entry]


18. F. Havet, S. Jendrol', R. Soták, and E. Skrabul'aková. Facial non-repetitive edge-colouring of plane graphs. Research Report 6873, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


19. L. Hogie, D. Papadimitriou, I. Tahiri, and F. Majorczyk. Simulating routing schemes on large-scale topologies. Technical report RT-0371, INRIA, November 2009. [Abstract] [bibtex-entry]


20. F. Huc, C. Molle, N. Nisse, S. Perennes, and H. Rivano. Stability of a local greedy distributed routing algorithm. Technical report RR-6871, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


21. J-C. Maureira Bravo, D. Dujovne, and O. Dalle. Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover. Research Report RR-6850, INRIA, 2009. [WWW ] [Abstract] [bibtex-entry]


22. J. Rué, I. Sau, and D. M. Thilikos. Dynamic Programming for Graphs on Surfaces. Technical report RR-7166, INRIA, December 2009. [PDF ] [Abstract] [bibtex-entry]


23. A. Silva, P. Reyes, and M. Debbah. Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks. Research Report RR-6854, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]

1. F. Guinand and B. Onfroy. MANET : modèle de mobilité planifié. Ubimob'09, July 2009.
   Note: Demonstration. [PDF ]
   Keywords: réseau mobile ad-hoc, MANET, graphe dynamique, modèle de mobilité, mobilité planifiée, environnement urbain. [Abstract] [bibtex-entry]


2. J. Ribault, F. Peix, J. Monteiro, and O. Dalle. OSA: an Integration Platform for Component-Based Simulation. Second Intl. Conf. on Simulation Tools and Techniques (SIMUTools09), March 2009.
   Note: Poster abstract. [PDF ] [Abstract] [bibtex-entry]

This document was translated from BibT_EX by bibtex2html