EN FR
Homepage Inria website


Bibliography

Major publications by the team in recent years
  • 1D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, S. Perennes.

    Connectivity Inference in Mass Spectrometry based Structure Determination, in: European Symposium on Algorithms, Sophia-Antipolis, France, France, H. Bodlaender, G. Italiano (editors), Lecture Notes in Computer Science - LNCS, Springer, 2013, vol. 8125, pp. 289-300. [ DOI : 10.1007/978-3-642-40450-4_25 ]

    http://hal.inria.fr/hal-00849873
  • 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, pp. 3-16.

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

    Line Directed Hypergraphs, in: Cryptography and Security: From Theory to Applications – Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday, D. Naccache (editor), Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2012, vol. 6805, pp. 25-34. [ DOI : 10.1007/978-3-642-28368-0_5 ]

    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, pp. 1645-1659.

    http://hal.inria.fr/inria-00572967/en
  • 5N. Cohen, D. Coudert, A. Lancin.

    On computing the Gromov hyperbolicity, in: ACM Journal on Experimental Algorithmics, 2015, vol. 20, no 1, 18 p. [ DOI : 10.1145/2780652 ]

    https://hal.inria.fr/hal-01182890
  • 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, pp. 4675-4687.

    http://dx.doi.org/10.1016/j.tcs.2011.05.002
  • 7F. V. Fomin, P. Fraigniaud, N. Nisse.

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

    http://www.springerlink.com/content/42g5tp1588w89186/
  • 8F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    To satisfy impatient Web surfers is hard, in: Journal of Theoretical Computer Science (TCS), March 2014, vol. 526, pp. 1-17. [ DOI : 10.1016/j.tcs.2014.01.009 ]

    https://hal.inria.fr/hal-00966985
  • 9F. Giroire.

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

    http://dx.doi.org/10.1016/j.dam.2008.06.020
  • 10S. Guillemot, F. Havet, C. Paul, A. Perez.

    On the (non-)existence of polynomial kernels for P_l-free edge modification problems, in: Algorithmica, 2013, vol. 65, no 4, pp. 900-926.

    http://hal.inria.fr/hal-00821612
  • 11F. 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, pp. 145–168.

    http://hal.inria.fr/inria-00327909
  • 12J. Moulierac, T. K. Phan.

    Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices, in: Computer Communications, May 2015, vol. 61, 11 p. [ DOI : 10.1016/j.comcom.2015.01.004 ]

    https://hal.inria.fr/hal-01162700
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 15D. Agarwal, C. Caillouet, D. Coudert, F. Cazals.

    Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems, in: Molecular and Cellular Proteomics, April 2015, 27 p. [ DOI : 10.1074/mcp.M114.047779 ]

    https://hal.inria.fr/hal-01245401
  • 16O. Amini, D. Coudert, N. Nisse.

    Non-deterministic graph searching in trees, in: Journal of Theoretical Computer Science (TCS), May 2015, vol. 580, pp. 101-121. [ DOI : 10.1016/j.tcs.2015.02.038 ]

    https://hal.inria.fr/hal-01132032
  • 17J. Araujo, N. Cohen, S. F. De Rezende, F. Havet, P. Moura.

    On the proper orientation number of bipartite graphs, in: Journal of Theoretical Computer Science (TCS), February 2015, vol. 566, pp. 59-75. [ DOI : 10.1016/j.tcs.2014.11.037 ]

    https://hal.archives-ouvertes.fr/hal-01101578
  • 18J. Araujo, F. Giroire, J. Moulierac, Y. Liu, R. Modrzejewski.

    Energy Efficient Content Distribution, in: The Computer Journal, November 2015, 16 p. [ DOI : 10.1093/comjnl/bxv095 ]

    https://hal.inria.fr/hal-01238051
  • 19J. Araujo, F. Havet, M. Schmitt.

    Steinberg-like theorems for backbone colouring, in: Electronic Notes in Discrete Mathematics (39), December 2015, pp. 223-229.

    https://hal.inria.fr/hal-01246205
  • 20J. Bang-Jensen, F. Havet, A. K. Maia de Oliveira.

    Finding a subdivision of a digraph, in: Theoretical Computer Science, 2015, vol. 562, 20 p.

    https://hal.inria.fr/hal-01111374
  • 21F. Becker, A. Kosowski, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca.

    Allowing each node to communicate only once in a distributed system: shared whiteboard models, in: Distributed Computing, 2015, vol. 28, no 3, pp. 189-200. [ DOI : 10.1145/2312005.2312008 ]

    https://hal.inria.fr/hal-01163186
  • 22J.-C. Bermond, D. Coudert, G. d'Angelo, F. Zahra Moataz.

    Finding disjoint paths in networks with star shared risk link groups, in: Journal of Theoretical Computer Science (TCS), May 2015, vol. 579, pp. 74-87. [ DOI : 10.1016/j.tcs.2015.02.012 ]

    https://hal.inria.fr/hal-01132216
  • 23J.-C. Bermond, A. Jean-Marie, D. Mazauric, J. Yu.

    Well Balanced Designs for Data Placement, in: Journal of Combinatorial Designs, February 2016, vol. 24, no 2, pp. 55-76. [ DOI : 10.1002/jcd.21506 ]

    https://hal.inria.fr/hal-01223288
  • 24J.-C. Bermond, B. Li, N. Nisse, H. Rivano, M.-L. Yu.

    Data gathering and personalized broadcasting in radio grids with interference, in: Journal of Theoretical Computer Science (TCS), 2015, vol. 562, pp. 453-475. [ DOI : 10.1016/j.tcs.2014.10.029 ]

    https://hal.inria.fr/hal-01084996
  • 25L. Blin, J. Burman, N. Nisse.

    Exclusive Graph Searching, in: Algorithmica, February 2016. [ DOI : 10.1007/s00453-016-0124-0 ]

    https://hal.archives-ouvertes.fr/hal-01266492
  • 26N. Cohen, D. Coudert, A. Lancin.

    On computing the Gromov hyperbolicity, in: ACM Journal on Experimental Algorithmics, 2015, vol. 20, no 1, 18 p. [ DOI : 10.1145/2780652 ]

    https://hal.inria.fr/hal-01182890
  • 27D. Coudert, A. Kodjo, T. K. Phan.

    Robust Energy-aware Routing with Redundancy Elimination, in: Computers and Operations Research, December 2015, vol. 64, 21 p. [ DOI : 10.1016/j.cor.2015.05.008 ]

    https://hal.inria.fr/hal-01155639
  • 28D. Coudert, D. Mazauric, N. Nisse.

    Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth, in: ACM Journal of Experimental Algorithmics, 2016, vol. 21, no 1, 23 p. [ DOI : 10.1145/2851494 ]

    https://hal.inria.fr/hal-01266496
  • 29O. Delmas, F. Havet, M. Montassier.

    Design of fault-tolerant on-board networks with variable switch sizes, in: Theoretical Computer Science, 2015, vol. 562, 15 p.

    https://hal.inria.fr/hal-01111370
  • 30F. Giroire, I. Lamprou, D. Mazauric, N. Nisse, S. Pérennes, R. Soares.

    Connected Surveillance Game, in: Journal of Theoretical Computer Science (TCS), June 2015, vol. 584, pp. 131-143.

    https://hal.inria.fr/hal-01163170
  • 31F. Giroire, J. Moulierac, T. K. Phan, F. Roudaut.

    Minimization of network power consumption with redundancy elimination, in: Computer Communications, March 2015, vol. 59, 8 p. [ DOI : 10.1016/j.comcom.2014.12.002 ]

    https://hal.inria.fr/hal-01162715
  • 32F. Giroire, S. Pérennes, I. Tahiri.

    On the complexity of equal shortest path routing, in: Networks, 2015. [ DOI : 10.1002/net.21612 ]

    https://hal.inria.fr/hal-01218473
  • 33F. Havet, A. Karolinna Maia, M.-L. Yu.

    Complexity of greedy edge-colouring, in: Journal of the Brazilian Computer Society, 2015, vol. 21, no 18. [ DOI : 10.1186/s13173-015-0036-x ]

    https://hal.inria.fr/hal-01233312
  • 34A. Kosowski, B. Li, N. Nisse, K. Suchan.

    k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, in: Algorithmica, 2015, vol. 72, no 3, pp. 758-777.

    https://hal.archives-ouvertes.fr/hal-01163494
  • 35J. Moulierac, T. K. Phan.

    Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices, in: Computer Communications, May 2015, vol. 61, 11 p. [ DOI : 10.1016/j.comcom.2015.01.004 ]

    https://hal.inria.fr/hal-01162700
  • 36G. d'Angelo, G. Di Stefano, A. Navarra, N. Nisse, K. Suchan.

    Computing on rings by oblivious robots: a unified approach for different tasks, in: Algorithmica, 2015, vol. 72, no 4, pp. 1055-1096.

    https://hal.inria.fr/hal-01168428

International Conferences with Proceedings

  • 37M. Borassi, D. Coudert, P. Crescenzi, A. Marino.

    On Computing the Hyperbolicity of Real-World Graphs, in: 23rd Annual European Symposium on Algorithms (ESA), Patras, Greece, Lecture Notes in Computer Science, Springer, September 2015, vol. 9294, pp. 215-226. [ DOI : 10.1007/978-3-662-48350-3_19 ]

    https://hal.inria.fr/hal-01199860
  • 38A. Chaintreau, G. Ducoffe, R. Geambasu, M. Lécuyer.

    Vers une plus grande transparence du Web, in: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015.

    https://hal.archives-ouvertes.fr/hal-01144787
  • 39D. Coudert, G. Ducoffe, N. Nisse.

    Structure vs métrique dans les graphes, in: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015.

    https://hal.archives-ouvertes.fr/hal-01144694
  • 40F. Giroire, F. Havet, J. Moulierac.

    Compressing two-dimensional routing tables with order, in: INOC (International Network Optimization Conference), Varsovie, Poland, May 2015.

    https://hal.inria.fr/hal-01162724
  • 41F. Giroire, N. Huin.

    Study of Repair Protocols for Live Video Streaming Distributed Systems, in: IEEE GLOBECOM 2015 - Global Communications Conference, San Diego, United States, December 2015.

    https://hal.inria.fr/hal-01221319
  • 42F. Giroire, S. Perennes, I. Tahiri.

    Grid spanners with low forwarding index for energy efficient networks ⋆, in: International Network Optimization Conference (INOC), Warsaw, Poland, Electronic Notes in Discrete Mathematics, May 2015.

    https://hal.inria.fr/hal-01218411
  • 43F. Giroire, S. Pérennes, I. Tahiri.

    How to design graphs with low forwarding index and limited number of edges, in: 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, October 2015.

    https://hal.inria.fr/hal-01221650
  • 44F. Havet, N. Huin, J. Moulierac, K. Phan.

    Routage vert et compression de règles SDN, in: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015.

    https://hal.archives-ouvertes.fr/hal-01148471
  • 45M. M. Kanté, F. Z. Moataz, B. Momège, N. Nisse.

    Finding Paths in Grids with Forbidden Transitions, in: WG 2015, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Munich, Germany, June 2015.

    https://hal.inria.fr/hal-01162796
  • 46M. M. Kanté, F. Z. Moataz, B. Momège, N. Nisse.

    On paths in grids with forbidden transitions, in: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015.

    https://hal.archives-ouvertes.fr/hal-01142745
  • 47A. Kodjo, B. Jaumard, N. Nepomuceno, M. Kaddour, D. Coudert.

    Dimensioning microwave wireless networks, in: ICC 2015 : IEEE International Conference on Communications, London, United Kingdom, IEEE, June 2015, pp. 2803 - 2809. [ DOI : 10.1109/ICC.2015.7248751 ]

    https://hal.inria.fr/hal-01198461
  • 48B. Li, F. Zahra Moataz, N. Nisse, K. Suchan.

    Minimum Size Tree-decompositions, in: LAGOS 2015 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, Beberibe, Ceará, Brazil, May 2015.

    https://hal.inria.fr/hal-01162695
  • 49N. Nisse, A. Salch, V. Weber.

    Comment appliquer les chaînes augmentantes pour atterrir a l'heure ?, in: ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France, June 2015.

    https://hal.archives-ouvertes.fr/hal-01144674
  • 50M. Rifai, N. Huin, C. Caillouet, F. Giroire, D. M. Lopez Pacheco, J. Moulierac, G. Urvoy-Keller.

    Too many SDN rules? Compress them with MINNIE, in: IEEE GLOBECOM, San diego, United States, IEEE, December 2015.

    https://hal.inria.fr/hal-01203020

Internal Reports

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

    Energy Efficient Content Distribution, Inria, January 2016, no RR-8091, 27 p.

    https://hal.inria.fr/hal-00743248
  • 53J. Araujo, F. Havet, C. Linhares Sales, A. Silva.

    Proper orientation of cacti, Inria Sophia Antipolis - Méditerranée, December 2015, no RR-8833, 17 p.

    https://hal.inria.fr/hal-01247014
  • 54J.-C. Bermond, F. Z. Moataz.

    On Spectrum Assignment in Elastic Optical Tree-Networks, Inria Sophia Antipolis ; Université Nice Sophia Antipolis, February 2015.

    https://hal.inria.fr/hal-01116321
  • 55M. Bouznif, F. Havet, M. Preissmann.

    Minimum-density identifying codes in square grids, Inria Sophia Antipolis - I3S, January 2016, no RR-8845.

    https://hal.inria.fr/hal-01259550
  • 56D. Coudert, G. Ducoffe.

    Data center interconnection networks are not hyperbolic, Inria Sophia Antipolis ; I3S ; Université Nice Sophia Antipolis ; CNRS, May 2015, 23 p.

    https://hal.inria.fr/hal-01149203
  • 57D. Coudert, G. Ducoffe.

    On the hyperbolicity of bipartite graphs and intersection graphs, Inria Sophia Antipolis - Méditerranée ; I3S ; Universite Nice Sophia Antipolis ; CNRS, October 2015, 12 p.

    https://hal.inria.fr/hal-01220132
  • 58D. Coudert, G. Ducoffe.

    Clique-decomposition revisited, Inria Sophia Antipolis - I3S, February 2016.

    https://hal.archives-ouvertes.fr/hal-01266147
  • 59D. Coudert, S. Pérennes, H. Rivano, M.-E. Voge.

    Combinatorial optimization in networks with Shared Risk Link Groups, Inria, October 2015, 24 p.

    https://hal.inria.fr/hal-01053859
  • 60G. Ducoffe, S. Legay, N. Nisse.

    On computing tree and path decompositions with metric constraints on the bags, Inria Sophia Antipolis - Méditerranée ; LRI - CNRS, University Paris-Sud, January 2016, no RR-8842, 66 p.

    https://hal.inria.fr/hal-01254917
  • 61F. Giroire, S. Pérennes, I. Tahiri.

    Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?, Inria Sophia Antipolis ; Inria, June 2015, no RR-8752.

    https://hal.inria.fr/hal-01172725
  • 62F. Havet, A. K. Maia de Oliveira, B. Mohar.

    Finding a subdivision of a prescribed digraph of order 4, Inria, September 2015, no RR-8773.

    https://hal.inria.fr/hal-01202650
  • 63S.-G. Jeong, Y. Tarabalka, N. Nisse, J. Zerubia.

    Inference of Curvilinear Structure based on Learning a Ranking Function and Graph Theory, Inria Sophia Antipolis, 2015, no RR-8789.

    https://hal.inria.fr/hal-01214932
  • 64M. M. Kanté, F. Z. Moataz, B. Momège, N. Nisse.

    Finding Paths in Grids with Forbidden Transitions, Inria Sophia Antipolis ; Univeristé Nice Sophia Antipolis ; CNRS, February 2015.

    https://hal.inria.fr/hal-01115395
  • 65N. Nisse, A. Salch, V. Weber.

    Recovery of disrupted airline operations using k-Maximum Matching in Graphs, Inria Sophia Antipolis ; Inria, February 2015, no RR-8679.

    https://hal.inria.fr/hal-01116487
  • 66M. Rifai, N. Huin, C. Caillouet, F. Giroire, J. Moulierac, D. M. Lopez Pacheco, G. Urvoy-Keller.

    MINNIE: an SDN World with Few Compressed Forwarding Rules, Inria Sophia-Antipolis ; I3S, January 2016, no RR-8848.

    https://hal.inria.fr/hal-01264387

Other Publications

  • 67G. Ducoffe, M. Lécuyer, A. Chaintreau, R. Geambasu.

    Web Transparency for Complex Targeting: Algorithms, Limits, and Tradeoffs, June 2015, SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Poster. [ DOI : 10.1145/2745844.2745896 ]

    https://hal.archives-ouvertes.fr/hal-01163552
References in notes
  • 68F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse.

    To satisfy impatient Web surfers is hard, in: Journal of Theoretical Computer Science (TCS), March 2014, vol. 526, pp. 1-17. [ DOI : 10.1016/j.tcs.2014.01.009 ]

    https://hal.inria.fr/hal-00966985
  • 69S. Szeider.

    Finding paths in graphs avoiding forbidden transitions, in: Discrete Applied Mathematics, 2003, vol. 126, no 2–3, pp. 261 - 273. [ DOI : 10.1016/S0166-218X(02)00251-2 ]

    http://www.sciencedirect.com/science/article/pii/S0166218X02002512