EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1E. 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, April 2009, p. 1431 - 1439.

    http://dx.doi.org/10.1109/INFCOM.2009.5062059
  • 2J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.

    GMPLS Label Space Minimization through Hypergraph Layouts, in: Theoretical Computer Science, July 2012, vol. 444, p. 3-16.

    http://hal.inria.fr/hal-00706260
  • 3J.-C. Bermond, F. Ergincan, M. Syska.

    Line Directed Hypergraphs, in: Quisquater Festschrift, D. Naccache (editor), Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 2011, vol. 6805, p. 25-34.

    http://hal.archives-ouvertes.fr/hal-00643785
  • 4C. Caillouet, S. Pérennes, H. Rivano.

    Framework for Optimizing the Capacity of Wireless Mesh Networks, in: Computer Communications, 2011, vol. 34, no 13, p. 1645-1659.

    http://hal.inria.fr/inria-00572967/en
  • 5I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano.

    Fractional Path Coloring in Bounded Degree Trees with Applications, in: Algorithmica, 2010, vol. 58, no 2, p. 516-540.

    http://dx.doi.org/10.1007/s00453-009-9278-3
  • 6N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse.

    Tradeoffs in process strategy games with application in the WDM reconfiguration problem, in: Theoretical Computer Science (TCS), August 2011, vol. 412, no 35, p. 4675-4687.

    http://dx.doi.org/10.1016/j.tcs.2011.05.002
  • 7D. 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, no 2, p. 169-184.

    http://hal.archives-ouvertes.fr/hal-00371100
  • 8F. V. Fomin, P. Fraigniaud, N. Nisse.

    Nondeterministic Graph Searching: From Pathwidth to Treewidth, in: Algorithmica, 2009, vol. 53, no 3, p. 358-373.

    http://www.springerlink.com/content/42g5tp1588w89186/
  • 9F. Giroire.

    Order statistics and estimating cardinalities of massive data sets, in: Discrete Applied Mathematics, 2009, vol. 157, no 2, p. 406-427.

    http://dx.doi.org/10.1016/j.dam.2008.06.020
  • 10F. Giroire, D. Mazauric, J. Moulierac.

    Energy Efficient Routing by Switching-Off Network Interfaces, in: Energy-Aware Systems and Networking for Sustainable Initiatives, N. Kaabouch, W.-C. Hu (editors), IGI Global, 2012, p. 207-236.

    http://hal.inria.fr/hal-00759894
  • 11D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé.

    On spanning galaxies in digraphs, in: Discrete Applied Mathematics, 2012, vol. 160, no 6, p. 744-754.

    http://hal.inria.fr/lirmm-00736492
  • 12F. Havet, B. Reed, J.-S. Sereni.

    Griggs and Yeh's Conjecture and L(p,1)-labelings, in: Siam Journal on Discrete Mathematics, February 2012, vol. 26, no 1, p. 145–168.

    http://hal.inria.fr/inria-00327909
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 13J. Araujo.

    Coloration et convexité dans les graphes, Université de Nice Sophia-Antipolis, September 2012.

    http://hal.inria.fr/tel-00732919
  • 14L. Sampaio.

    Aspects algorithmiques d'heuristiques de coloration de graphes, Université de Nice Sophia-Antipolis, November 2012.

    http://hal.inria.fr/tel-00759408
  • 15M. Toko Worou.

    Outils Algorithmiques pour la Détection des Communautés dans les Réseaux, Université de Nice Sophia-Antipolis, December 2012.

Articles in International Peer-Reviewed Journals

  • 16O. Amini, D. Peleg, S. Pérennes, I. Sau, S. Saurabh.

    On the approximability of some degree-constrained subgraph problems, in: Discrete Applied Mathematics, August 2012, vol. 160, no 2, p. 1661-1679. [ DOI : 10.1016/j.dam.2012.03.025 ]

    http://hal.inria.fr/lirmm-00736702
  • 17J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski.

    Weighted improper colouring, in: Journal of Discrete Algorithms, 2012, vol. 16, p. 53-66. [ DOI : 10.1016/j.jda.2012.07.001 ]

    http://hal.inria.fr/hal-00747755
  • 18J. Araujo, N. Cohen, F. Giroire, F. Havet.

    Good edge-labelling of graphs, in: Discrete Applied Mathematics, 2012, vol. 160, no 18, p. 2501–2513.

    http://hal.inria.fr/hal-00749194
  • 19J. Araujo, C. Linhares Sales.

    On the Grundy number of graphs with few P4's, in: Discrete Applied Mathematics, December 2012, vol. 160, no 18, p. 2514-2522. [ DOI : 10.1016/j.dam.2011.08.016 ]

    http://hal.inria.fr/inria-00639008
  • 20J. Bang-Jensen, F. Havet, N. Trotignon.

    Finding an induced subdivision of a digraph, in: Theoretical Computer Science, 2012, vol. 443, p. 10-24.

    http://hal.inria.fr/hal-00757430
  • 21L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. M. Thilikos.

    Connected Graph Searching, in: Information and Computation, 2012, vol. 219, p. 1-16.

    http://hal.inria.fr/hal-00741948
  • 22S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, L. Stougie.

    Scheduling Real-time Mixed-criticality Jobs, in: IEEE Transactions on Computers, August 2012, vol. 61, no 8, p. 1140-1152. [ DOI : 10.1109/TC.2011.142 ]

    http://hal.inria.fr/hal-00643942
  • 23R. Bauer, G. D'Angelo, D. Delling, A. Schumm, D. Wagner.

    The Shortcut Problem - Complexity and Algorithms, in: Journal of Graph Algorithms and Applications, August 2012, vol. 16, no 2. [ DOI : 10.7155/jgaa.00270 ]

    http://hal.inria.fr/hal-00728877
  • 24J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado.

    GMPLS Label Space Minimization through Hypergraph Layouts, in: Theoretical Computer Science, July 2012, vol. 444, p. 3-16. [ DOI : 10.1016/j.tcs.2012.01.033 ]

    http://hal.inria.fr/hal-00706260
  • 25J.-C. Bermond, J. Peters.

    Optimal Gathering in Radio Grids with Interference, in: Journal of Theoretical Computer Science (TCS), October 2012, vol. 457, p. 10-26. [ DOI : 10.1016/j.tcs.2012.07.021 ]

    http://hal.inria.fr/hal-00747751
  • 26S. Bhadra, A. Ferreira.

    Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs, in: J. Internet Services and Applications, 2012, vol. 3, no 3, p. 269-275.

    http://hal.inria.fr/inria-00072057
  • 27V. Campos, A. Gyarfas, F. Havet, C. Linhares Sales, F. Maffray.

    New bounds on the Grundy number of products of graphs, in: Journal of Graph Theory, 2012, vol. 71, no 1, p. 78–88.

    http://hal.inria.fr/hal-00749190
  • 28S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, V. Maurizio.

    Engineering a new algorithm for distributed shortest paths on dynamic networks, in: Algorithmica, March 2012. [ DOI : 10.1007/s00453-012-9623-9 ]

    http://hal.inria.fr/hal-00728876
  • 29D. Coudert, F. Huc, D. Mazauric.

    A Distributed Algorithm for Computing the Node Search Number in Trees, in: Algorithmica, 2012, vol. 63, no 1, p. 158-190. [ DOI : 10.1007/s00453-011-9524-3 ]

    http://hal.inria.fr/inria-00587819
  • 30G. D'Angelo, G. Di Stefano, A. Navarra.

    Flow problems in multi-interface networks, in: IEEE Transactions on Computers, September 2012.

    http://hal.inria.fr/hal-00728878
  • 31G. D'Angelo, G. Di Stefano, A. Navarra.

    Minimize the Maximum Duty in Multi-interface Networks, in: Algorithmica, June 2012, vol. 63, no 1-2, p. 274-295. [ DOI : 10.1007/s00453-011-9531-4 ]

    http://hal.inria.fr/hal-00643961
  • 32W. Fang, X. Liang, S. Li, L. Chiaraviglio, N. Xiong.

    VMPlanner: Optimizing Virtual Machine Placement and Traffic Flow Routing to Reduce Network Power Costs in Cloud Data Centers, in: Computer Networks, September 2012.
  • 33A. Ferreira, A. Jarry.

    Minimum-Energy Broadcast Routing in Dynamic Wireless Networks, in: Journal of Green Engineering, 2012, vol. 2, no 2, p. 115-123.

    http://riverpublishers.com/journal/journal_articles/RP_Journal_1904-4720_222.pdf
  • 34D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé.

    On spanning galaxies in digraphs, in: Discrete Applied Mathematics, 2012, vol. 160, no 6, p. 744-754.

    http://hal.inria.fr/lirmm-00736492
  • 35F. Havet, C. Linhares Sales, L. Sampaio.

    b-coloring of tight graphs, in: Discrete Applied Mathematics, 2012, vol. 160, no 18, p. 2709–2715.

    http://hal.inria.fr/hal-00749192
  • 36F. Havet, B. Reed, J.-S. Sereni.

    Griggs and Yeh's Conjecture and L(p,1)-labelings, in: Siam Journal on Discrete Mathematics, February 2012, vol. 26, no 1, p. 145–168. [ DOI : 10.1137/090763998 ]

    http://hal.inria.fr/inria-00327909
  • 37N. Nisse, I. Rapaport, K. Suchan.

    Distributed computing of efficient routing schemes in generalized chordal graphs, in: Theoretical Computer Science, 2012, vol. 444, no 27, p. 17-27.

    http://hal.inria.fr/hal-00741970

International Conferences with Proceedings

  • 38M. Ajmone-Marsan, S. Buzzi, L. Chiaraviglio, M. Meo, C. Guerrero, F. Idzikowski, Y. Ye, J. Lopez Vizcaino.

    TREND: Toward Real Energy-efficient Network Design, in: SustainIT 2012 - The Second IFIP Conference on Sustainable Internet and ICT for Sustainability, Pisa, Italy, October 2012, p. 1-6.

    http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SustainIT2012.pdf
  • 39S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, S. Ster, L. Stougie.

    The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems, in: 24th Euromicro Conference on Real-Time Systems (ECRTS12), Pisa, Italy, IEEE, July 2012, p. 145-154. [ DOI : 10.1109/ECRTS.2012.42 ]

    http://hal.inria.fr/hal-00728995
  • 40F. Becker, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan.

    Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models, in: Symposium on Parallelism in Algorithms and Architectures, United States, 2012, 7 p.

    http://hal.inria.fr/hal-00704200
  • 41S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri.

    Reconfiguration with physical constraints in WDM networks, in: Workshop on New Trends in Optical Networks Survivability, Canada, 2012, 5 p.

    http://hal.inria.fr/hal-00704199
  • 42J.-C. Bermond, D. Coudert, G. D'Angelo, F. Z. Moataz.

    Diverse Routing in Networks with Star SRLGs, in: ACM CoNEXT Student Workshop, Nice, France, December 2012, p. 1-2.

    http://hal.inria.fr/hal-00747757
  • 43L. Blin, J. Burman, N. Nisse.

    Brief Announcement: Distributed Exclusive and Perpetual Tree Searching, in: DISC - 26th International Symposium on Distributed Computing, Salvador, Brazil, 2012.

    http://hal.inria.fr/hal-00741982
  • 44L. Blin, J. Burman, N. Nisse.

    Nettoyage perpétuel de réseaux, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), 2012, 4 p.

    http://hal.inria.fr/hal-00687134
  • 45L. Chiaraviglio, A. Cianfrani.

    On the Effectiveness of Sleep Modes in Backbone Networks with Limited Configurations, in: 20th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2012), Split, Croatia, September 2012, p. 1-6.

    http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SleepModeEffectiveness.pdf
  • 46D. Coudert, L. Hogie, A. Lancin, D. Papadimitriou, S. Pérennes, I. Tahiri.

    Feasibility study on distributed simulations of BGP, in: PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012, Zhangjiajie, China, IEEE, April 2012.

    http://hal.inria.fr/hal-00706415
  • 47G. D'Angelo, M. D'Emidio, D. Frigioni, V. Maurizio.

    Engineering a new loop-free shortest paths routing algorithm, in: 11th International Symposium on Experimental Algorithms (SEA2012), Bordeaux, France, Lecture Notes in Computer Science, Springer, June 2012, vol. 7276, p. 123-134. [ DOI : 10.1007/978-3-642-30850-5_12 ]

    http://hal.inria.fr/hal-00729005
  • 48G. D'Angelo, M. D'Emidio, D. Frigioni, D. Romano.

    Enhancing the computation of distributed shortest paths on real dynamic networks, in: 1st Mediterranean Conference on Algorithms, Ein-Gedi, Israel, Lecture Notes in Computer Science, Springer, December 2012, vol. 7659, p. 148-158.

    http://hal.inria.fr/hal-00755395
  • 49G. D'Angelo, M. D'Emidio, D. Frigioni, C. Vitale.

    Fully Dynamic Maintenance of Arc-Flags in Road Networks, in: 11th International Symposium on Experimental Algorithms (SEA2012), Bordeaux, France, Lecture Notes in Computer Science, Springer, June 2012, vol. 7276, p. 135-147. [ DOI : 10.1007/978-3-642-30850-5_13 ]

    http://hal.inria.fr/hal-00729008
  • 50G. D'Angelo, G. Di Stefano, R. Klasing, A. Navarra.

    Gathering of Robots on Anonymous Grids without multiplicity detection, in: 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Reykjavík, Iceland, Lecture Notes in Computer Science, Springer, June 2012, vol. 7355, p. 327-338. [ DOI : 10.1007/978-3-642-31104-8_28 ]

    http://hal.inria.fr/hal-00728988
  • 51G. D'Angelo, G. Di Stefano, A. Navarra.

    How to gather asynchronous oblivious robots on anonymous rings, in: 26th International Symposium on Distributed Computing (DISC 2012), Salvador, Brazil, Lecture Notes in Computer Science, Springer, October 2012, vol. 7611, p. 330-344.

    http://hal.inria.fr/hal-00728979
  • 52F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    Satisfaire un internaute impatient est difficile, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), 2012, p. 79-82.

    http://hal.inria.fr/hal-00687102
  • 53F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    To Satisfy Impatient Web surfers is Hard, in: 6th International Conference on FUN with Algorithms (FUN), Italy, 2012, p. 166-176.

    http://hal.inria.fr/hal-00704201
  • 54F. Giroire, J. Moulierac, T. K. Phan, F. Roudaut.

    Minimization of Network Power Consumption with Redundancy Elimination, in: International IFIP TC 6 Networking Conference, Prague, Czech Republic, R. Bestak, L. Kencl, L. E. Li, J. Widmer, H. Yin (editors), Lecture Notes in Computer Science, Springer, May 2012, vol. 7289, p. 247-258. [ DOI : 10.1007/978-3-642-30045-5_19 ]

    http://hal.inria.fr/hal-00721855
  • 55A. Goldman, P. Floriano, A. Ferreira.

    A tool for obtaining information on DTN traces, in: 4th Extreme Conference on Communication (ExtremeCom 2012), Zurich, Switzerland, 2012, 6 p.

    http://hal.inria.fr/hal-00742993
  • 56F. Idzikowski, R. Duque, F. Jimenez, E. Le Rouzic, L. Chiaraviglio, M. Ajmone-Marsan.

    Energy Saving in Optical Operator Networks: the Challenges, the TREND Vision, and Some Results, in: ECOC 2012 - European Conference and Exhibition on Optical Communication, Amsterdam, Netherlands, September 2012, p. 1-3.

    http://www.telematica.polito.it/oldsite/chiaraviglio/papers/ECOC2012.pdf
  • 57A. Kosowski, B. Li, N. Nisse, K. Suchan.

    k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), 2012, p. 83-86.

    http://hal.inria.fr/hal-00687120
  • 58A. Kosowski, B. Li, N. Nisse, K. Suchan.

    k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, in: 39th International Colloquium on Automata, Languages and Programming (ICALP), track C, United Kingdom, 2012, p. 610-622.

    http://hal.inria.fr/hal-00704202
  • 59K. Phan, J. Moulierac, C. Ngoc Tran, N. Thoai.

    Xcast6 Treemap Islands - Revisiting Multicast Model, in: ACM CoNEXT Student Workshop, Nice, France, December 2012.

    http://hal.inria.fr/hal-00749266
  • 60T. K. Phan, T. Thanh Tran, D. Doan Nguyen, N. Thoai.

    MaxNet and TCP Reno/RED on Mice Traffic, in: Modeling, Simulation and Optimization of Complex Processes, Ha Noi, Viet Nam, Springer, March 2012, p. 247-255. [ DOI : 10.1007/978-3-642-25707-0_20 ]

    http://hal.inria.fr/hal-00721882

Scientific Books (or Scientific Book chapters)

  • 61G. D'Angelo, G. Di Stefano, A. Navarra.

    Gathering asynchronous and oblivious robots on basic graph topologies under the Look -Compute-Move model, in: Search Games and Rendezvous, S. Alpern, R. Fokkink, L. Gasieniec, R. Lindelauf, V. Subrahmanian (editors), Springer, November 2012, Volume dedicated to the Workshop on Search and Rendezvous that took place in May 2012 in Lorentz Centre.

    http://hal.inria.fr/hal-00755407
  • 62F. Giroire, D. Mazauric, J. Moulierac.

    Energy Efficient Routing by Switching-Off Network Interfaces, in: Energy-Aware Systems and Networking for Sustainable Initiatives, N. Kaabouch, W.-C. Hu (editors), IGI Global, 2012, p. 207-236.

    http://hal.inria.fr/hal-00759894

Internal Reports

  • 63J. Araujo, F. Giroire, Y. Liu, R. Modrzejewski, J. Moulierac.

    Energy Efficient Content Distribution, Inria, October 2012, no RR-8091, 24 p.

    http://hal.inria.fr/hal-00743248
  • 64J. Araujo, G. Morel, L. Sampaio, R. Soares, V. Weber.

    Hull number: P_5-free graphs and reduction rules, Inria, August 2012, no RR-8045, 10 p.

    http://hal.inria.fr/hal-00724120
  • 65J. Bang-Jensen, F. Havet, A. K. Maia.

    Finding a subdivision of a digraph, Inria, July 2012, no RR-8024.

    http://hal.inria.fr/hal-00720500
  • 66J.-C. Bermond, D. Coudert, G. D'Angelo, F. Z. Moataz.

    Diverse Routing with the star property, Inria, September 2012, no RR-8071.

    http://hal.inria.fr/hal-00733869
  • 67L. Blin, J. Burman, N. Nisse.

    Perpetual Graph Searching, Inria, February 2012, no RR-7897.

    http://hal.inria.fr/hal-00675233
  • 68V. Campos, F. Havet, R. Sampaio, A. Silva.

    Backbone colouring: tree backbones with small diameter in planar graphs, Inria, November 2012, no RR-8151.

    http://hal.inria.fr/hal-00758548
  • 69N. Cohen, D. Coudert, A. Lancin.

    Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, Inria, September 2012, no RR-8074.

    http://hal.inria.fr/hal-00735481
  • 70G. D'Angelo, G. Di Stefano, A. Navarra.

    How to gather asynchronous oblivious robots on anonymous rings, Inria, May 2012, no RR-7963, 24 p.

    http://hal.inria.fr/hal-00697132
  • 71G. D'Angelo, G. Di Stefano, A. Navarra, N. Nisse, K. Suchan.

    A unified approach for different tasks on rings in robot-based computing systems, Inria, 2012, no RR-8013.

    http://hal.inria.fr/hal-00716761
  • 72G. Ducoffe.

    Eulerian and Hamiltonian Directed Hypergraphs, Inria, February 2012, no RR-7893, 55 p.

    http://hal.inria.fr/hal-00674655
  • 73F. Havet, A. King.

    List circular backbone colouring, Inria, November 2012, no RR-8159.

    http://hal.inria.fr/hal-00759527
  • 74F. Havet, A. King, M. Liedloff, I. Todinca.

    (Circular) backbone colouring: tree backbones in planar graphs, Inria, November 2012, no RR-8152.

    http://hal.inria.fr/hal-00759044
  • 75F. Havet, A. K. Maia, M. Yu.

    Complexity of greedy edge-colouring, Inria, December 2012, no RR-8171.

    http://hal.inria.fr/hal-00762534
  • 76F. Havet, N. Paramaguru, R. Sampathkumar.

    Detection number of bipartite graphs and cubic graphs, Inria, October 2012, no RR-8115, 17 p.

    http://hal.inria.fr/hal-00744365
  • 77A. Kosowski, B. Li, N. Nisse, K. Suchan.

    k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, Inria, February 2012, no RR-7888.

    http://hal.inria.fr/hal-00671861
  • 78N. Nisse, R. Soares.

    On The Monotonicity of Process Number, Inria, October 2012, no RR-8132, 17 p.

    http://hal.inria.fr/hal-00745587

Scientific Popularization

  • 79J.-C. Bermond, J. Moulierac.

    Internet et la théorie des graphes, in: Textes et documents pour la classe, October 2012, vol. 1042, p. 32-33.

    http://hal.inria.fr/hal-00747752


previous Previous | up Home