Inria / Raweb 2009
Presentation of the Project Mascotte

Bibliography

Major publications by the team in recent years

[1]: L. Addario-Berry, F. Havet, S. Thomassé.
Paths with two blocks in n -chromatic digraphs, in: Journal of Combinatorial Theory Ser. B, 2007, vol. 97, p. 620–626
http://dx.doi.org/10.1016/j.jctb.2006.10.001.
[2]: E. Altman, P. Nain, J.-C. Bermond.
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks, in: INFOCOM 2009, Rio de Janeiro, Brazil, IEEE, April 2009, p. 1431 - 1439
http://dx.doi.org/10.1109/INFCOM.2009.5062059.
[3]: J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes.
Hardness and approximation of Gathering in static radio networks, in: Parallel Processing Letters, 2006, vol. 16, n^o 2, p. 165–183
http://dx.doi.org/10.1142/S0129626406002551.
[4]: I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano.
Fractional Path Coloring in Bounded Degree Trees with Applications, in: Algorithmica, 2009
http://dx.doi.org/10.1007/s00453-009-9278-3, Published online: 14 February 2009.
[5]: D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge.
Shared Risk Resource Group: Complexity and Approximability issues, in: Parallel Processing Letters, June 2007, vol. 17, n^o 2, p. 169-184
http://dx.doi.org/10.1142/S0129626407002958.
[6]: D. Coudert, F. Huc, D. Mazauric, N. Nisse, 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, IEEE, February 2009
http://hal.inria.fr/inria-00331807.
[7]: O. Dalle, C. Mrabet.
An Instrumentation Framework for component-based simulations based on the Separation of Concerns paradigm, in: Proc. of 6th EUROSIM Congress (EUROSIM'2007), Ljubljana, Slovenia, September 2007
http://www.eurosim2007.org/.
[8]: F. V. Fomin, P. Fraigniaud, N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth, in: Algorithmica, 2009, vol. 53, n^o 3, p. 358-373
http://www.springerlink.com/content/42g5tp1588w89186/.
[9]: F. Giroire.
Order statistics and estimating cardinalities of massive data sets, in: Discrete Applied Mathematics, 2009, vol. 157, n^o 2, p. 406-427
http://dx.doi.org/10.1016/j.dam.2008.06.020.
[10]: F. Havet, J.-S. Sereni, R. Skrekovski.
3-facial colouring of plane graphs, in: SIAM Journal on Discrete Mathematics, 2008, vol. 22, n^o 1, p. 231–247
http://dx.doi.org/10.1137/060664124.
[11]: J.-F. Lalande, M. Syska, Y. Verhoeven.
Mascopt - A Network Optimization Library: Graph Manipulation, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004, n^o RT-0293
http://hal.inria.fr/inria-00069887/fr/, Technical report.
[12]: Z. Li, 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), Lecture Notes in Computer Science, June 2009
http://www.lirmm.fr/wg2009/, Best student paper award.
[13]: C. Molle, F. Peix, H. Rivano.
Génération de colonnes pour le routage et l'ordonnancement dans les réseaux radio maillés, in: Colloque francophone sur l'ingénierie des protocoles (CFIP 2008), March 2008
http://cfip2008.imag.fr/wp/, Best student paper award.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[14]: C. Gomes.
Radio Mesh Networks and the Round Weighting Problem, Université de Nice-Sophia Antipolis (UNS), December 1st 2009
http://tel.archives-ouvertes.fr/, Ph. D. Thesis.
[15]: C. Molle.
Optimisation de la capacité des réseaux radio maillés, Université de Nice-Sophia Antipolis (UNS), October 29th 2009
http://tel.archives-ouvertes.fr/tel-00428940/fr/, Ph. D. Thesis.
[16]: J.-P. Perez Seva.
Les optimisations d'algorithmes de traitement du signal sur les architectures modernes parallèles et embarquées, Université de Nice-Sophia Antipolis (UNS), August 24th 2009, Ph. D. Thesis.
[17]: P. Reyes.
Data Gathering in Radio Networks, Université de Nice-Sophia Antipolis (UNS), August 5th 2009
http://tel.archives-ouvertes.fr/tel-00418297/en/, Ph. D. Thesis.
[18]: I. Sau.
Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks, Université de Nice-Sophia Antipolis (UNS) and Universitat Politècnica de Catalunya (UPC), October 16th 2009
http://www.cs.technion.ac.il/~ignasi/PhD_Ignasi.pdf, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[19]: L. Addario-Berry, N. Broutin, B. A. Reed.
Critical random graphs and the structure of a minimum spanning tree, in: Random Structures and Algorithms, 2009, vol. 35, p. 323–347
http://portal.acm.org/citation.cfm?id=1598965.
[20]: L. Addario-Berry, B. A. Reed.
Minima in branching random walks, in: Annals of Probability, 2009, vol. 37, p. 1044–1079
http://arxiv.org/abs/0712.2582.
[21]: O. Amini, F. Giroire, F. Huc, S. Pérennes.
Minimal selectors and fault tolerant networks, in: Networks, 2009
http://doi.wiley.com/10.1002/net.20326, To appear. Published online 31 July 2009, DOI 10.1002/net.20326.
[22]: O. Amini, F. Huc, S. Pérennes.
On the pathwidth of planar graphs, in: SIAM Journal of Discrete Mathematics, August 2009, vol. 23, n^o 3, p. 1311-1316
http://dx.doi.org/10.1137/060670146.
[23]: O. Amini, F. Mazoit, N. Nisse, S. Thomassé.
Submodular partition functions, in: Discrete Mathematics, 2009, vol. 309, n^o 20, p. 6000-6008
http://www-sop.inria.fr/members/Nicolas.Nisse/publications/.
[24]: O. Amini, S. Pérennes, I. Sau.
Hardness and Approximation of Traffic Grooming, in: Theoretical Computer Science, 2009, vol. 410, n^o 38-40, p. 3751-3760
http://dx.doi.org/10.1016/j.tcs.2009.04.028.
[25]: J.-C. Bermond, R. Correa, M.-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints, in: Discrete Mathematics, September 2009, vol. 309, n^o 18, p. 5574-5587
http://dx.doi.org/10.1016/j.disc.2008.04.037, A preliminary version has been presented at CIAC06.
[26]: E. Birmelé, J. A. Bondy, B. A. Reed.
Tree-width of graphs without a 3 by 3 grid minor, in: Discrete Applied Mathematics, 2009, vol. 157, p. 2577–2598
http://portal.acm.org/citation.cfm?id=1553060.
[27]: I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano.
Fractional Path Coloring in Bounded Degree Trees with Applications, in: Algorithmica, 2009
http://dx.doi.org/10.1007/s00453-009-9278-3, Published online: 14 February 2009.
[28]: R. Correa, F. Havet, J.-S. Sereni.
About a Brooks-type theorem for improper colouring, in: Australasian Journal of Combinatorics, 2009, vol. 43, p. 219–230
hal.inria.fr/inria-00223009/en/.
[29]: A. Ferreira, A. Goldman, J. Monteiro.
Performance Evaluation of Routing Protocols for MANETs with Known Connectivity Patterns Using Evolving Graphs, in: Wireless Networks, 2009
http://www.springerlink.com/content/c82014477847t646, In press.
[30]: F. V. Fomin, P. Fraigniaud, N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth, in: Algorithmica, 2009, vol. 53, n^o 3, p. 358-373
http://www.springerlink.com/content/42g5tp1588w89186.
[31]: J. Geelen, B. Gerards, B. A. Reed, P. Seymour, A. Vetta.
On the odd-minor variant of Hadwiger's conjecture, in: J. Combin. Theory Ser. B, 2009, vol. 99, p. 20–29
http://portal.acm.org/citation.cfm?id=1465824.
[32]: F. Giroire.
Order statistics and estimating cardinalities of massive data sets, in: Discrete Applied Mathematics, 2009, vol. 157, n^o 2, p. 406-427
http://dx.doi.org/10.1016/j.dam.2008.06.020.
[33]: F. Havet.
Choosability of the square of planar subcubic graphs with large girth, in: Discrete Mathematics, 2009, vol. 309, p. 3553–3563
http://cat.inist.fr/?aModele=afficheN&cpsidt=21712750.
[34]: F. Havet, R. Kang, T. Müller, J.-S. Sereni.
Circular choosability, in: Journal of Graph Theory, 2009, vol. 61, n^o 4, p. 241–334.
[35]: F. Havet, R. Kang, J.-S. Sereni.
Improper Colouring of Unit Disk Graphs, in: Networks, 2009, vol. 54, n^o 3, p. 150–164
http://hal.inria.fr/inria-00150464.
[36]: F. Havet, S. Thomassé.
Complexity of (p, 1) -total labelling, in: Discrete Applied Mathematics, 2009, vol. 157, p. 2859–2870
http://dx.doi.org/10.1016/j.dam.2009.03.021.
[37]: F. Huc, I. Sau, J. Zerovnik.
( $\ell$ , k) -Routing on Plane Grids, in: Journal of Interconnection Networks, 2009, vol. 10, n^o 1-2, p. 27-57
http://arxiv.org/abs/0803.2759.
[38]: D. Ilcinkas, N. Nisse, D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching, in: Distributed Computing, 2009, vol. 22, n^o 2, p. 117-127
http://www.springerlink.com/content/l8371258177lv2j0/.
[39]: A. Jarry, S. Pérennes.
Disjoint Path in symmetric Graphs, in: Discrete Applied Mathematics, 2009, vol. 157, n^o 1, p. 90-97
http://dx.doi.org/10.1016/j.dam.2008.04.024.
[40]: K. Kawarabayashi, O. Lee, B. A. Reed.
Removable cycles in non-bipartite graphs, in: J. Combin. Theory Ser. B, 2009, vol. 99, p. 30–38
http://portal.acm.org/citation.cfm?id=1465820.
[41]: K. Kawarabayashi, B. A. Reed.
Highly parity linked graphs, in: Combinatorica, 2009, vol. 29, p. 215–225
http://portal.acm.org/citation.cfm?id=1569773.
[42]: R. Klasing, Z. Lotker, A. Navarra, S. Pérennes.
From Balls and Bins to Points and Vertices, in: Algorithmic Operations Research (AlgOR), 2009, vol. 4, n^o 2, p. 133-143
http://journals.hil.unb.ca/index.php/AOR/article/view/4668.
[43]: B. Lévêque, F. Maffray, B. A. Reed, N. Trotignon.
Coloring Artemis graphs, in: Theoretical Computer Science, 2009, vol. 410, p. 2234–2240
http://portal.acm.org/citation.cfm?id=1530984.
[44]: N. Nisse.
Connected graph searching in chordal graphs, in: Discrete Applied Mathematics, 2009, vol. 157, n^o 12, p. 2603-2610
http://portal.acm.org/citation.cfm?id=1553062.
[45]: N. Nisse, D. Soguet.
Graph Searching with Advice, in: Theoretical Computer Science, 2009, vol. 410, n^o 14, p. 1307-1318
http://www.springerlink.com/content/10t1l145m1182477/.
[46]: H. Rivano, F. Theoleyre, F. Valois.
A Framework for the Capacity Evaluation of Multihop Wireless Networks, in: Ad Hoc and Sensor Wireless networks (AHSWN), 2009
ftp://ftp-sop.inria.fr/mascotte/personnel/Herve.Rivano/Biblio/rtv09.pdf, Accepted for publication: March 19th 2009. To appear.

International Peer-Reviewed Conference/Proceedings

[47]: E. Altman, P. Nain, J.-C. Bermond.
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks, in: INFOCOM 2009, Rio de Janeiro, Brazil, IEEE, April 2009, p. 1431 - 1439
http://dx.doi.org/10.1109/INFCOM.2009.5062059.
[48]: J. Araujo, N. Cohen, F. Giroire, F. Havet.
Good Edge-Labelling of Graphs, in: proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), Gramado, Brazil, Electronic Notes in Discrete Mathematics, Elsevier, November 2009
http://hal.inria.fr/inria-00383343/en/, to appear.
[49]: D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, F. Giroire.
Debating IT Monoculture for End Host Intrusion Detection, in: ACM SIGCOMM Workshop on Research on Enterprise Networking – WREN, Barcelona, Spain, ACM, August 2009, p. 27–36
http://doi.acm.org/10.1145/1592681.1592686.
[50]: J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, F. Solano Donado.
MPLS label stacking on the line network, in: IFIP Networking, Aachen, Germany, L. Fratta, H. Schulzrinne, Y. Takahashi, O. Spaniol (editors), Lecture Notes in Computer Science, Springer, May 2009, vol. 5550, p. 809-820
http://hal.inria.fr/inria-00354267/.
[51]: J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.
Designing Hypergraph Layouts to GMPLS Routing Strategies, in: 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Piran, Slovenia, Lecture Notes in Computer Science, Springer, May 2009, vol. 5869
http://hal.inria.fr/inria-00428685/fr/.
[52]: J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano.
Fast Data Gathering in Radio Grid Networks, in: Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now), Lecture Notes in Computer Science, Springer, 2009, vol. 5793, p. 69-82
http://hal.inria.fr/inria-00363908/fr/.
[53]: V. Bilò, M. Flammini, G. Monaco, L. Moscardelli.
On the performances of Nash Equilibria in Isolation Games, in: Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009), Niagara Falls, New York, U.S.A., Lecture Notes in Computer Science, Springer, July 2009, vol. 5609, p. 17-26
http://www.springerlink.com/content/t02154u9h640t1xx/.
[54]: A. Casteigts, S. Chaumette, 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), Piran, Slovenia, Lecture Notes in Computer Science, Springer-Verlag, May 2009, vol. 5869
http://www.imfm.si/sirocco09/.
[55]: N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, A. Yeo.
Algorithm for Finding k -Vertex Out-trees and Its Application to k -Internal Out-branching Problem, in: COCOON, 2009, p. 37-46
http://dx.doi.org/10.1007/978-3-642-02882-3_5.
[56]: N. Cohen, F. Havet, T. Müller.
Acyclic edge-colouring of planar graphs, in: European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), Bordeaux, France, September 2009, vol. 34, p. 417-421
http://eurocomb09.labri.fr/pmwiki/pmwiki.php.
[57]: D. Coudert, F. Giroire, I. Sau.
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids, in: 20th International Workshop on Combinatorial Algorithms – IWOCA, Hradec nad Moravicí, Czech Republic, J. Kratochvíl, M. Miller (editors), Lecture Notes in Computer Science, Springer, June 2009, vol. 5874, p. 134-145
http://hal.inria.fr/inria-00429146.
[58]: D. Coudert, F. Huc, D. Mazauric, N. Nisse, 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, IEEE, February 2009
http://hal.inria.fr/inria-00331807.
[59]: D. Coudert, D. Mazauric, N. Nisse.
On Rerouting Connection Requests in Networks with Shared Bandwidth, in: DIMAP workshop on Algorithmic Graph Theory (AGT09), Warwick, UK, Electronic Notes in Discrete Mathematics, Elsevier, March 2009, vol. 32, p. 109-116
http://dx.doi.org/10.1016/j.endm.2009.02.015.
[60]: D. Coudert, N. Nepomuceno, 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, IEEE, June 2009
http://hal.inria.fr/inria-00344344/.
[61]: O. Dalle, F. Giroire, J. Monteiro, 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), September 2009, p. 184–193
http://dx.doi.org/10.1109/P2P.2009.5284518.
[62]: 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, IEEE Press, May 2009
ftp://ftp-sop.inria.fr/mascotte/Publications/Fer09.pdf.
[63]: M. Flammini, A. Marchetti-Spaccamela, G. Monaco, L. Moscardelli, 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, ACM, August 2009, p. 154-162
http://portal.acm.org/citation.cfm?doid=1583991.1584035.
[64]: M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, 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, IEEE, May 2009, p. 1-12
http://www.cs.technion.ac.il/~hadas/PUB/busy_times.pdf.
[65]: N. Fountoulakis, B. A. 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), Bordeaux, France, September 2009, vol. 34, p. 639–645
http://eurocomb09.labri.fr/pmwiki/pmwiki.php.
[66]: F. Giroire, J. Chandrashekar, N. Taft, E. Schooler, K. Papagiannaki.
Exploiting Temporal Persistence to Detect Covert Botnet Channels, in: 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), Saint Malo, France, Springer (editor), Lecture Notes in Computer Science, September 2009, vol. 5758
http://dx.doi.org/10.1007/978-3-642-04342-0_17.
[67]: F. Giroire, J. Monteiro, S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?, in: Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN), Oct 2009, p. 320–323
hal.archives-ouvertes.fr/inria-00408078/fr/.
[68]: C. Gomes, 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), Murcia, Spain, Lecture Notes in Computer Science, Springer, September 2009, vol. 5793, p. 327-340
http://dx.doi.org/10.1007/978-3-642-04383-3_24.
[69]: D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé.
Spanning galaxies in digraphs, in: European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), Bordeaux, France, September 2009, vol. 34, p. 139–143
hal-lirmm.ccsd.cnrs.fr/lirmm-00433050/fr.
[70]: F. Havet, 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, July 2009
ftp://ftp-sop.inria.fr/mascotte/Publications/HaLi09.pdf.
[71]: J. Himmelspach, O. Dalle, J. Ribault.
Design considerations for M&S software, in: Proceedings of the Winter Simulation Conference (WSC'09), Austin, TX, D. Rossetti, R. R. Hill, B. Johansson, A. Dunkin, R. G. Ingalls (editors), December 2009
http://wwwmosi.informatik.uni-rostock.de/mosi/veroeffentlichungen/inproceedingsreference.2009-06-01.2218174380, Invited Paper.
[72]: K. Kawarabayashi, B. A. Reed.
A nearly linear time algorithm for the half integral parity disjoint paths packing problem, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), January 2009, p. 1183–1192
http://portal.acm.org/citation.cfm?id=1496770.1496898.
[73]: K. Kawarabayashi, B. A. Reed.
Hadwiger's Conjecture is decidable, in: Proceedings of STOC 2009, 2009, p. 445–454
http://portal.acm.org/citation.cfm?id=1536414.1536476.
[74]: S. Kennedy, C. Meagher, B. A. Reed.
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time, in: European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), Bordeaux, France, September 2009, vol. 34, p. 47–51
http://eurocomb09.labri.fr/pmwiki/pmwiki.php.
[75]: Z. Li, 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), Lecture Notes in Computer Science, June 2009
http://www.lirmm.fr/wg2009/, Best student paper award.
[76]: J.-C. Maureira Bravo, D. Dujovne, 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, March 2009
http://doi.acm.org/10.1145/1537614.1537708.
[77]: J.-C. Maureira Bravo, P. Uribe, O. Dalle, T. Asahi, J. Amaya.
Component based approach using OMNeT++ for Train Communication Modeling, in: Proceedings of 9th International Conference on ITS Telecommunication, Lille, France, October 2009
ftp://ftp-sop.inria.fr/mascotte/Publications/AADMU09.pdf.
[78]: G. Mertzios, I. Sau, 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), Lecture Notes in Computer Science, June 2009
http://www.lirmm.fr/wg2009/.
[79]: C. Molle, 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, April 2009
http://hal.archives-ouvertes.fr/hal-00434057/fr/.
[80]: M. Molloy, B. A. Reed.
Asymptotically optimal frugal colouring, in: Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009, p. 106-114
http://portal.acm.org/citation.cfm?id=1496782.
[81]: N. Nisse, I. Rapaport, 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), Piran, Slovenia, Lecture Notes in Computer Science, Springer-Verlag, 2009
http://hal.inria.fr/inria-00423454.
[82]: I. Sau, 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, June 2009
http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf.
[83]: I. Sau, D. M. Thilikos.
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs, in: DIMAP workshop on Algorithmic Graph Theory (AGT09), Warwick, UK, Electronic Notes in Discrete Mathematics, Elsevier, March 2009, vol. 32, p. 59-66
http://dx.doi.org/10.1016/j.endm.2009.02.009.
[84]: A. Silva, P. Reyes, M. Debbah.
Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks, in: International Conference on Ultra Modern Telecommunications, St. Petersburg, Russia, October 2009
http://hal.inria.fr/inria-00417774/en.
[85]: F. Solano Donado, 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, IFIP/IEEE, February 2009
ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/solano09routing.pdf.

National Peer-Reviewed Conference/Proceedings

[86]: J.-C. Bermond, D. Mazauric, P. Nain.
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil, in: 10es Journées Doctorales en Informatique et Réseaux (JDIR), Belfort, France, February 2009
http://jdir.utbm.fr/index.php.
[87]: J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano.
Fast Data Gathering in Radio Grid Networks, in: 11es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09), Carry le Rouet, A. Chaintreau, C. Magnien (editors), June 2009
http://www.lif.univ-mrs.fr/algotel09.
[88]: D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni.
Reconfiguration dans les réseaux optiques, in: 11es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, A. Chaintreau, C. Magnien (editors), June 2009, p. 25-28
http://hal.inria.fr/inria-00331807.
[89]: D. Coudert, N. Nepomuceno, H. Rivano.
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks, in: 11es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), Carry le Rouet, A. Chaintreau, C. Magnien (editors), June 2009, p. 49-52
http://hal.inria.fr/inria-00384968/fr/.
[90]: O. Dalle, F. Giroire, J. Monteiro, S. Pérennes.
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair, in: 11es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'2009), Carry-Le-Rouet France, A. Chaintreau, C. Magnien (editors), 2009
http://hal.inria.fr/inria-00384822/en/, Best Student Paper Award.

Scientific Books (or Scientific Book chapters)

[91]: V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, L. Moscardelli.
Game-Theoretic Approaches to Optimization Problems in Communication Networks, in: Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, EATCS Texts in Theoretical Computer Science, Springer, November 2009, vol. XXVII, p. 241-264
http://www.springer.com/computer/foundations/book/978-3-642-02249-4.
[92]: T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, S. Zaks.
Traffic Grooming: Combinatorial Results and Practical Resolutions, in: Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, EATCS Texts in Theoretical Computer Science, Springer, November 2009, vol. XXVII, p. 63-94
http://www.springer.com/computer/foundations/book/978-3-642-02249-4.
[93]: I. Sau, J. Zerovnik.
Permutation Routing and (ℓ,k)-Routing on Plane Grids, in: Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, EATCS Texts in Theoretical Computer Science, Springer, November 2009, vol. XXVII, p. 265-279
http://www.springer.com/computer/foundations/book/978-3-642-02249-4.

Books or Proceedings Editing

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

Internal Reports

[95]: J. Araujo, N. Cohen, F. Giroire, F. Havet.
Good edge-labelling of graphs, INRIA, May 2009, n^o 6934
http://hal.inria.fr/inria-00383343/en/, Research Report.
[96]: J.-C. Bermond, C. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau.
Drop cost and wavelength optimal two-period grooming with ratio 4, INRIA, November 2009, n^o RR-7101
http://hal.archives-ouvertes.fr/inria-00432801/en/, Technical report.
[97]: J.-C. Bermond, M. Cosnard, S. Pérennes.
Directed acyclic graphs with unique path property, INRIA, May 2009, n^o 6932
hal.archives-ouvertes.fr/docs/00/38/70/85/PDF/upp0509.pdf, Technical report.
[98]: J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, F. Solano Donado.
MPLS label stacking on the line network, INRIA, January 2009, n^o RR-6803
http://hal.inria.fr/inria-00354267/, Technical report.
[99]: J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts, INRIA, October 2009, n^o RR-7071
http://hal.archives-ouvertes.fr/inria-00426681/en/, Research Report.
[100]: J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.
GMPLS Routing Strategies based on the Design of Hypergraph Layouts, INRIA, February 2009, n^o RR-6842
http://hal.inria.fr/inria-00360576/, Technical report.
[101]: J.-C. Bermond, D. Coudert, J. Peters.
Online Distributed Traffic Grooming on Path Networks, INRIA, February 2009, n^o RR-6833
http://hal.inria.fr/inria-00359810/, Technical report.
[102]: J.-C. Bermond, X. Muñoz, I. Sau.
Traffic Grooming in Bidirectional WDM Ring Networks, INRIA, October 2009, n^o RR-7080
http://hal.inria.fr/inria-00429155/, Technical report.
[103]: J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano.
Fast Data Gathering in Radio Grid Networks, INRIA, March 2009, n^o RR-6851
http://hal.inria.fr/inria-00363908, Research Report.
[104]: N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse.
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks., INRIA, September 2009, n^o RR-7047
http://hal.archives-ouvertes.fr/inria-00421140/fr/, Technical report.
[105]: N. Cohen, F. Havet.
Planar graphs with maximum degree $\upper_delta$ $\ge$ 9 are ( $\upper_delta$ + 1 )-edge-choosable – short proof, INRIA, nov 2009, n^o RR-7098
http://hal.archives-ouvertes.fr/inria-00432389/en/, Technical report.
[106]: N. Cohen, F. Havet, T. Müller.
Acyclic edge-colouring of planar graphs, INRIA, mar 2009, n^o 6876
http://hal.inria.fr/inria-00367394/fr/, Research Report.
[107]: D. Coudert, F. Giroire, I. Sau.
Circuit visiting 10 ordered vertices in infinite grids, INRIA, April 2009, n^o RR-6910
http://hal.inria.fr/inria-00378586, Technical report.
[108]: D. Coudert, D. Mazauric, N. Nisse.
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth., INRIA, January 2009, n^o RR-6790
http://hal.inria.fr/inria-00350025/, Technical report.
[109]: N. Eggemann, F. Havet, S. Noble.
k -L(2, 1) -Labelling for Planar Graphs is NP-Complete for k $\ge$ 4 , INRIA, February 2009, n^o 6840
http://hal.inria.fr/inria-00360505/fr/, Research Report.
[110]: R. Erman, F. Havet, B. Lidicky, O. Pangrác.
5-colouring graphs with 4 crossings, INRIA, November 2009, n^o 7110, Research Report.
[111]: F. Giroire, J. Monteiro, S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?, INRIA, July 2009, n^o RR-7006
http://hal.inria.fr/inria-00408078/en/, Research Report.
[112]: F. Havet, S. Jendrol', R. Soták, E. Skrabul'aková.
Facial non-repetitive edge-colouring of plane graphs, INRIA, March 2009, n^o 6873
http://hal.inria.fr/inria-00366589/en/, Research Report.
[113]: L. Hogie, D. Papadimitriou, I. Tahiri, F. Majorczyk.
Simulating routing schemes on large-scale topologies, INRIA, November 2009, n^o RT-0371, Technical report.
[114]: F. Huc, C. Molle, N. Nisse, S. Pérennes, H. Rivano.
Stability of a local greedy distributed routing algorithm, INRIA, March 2009, n^o RR-6871
http://hal.inria.fr/inria-00366441/, Technical report.
[115]: J.-C. Maureira Bravo, D. Dujovne, O. Dalle.
Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover, INRIA, April 2009, n^o RR-6850
http://hal.inria.fr/inria-00369419/en/, Research Report.
[116]: A. Silva, P. Reyes, M. Debbah.
Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks, INRIA, March 2009, n^o RR-6854
http://hal.inria.fr/inria-00364370, Research Report.

Other Publications

[117]: F. Guinand, B. Onfroy.
MANET : étude de l'impact de la mobilité sur la connexité du réseau, June 2009
http://www-sop.inria.fr/members/Brice.Onfroy/, 11es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'2009), Poster.
[118]: F. Guinand, B. Onfroy.
MANET : modèle de mobilité planifié, July 2009
http://www-sop.inria.fr/members/Brice.Onfroy/, Ubimob'09, Demonstration.
[119]: J. Ribault, F. Peix, J. Monteiro, O. Dalle.
OSA: an Integration Platform for Component-Based Simulation, March 3-5 2009
http://doi.acm.org/10.1145/1537614.1537668, Second Intl. Conf. on Simulation Tools and Techniques (SIMUTools09), Poster absract..

References in notes

[120]: J.-C. Bermond, D. Mazauric, V. Misra, P. Nain.
Distributed Call Scheduling in Wireless Networks, INRIA, December 2008, n^o RR-6763
http://hal.inria.fr/inria-00345669, Technical report.
[121]: O. Dalle.
OSA: an Open Component-based Architecture for Discrete-Event Simulation, INRIA, February 2006, n^o RR-5762, version 2
http://hal.inria.fr/inria-00070258/fr/, Technical report.
[122]: J.-F. Lalande, M. Syska, Y. Verhoeven.
Mascopt - A Network Optimization Library: Graph Manipulation, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004, n^o RT-0293
http://hal.inria.fr/inria-00069887/fr/, Technical report.

Logo Inria