EN FR
Homepage Inria website


Bibliography

Major publications by the team in recent years
  • 1J. Araujo, F. Giroire, J. Moulierac, Y. Liu, R. Modrzejewski.

    Energy Efficient Content Distribution, in: The Computer Journal, February 2016, vol. 59, no 2, pp. 192-207, Wilkes Award 2017. [ DOI : 10.1093/comjnl/bxv095 ]

    https://hal.inria.fr/hal-01238051
  • 2J. Bensmail, A. Harutyunyan, T.-N. Le, M. Merker, S. Thomassé.

    A Proof of the Barát–Thomassen Conjecture, in: Journal of Combinatorial Theory, Series B, May 2017, vol. 124, pp. 39 - 55. [ DOI : 10.1016/j.jctb.2016.12.006 ]

    https://hal.archives-ouvertes.fr/hal-01629943
  • 3J.-C. Bermond, N. Cohen, D. Coudert, D. Letsios, I. Milis, S. Pérennes, V. Zissimopoulos.

    Bin Packing with Colocations, in: 14th International Workshop on Approximation and Online Algorithms (WAOA), Aarhus, Denmark, K. Jansen, M. Mastrolilli (editors), Springer, August 2016, vol. 10138, pp. 40-51. [ DOI : 10.1007/978-3-319-51741-4_4 ]

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

    Exclusive Graph Searching, in: Algorithmica, 2017, vol. 77, no 3, pp. 942-969. [ DOI : 10.1007/s00453-016-0124-0 ]

    https://hal.archives-ouvertes.fr/hal-01266492
  • 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, F. Havet, W. Lochet, R. Lopes.

    Bispindle in strongly connected digraphs with large chromatic number, in: Electronic Notes in Discrete Mathematics, November 2017, vol. 62, pp. 69 - 74. [ DOI : 10.1016/j.endm.2017.10.013 ]

    https://hal.inria.fr/hal-01634307
  • 7D. Coudert, G. Ducoffe, N. Nisse.

    To Approximate Treewidth, Use Treelength!, in: SIAM Journal on Discrete Mathematics, 2016, vol. 30, no 3, 13 p. [ DOI : 10.1137/15M1034039 ]

    https://hal.inria.fr/hal-01348965
  • 8L. Hogie, M. Syska, N. Chleq.

    BigGraphs: distributed graph computing, September 2016, no IDDN.FR.001.410005.000.S.P.2015.000.31235.

    https://hal.archives-ouvertes.fr/hal-01360649
  • 9B. Reed, F. Joos, G. Perarnau, D. Rautenbach.

    How to determine if a random graph with a fixed degree sequence has a giant component, in: Probability Theory and Related Fields, January 2017, preliminary version accepted at IEEE FOCS 2016. [ DOI : 10.1007/s00440-017-0757-1 ]

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

    Minnie : An SDN world with few compressed forwarding rules, in: Computer Networks, July 2017, vol. 121, pp. 185 - 207. [ DOI : 10.1016/j.comnet.2017.04.026 ]

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

Articles in International Peer-Reviewed Journals

  • 11P. Aboulker, N. Brettell, F. Havet, D. Marx, N. Trotignon.

    Colouring graphs with constraints on connectivity, in: Journal of Graph Theory, 2017, vol. 85, no 4, pp. 814-838. [ DOI : 10.1002/jgt.22109 ]

    https://hal.inria.fr/hal-01570035
  • 12S. Albers, E. Bampis, D. Letsios, G. Lucarelli, R. Stotz.

    Scheduling on power-heterogeneous processors, in: Information and Computation, December 2017, vol. 257, pp. 22 - 33. [ DOI : 10.1016/j.ic.2017.09.013 ]

    https://hal.inria.fr/hal-01668736
  • 13E. Barme, J. Bensmail, J. Przybyło, M. Woźniak.

    On a directed variation of the 1-2-3 and 1-2 Conjectures, in: Discrete Applied Mathematics, January 2017, vol. 217, no 2, pp. 123-131.

    https://hal.archives-ouvertes.fr/hal-01175756
  • 14O. Baudon, J. Bensmail, F. Foucaud, M. Pilsniak.

    Structural properties of recursively partitionable graphs with connectivity 2, in: Discussiones Mathematicae Graph Theory, February 2017, vol. 37, pp. 89-115. [ DOI : 10.7151/dmgt.1925 ]

    https://hal.archives-ouvertes.fr/hal-00672505
  • 15J. Bensmail.

    On q-power cycles in cubic graphs, in: Discussiones Mathematicae Graph Theory, 2017, vol. 37, no 1, pp. 211 - 220. [ DOI : 10.7151/dmgt.1926 ]

    https://hal.archives-ouvertes.fr/hal-01629942
  • 16J. Bensmail, C. Duffy, S. Sen.

    Analogues of Cliques for (m,n)-colored Mixed Graphs, in: Graphs and Combinatorics, May 2017, vol. 33, no 4, pp. 735–750. [ DOI : 10.1007/s00373-017-1807-2 ]

    https://hal.archives-ouvertes.fr/hal-01078218
  • 17J. Bensmail, A. Harutyunyan, N. K. Le, B. Li, N. Lichiardopol.

    Disjoint cycles of different lengths in graphs and digraphs, in: Electronic Journal of Combinatorics, December 2017, vol. 24, no 4.

    https://hal.archives-ouvertes.fr/hal-01653334
  • 18J. Bensmail, A. Harutyunyan, T.-N. Le, M. Merker, S. Thomassé.

    A Proof of the Barát–Thomassen Conjecture, in: Journal of Combinatorial Theory, Series B, May 2017, vol. 124, pp. 39 - 55. [ DOI : 10.1016/j.jctb.2016.12.006 ]

    https://hal.archives-ouvertes.fr/hal-01629943
  • 19J. Bensmail, M. Merker, C. Thomassen.

    Decomposing graphs into a constant number of locally irregular subgraphs, in: European Journal of Combinatorics, February 2017, vol. 60, pp. 124 - 134. [ DOI : 10.1016/j.ejc.2016.09.011 ]

    https://hal.archives-ouvertes.fr/hal-01629938
  • 20J. Bensmail, S. Nandi, S. Sen.

    On oriented cliques with respect to push operation, in: Discrete Applied Mathematics, December 2017, vol. 232, pp. 50 - 63. [ DOI : 10.1016/j.dam.2017.07.037 ]

    https://hal.archives-ouvertes.fr/hal-01629946
  • 21J. Bensmail, M. Senhaji, K. Szabo Lyngsie.

    On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture, in: Discrete Mathematics and Theoretical Computer Science, August 2017, vol. 19, no 1.

    https://hal.archives-ouvertes.fr/hal-01361482
  • 22L. Blin, J. Burman, N. Nisse.

    Exclusive Graph Searching, in: Algorithmica, 2017, vol. 77, no 3, pp. 942-969. [ DOI : 10.1007/s00453-016-0124-0 ]

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

    Applying clique-decomposition for computing Gromov hyperbolicity, in: Theoretical Computer Science, 2017, vol. 690, pp. 114-139. [ DOI : 10.1016/j.tcs.2017.06.001 ]

    https://hal.inria.fr/hal-01540756
  • 24N. Cohen, F. Havet, W. Lochet, R. Lopes.

    Bispindle in strongly connected digraphs with large chromatic number, in: Electronic Notes in Discrete Mathematics, November 2017, vol. 62, pp. 69 - 74. [ DOI : 10.1016/j.endm.2017.10.013 ]

    https://hal.inria.fr/hal-01634307
  • 25G. D 'angelo, A. Navarra, N. Nisse.

    A unified approach for Gathering and Exclusive Searching on rings under weak assumptions, in: Distributed Computing, 2017, vol. 30, no 1, pp. 17-48.

    https://hal.archives-ouvertes.fr/hal-01326473
  • 26R. Dantas, F. Havet, R. M. Sampaio.

    Identifying codes for infinite triangular grids with a finite number of rows, in: Discrete Mathematics, 2017, vol. 340, pp. 1584 - 1597. [ DOI : 10.1016/j.disc.2017.02.015 ]

    https://hal.inria.fr/hal-01527023
  • 27R. Dantas, R. Sampaio, F. Havet.

    Minimum density of identifying codes of king grids, in: Electronic Notes in Discrete Mathematics, November 2017, vol. 62, pp. 51 - 56. [ DOI : 10.1016/j.endm.2017.10.010 ]

    https://hal.inria.fr/hal-01634305
  • 28F. Giroire, J.-C. Maureira.

    Analysis of the Failure Tolerance of Linear Access Networks, in: IEEE Transactions on Intelligent Transportation Systems, August 2017, pp. 1 - 10. [ DOI : 10.1109/TITS.2017.2718737 ]

    https://hal.inria.fr/hal-01633813
  • 29F. Giroire, R. Modrzejewski, N. Nisse, S. Pérennes.

    Maintaining Balanced Trees for Structured Distributed Streaming Systems, in: Discrete Applied Mathematics, December 2017, vol. 232, pp. 176 - 188. [ DOI : 10.1016/j.dam.2017.07.006 ]

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

    Grid spanners with low forwarding index for energy efficient networks, in: Discrete Applied Mathematics, March 2017. [ DOI : 10.1016/j.dam.2017.02.021 ]

    https://hal.inria.fr/hal-01634448
  • 31B. Li, F. Z. Moataz, N. Nisse, K. Suchan.

    Minimum Size Tree-Decompositions, in: Discrete Applied Mathematics, February 2017. [ DOI : 10.1016/j.dam.2017.01.030 ]

    https://hal.inria.fr/hal-01620389
  • 32E. Markou, N. Nisse, S. Pérennes.

    Exclusive graph searching vs. pathwidth, in: Information and Computation, 2017, vol. 252, pp. 243 - 260. [ DOI : 10.1016/j.ic.2016.11.007 ]

    https://hal.inria.fr/hal-01534596
  • 33B. Reed, X. Cai, G. Perarnau, A. B. Watts.

    Acyclic edge colourings of graphs with large girth, in: Random Structures & Algorithms, July 2017, vol. 50, no 4, pp. 511 - 533. [ DOI : 10.1002/rsa.20695 ]

    https://hal.archives-ouvertes.fr/hal-01641019
  • 34B. Reed, F. Joos, G. Perarnau, D. Rautenbach.

    How to determine if a random graph with a fixed degree sequence has a giant component, in: Probability Theory and Related Fields, January 2017. [ DOI : 10.1007/s00440-017-0757-1 ]

    https://hal.archives-ouvertes.fr/hal-01641473
  • 35B. Reed, G. Perarnau.

    Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree, in: Combinatorics, Probability and Computing, May 2017, vol. 26, no 03, pp. 448 - 467. [ DOI : 10.1017/S0963548316000328 ]

    https://hal.archives-ouvertes.fr/hal-01641020
  • 36B. Reed, J. Witt, M. E. Lübbecke.

    Polyhedral results on the stable set problem in graphs containing even or odd pairs, in: Mathematical Programming, June 2017. [ DOI : 10.1007/s10107-017-1168-x ]

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

    Minnie : An SDN world with few compressed forwarding rules, in: Computer Networks, July 2017, vol. 121, pp. 185 - 207. [ DOI : 10.1016/j.comnet.2017.04.026 ]

    https://hal.inria.fr/hal-01576133
  • 38S. Sahhaf, W. Tavernier, D. Papadimitriou, D. Careglio, A. Kumar, C. Glacet, D. Coudert, N. Nisse, L. Fàbrega, P. Vilà, M. Camelo, P. Audenaert, D. Colle, P. Demeester.

    Routing at Large Scale: Advances and Challenges for Complex Networks, in: IEEE Network, 2017, pp. 12 - 22. [ DOI : 10.1109/MNET.2017.1600203 ]

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

International Conferences with Proceedings

  • 39J. Bensmail, V. Garnero, N. Nisse, A. Salch, V. Weber.

    Recovery of disrupted airline operations using k-Maximum Matching in graphs, in: IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Marseille, France, Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)), September 2017, vol. 62, pp. 3-8.

    https://hal.inria.fr/hal-01534598
  • 40C. Caillouet, T. Razafindralambo.

    Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage, in: GIIS 2017 - Global Information Infrastructure and Networking Symposium, Saint-Pierre, France, IEEE (editor), October 2017.

    https://hal.inria.fr/hal-01575618
  • 41N. Cohen, F. Havet, D. Mazauric, I. Sau, R. Watrigant.

    Complexity Dichotomies for the Minimum F -Overlay Problem, in: IWOCA 2017 - 28th International Workshop on Combinatorial Algorithms, Newcastle, Australia, July 2017, 12 p.

    https://hal.inria.fr/hal-01571229
  • 42N. Cohen, N. A. Martins, F. Mc Inerney, N. Nisse, S. Pérennes, R. Sampaio.

    Enquêter dans les graphes, in: ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France, May 2017.

    https://hal.archives-ouvertes.fr/hal-01510108
  • 43N. Cohen, F. Mc Inerney, N. Nisse, S. Pérennes.

    Study of a combinatorial game in graphs through Linear Programming, in: 28th International Symposium on Algorithms and Computation (ISAAC 2017), Phuket, Thailand, 2017. [ DOI : 10.4230/LIPIcs ]

    https://hal.inria.fr/hal-01582091
  • 44D. Coudert, G. Ducoffe.

    A simple approach for lower-bounding the distortion in any Hyperbolic embedding, in: EUROCOMB'17 – The European Conference on Combinatorics, Graph Theory and Applications, Vienna, Austria, Elsevier, August 2017, vol. 61, pp. 293 - 299. [ DOI : 10.1016/j.endm.2017.06.051 ]

    https://hal.inria.fr/hal-01573042
  • 45D. Coudert, J. Luedtke, E. Moreno, K. Priftis.

    Computing and maximizing the exact reliability of wireless backhaul networks, in: International Network Optimization Conference, Lisbon, Portugal, February 2017.

    https://hal.inria.fr/hal-01593041
  • 46G. Ducoffe.

    Finding cut-vertices in the square roots of a graph, in: 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, Netherlands, Graph-Theoretic Concepts in Computer Science, June 2017, vol. 10520, pp. 234–248. [ DOI : 10.1007/978-3-319-68705-6_18 ]

    https://hal.archives-ouvertes.fr/hal-01627959
  • 47G. Ducoffe, R. Marinescu-Ghemeci, A. POPA.

    On the (di)graphs with (directed) proper connection number two, in: IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Marseille, France, September 2017, vol. 62, pp. 237 - 242. [ DOI : 10.1016/j.endm.2017.10.041 ]

    https://hal.archives-ouvertes.fr/hal-01625042
  • 48N. Huin, B. Jaumard, F. Giroire.

    Optimization of Network Service Chain Provisioning, in: IEEE International Conference on Communications 2017, Paris, France, May 2017.

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

    Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks, in: GLOBECOM 2017 - IEEE Global Communications Conference, Singapore, Singapore, December 2017, 7 p.

    https://hal.inria.fr/hal-01595989
  • 50N. Huin, A. Tomassilli, F. Giroire, B. Jaumard.

    Energy-Efficient Service Function Chain Provisioning, in: International Network Optimization Conference 2017, Lisbonne, Portugal, February 2017.

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

Internal Reports

  • 51J. Bensmail, V. Garnero, N. Nisse.

    On improving matchings in trees, via bounded-length augmentations, Université Côte d'Azur, July 2017.

    https://hal.archives-ouvertes.fr/hal-01555465
  • 52B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokol, M. SLESZYNSKA-NOWAK.

    Localization Game on Geometric and Planar Graphs, Inria, 2017.

    https://hal.inria.fr/hal-01620365
  • 53N. Cohen, N. A. Martins, F. Mc Inerney, N. Nisse, S. Pérennes, R. Sampaio.

    Spy-Game on graphs: complexity and simple topologies, Inria Sophia Antipolis, 2017.

    https://hal.archives-ouvertes.fr/hal-01463297
  • 54N. Cohen, F. Mc Inerney, N. Nisse, S. Pérennes.

    Study of a combinatorial game in graphs through Linear Programming, Inria Sophia Antipolis, 2017.

    https://hal.archives-ouvertes.fr/hal-01462890
  • 55D. Coudert, G. Ducoffe, A. Popa.

    Fully polynomial FPT algorithms for some classes of bounded clique-width graphs , Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania, July 2017, pp. 1-60, https://arxiv.org/abs/1707.05016.

    https://hal.archives-ouvertes.fr/hal-01562413
  • 56G. Ducoffe.

    Finding cut-vertices in the square roots of a graph, Université Côte d’Azur, Inria, CNRS, I3S, France, February 2017.

    https://hal.archives-ouvertes.fr/hal-01477981
  • 57G. Ducoffe, R. Marinescu-Ghemeci, A. Popa.

    On the (di)graphs with (directed) proper connection number two, Université Côte d’Azur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania, March 2017.

    https://hal.archives-ouvertes.fr/hal-01491146
  • 58F. Giroire, N. Huin, A. Tomassilli.

    The Structured Way of Dealing with Heterogeneous Live Streaming Systems, Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur, June 2017, no RR-9070, 25 p.

    https://hal.inria.fr/hal-01538587
  • 59N. Huin, M. Rifai, F. Giroire, D. L. Pacheco, G. Urvoy-Keller, J. Moulierac.

    Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks, Inria Sophia Antipolis - I3S ; I3S, January 2017, no RR-9020.

    https://hal.inria.fr/hal-01445893
  • 60K. Knauer, N. Nisse.

    Computing metric hulls in graphs, Inria - Sophia Antipolis, 2017.

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

Scientific Popularization

Other Publications

References in notes
  • 70A. Abboud, F. Grandoni, V. V. Williams.

    Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, SIAM, 2015, pp. 1681–1697.

    http://dx.doi.org/10.1137/1.9781611973730.112
  • 71A. Abboud, V. V. Williams, J. R. Wang.

    Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, SIAM, 2016, pp. 377–391.

    http://dx.doi.org/10.1137/1.9781611974331.ch28
  • 72D. Agarwal, J. Araujo, C. Caillouet, F. Cazals, D. Coudert, S. Pérennes.

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

    https://hal.inria.fr/hal-00849873
  • 73D. 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-01145940
  • 74F. V. Fomin, D. Lokshtanov, M. Pilipczuk, S. Saurabh, M. Wrochna.

    Fully polynomial-time parameterized computations for graphs and matrices of low treewidth, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, SIAM, 2017, pp. 1419–1432.

    http://dx.doi.org/10.1137/1.9781611974782.92
  • 75A. C. Giannopoulou, G. B. Mertzios, R. Niedermeier.

    Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs, in: International Symposium on Parameterized and Exact Computation (IPEC), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, vol. 43, pp. 102–113.

    http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.102
  • 76A. C. Giannopoulou, G. B. Mertzios, R. Niedermeier.

    Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs, in: Theoretical Computer Science, 2017, vol. 689, no Supplement C, pp. 67 - 95.

    http://dx.doi.org/10.1016/j.tcs.2017.05.017
  • 77P. A. Golovach, D. Kratsch, D. Paulusma, A. Stewart.

    Finding Cactus Roots in Polynomial Time, in: International Workshop on Combinatorial Algorithms (IWOCA), Lecture Notes in Computer Science, Springer, 2016, vol. 9843, pp. 361–372.

    http://dx.doi.org/10.1007/978-3-319-44543-4_28
  • 78T. Husfeldt.

    Computing Graph Distances Parameterized by Treewidth and Diameter, in: International Symposium on Parameterized and Exact Computation (IPEC), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, vol. 63, pp. 16:1–16:11.

    http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.16
  • 79H.-G. Leimer.

    Optimal decomposition by clique separators, in: Discrete Mathematics, 1993, vol. 113, no 1, pp. 99–123.

    http://dx.doi.org/10.1016/0012-365X(93)90510-Z
  • 80R. E. Tarjan.

    Decomposition by clique separators, in: Discrete Mathematics, 1985, vol. 55, no 2, pp. 221–232. [ DOI : 10.1016/0012-365X(85)90051-2 ]

    http://www.sciencedirect.com/science/article/pii/0012365X85900512
  • 81K. Verbeek, S. Suri.

    Metric embedding, hyperbolic space, and social networks, in: Computational Geometry, 2016, vol. 59, no Supplement C, pp. 1-12.

    http://dx.doi.org/10.1016/j.comgeo.2016.08.003
  • 82V. V. Williams, R. Williams.

    Subcubic equivalences between path, matrix and triangle problems, in: IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, 2010, pp. 645–654.

    http://dx.doi.org/10.1109/FOCS.2010.67