Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 1F. Giroire.
  
  Optimization of Network Infrastructures : Un peu de vert dans les réseaux et autres problèmes de placement et de gestion de ressources, Université Côte D'Azur, October 2018, Habilitation à diriger des recherches.
  
  https://hal.inria.fr/tel-01942208
• 2W. Lochet.
  
  Substructure in digraphs, Universite cote d'Azur, July 2018.
  
  https://hal.archives-ouvertes.fr/tel-01957030

Articles in International Peer-Reviewed Journals

• 3P. Aboulker, J. Bang-Jensen, N. Bousquet, P. Charbit, F. Havet, F. Maffray, J. Zamora.
  
  $\chi$-bounded families of oriented graphs, in: Journal of Graph Theory, September 2018, vol. 89, n^o 3, pp. 304 - 326. [ DOI : 10.1002/jgt.22252 ]
  
  https://hal.inria.fr/hal-01882395
• 4J. Araujo, G. Ducoffe, N. Nisse, K. Suchan.
  
  On interval number in cycle convexity, in: Discrete Mathematics and Theoretical Computer Science, May 2018, vol. Vol. 20 no. 1, n^o 1, pp. 1-28.
  
  https://hal.inria.fr/hal-01394201
• 5J. Araujo, F. Havet, M. Schmitt.
  
  Steinberg-like theorems for backbone colouring, in: Discrete Applied Mathematics, 2018. [ DOI : 10.1016/j.dam.2017.03.009 ]
  
  https://hal.inria.fr/hal-01796713
• 6E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko.
  
  Energy Efficient Scheduling and Routing via Randomized Rounding, in: Journal of Scheduling, February 2018, vol. 21, n^o 1, pp. 35-51. [ DOI : 10.1007/s10951-016-0500-2 ]
  
  https://hal.inria.fr/hal-01725140
• 7J. Bang-Jensen, S. Bessy, F. Havet, A. Yeo.
  
  Out-degree reducing partitions of digraphs, in: Theoretical Computer Science, April 2018, vol. 719, pp. 64-72. [ DOI : 10.1016/j.tcs.2017.11.007 ]
  
  https://hal.inria.fr/hal-01765642
• 8O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, E. Sopena.
  
  On locally irregular decompositions of subcubic graphs, in: Opuscula Mathematica, July 2018, vol. 38, n^o 6, pp. 795-817.
  
  https://hal.archives-ouvertes.fr/hal-01398228
• 9O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak.
  
  On locally irregular decompositions and the 1-2 Conjecture in digraphs, in: Discrete Mathematics and Theoretical Computer Science, October 2018, vol. vol. 20 no. 2.
  
  https://hal.archives-ouvertes.fr/hal-01374427
• 10O. Baudon, J. Bensmail, M. Senhaji, E. Sopena.
  
  Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture, in: Discrete Applied Mathematics, November 2018, vol. 251, n^o 83-92.
  
  https://hal.archives-ouvertes.fr/hal-01522853
• 11J. Bensmail.
  
  A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs, in: Discrete Applied Mathematics, 2018.
  
  https://hal.archives-ouvertes.fr/hal-01509365
• 12J. Bensmail, N. Brettell.
  
  Orienting edges to fight fire in graphs, in: The Australasian Journal of Combinatorics, March 2018, vol. 71, n^o 1, pp. 12-42.
  
  https://hal.archives-ouvertes.fr/hal-01166577
• 13J. Bensmail, V. Garnero, N. Nisse.
  
  On improving matchings in trees, via bounded-length augmentations, in: Discrete Applied Mathematics, 2018, vol. 250, n^o 11, pp. 110-129.
  
  https://hal.inria.fr/hal-01790130
• 14J. Bensmail, A. Harutyunyan, N. K. Le.
  
  List coloring digraphs, in: Journal of Graph Theory, April 2018, vol. 87, n^o 4, pp. 492-508. [ DOI : 10.1002/jgt.22170 ]
  
  https://hal.archives-ouvertes.fr/hal-01711077
• 15J. Bensmail, A. Harutyunyan, T.-N. Le, S. Thomassé.
  
  Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture, in: Combinatorica, 2018.
  
  https://hal.archives-ouvertes.fr/hal-01744515
• 16J.-C. Bermond, F. Z. Moataz.
  
  On spectrum assignment in elastic optical tree-networks, in: Discrete Applied Mathematics, October 2018.
  
  https://hal.inria.fr/hal-01962617
• 17A. Bonato, N. Clarke, D. Cox, S. Finbow, F. Mc Inerney, M.-E. Messinger.
  
  Hyperopic Cops and Robbers, in: Theoretical Computer Science, 2018.
  
  https://hal.inria.fr/hal-01627391
• 18B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokol, M. Sleszynska-Nowak.
  
  Centroidal Localization Game, in: The Electronic Journal of Combinatorics, 2018.
  
  https://hal.inria.fr/hal-01790276
• 19B. Bosek, P. Gordinowicz, J. Grytczuk, N. Nisse, J. Sokol, M. SLESZYNSKA-NOWAK.
  
  Localization game on geometric and planar graphs, in: Discrete Applied Mathematics, 2018.
  
  https://hal.inria.fr/hal-01959013
• 20N. Cohen, F. Havet.
  
  On the minimum size of an identifying code over all orientations of a graph, in: The Electronic Journal of Combinatorics, 2018, vol. 25, n^o 1, #P1.49 p.
  
  https://hal.inria.fr/hal-01765643
• 21N. Cohen, F. Havet, W. Lochet, R. Lopes.
  
  Bispindles in strongly connected digraphs with large chromatic number, in: The Electronic Journal of Combinatorics, June 2018.
  
  https://hal.inria.fr/hal-01810706
• 22N. Cohen, F. Havet, W. Lochet, N. Nisse.
  
  Subdivisions of oriented cycles in digraphs with large chromatic number, in: Journal of Graph Theory, April 2018, vol. 89, n^o 4, pp. 439-456. [ DOI : 10.1002/jgt.22360 ]
  
  https://hal.archives-ouvertes.fr/hal-01834779
• 23N. Cohen, F. Havet, D. Mazauric, I. Sau, R. Watrigant.
  
  Complexity dichotomies for the Minimum F -Overlay problem, in: Journal of Discrete Algorithms, September 2018, vol. 52-53, pp. 133-142. [ DOI : 10.1016/j.jda.2018.11.010 ]
  
  https://hal.inria.fr/hal-01947563
• 24N. Cohen, N. Martins, F. Mc Inerney, N. Nisse, S. Pérennes, R. Sampaio.
  
  Spy-game on graphs: Complexity and simple topologies, in: Theoretical Computer Science, May 2018, vol. 725, pp. 1 - 15. [ DOI : 10.1016/j.tcs.2017.11.015 ]
  
  https://hal.inria.fr/hal-01782246
• 25N. Cohen, F. Mc Inerney, N. Nisse, S. Pérennes.
  
  Study of a Combinatorial Game in Graphs Through Linear Programming, in: Algorithmica, August 2018. [ DOI : 10.1007/s00453-018-0503-9 ]
  
  https://hal.archives-ouvertes.fr/hal-01881473
• 26D. Coudert, G. Ducoffe.
  
  Revisiting Decomposition by Clique Separators, in: Siam Journal on Discrete Mathematics, January 2018, vol. 32, n^o 1, pp. 682 - 694. [ DOI : 10.1137/16M1059837 ]
  
  https://hal.inria.fr/hal-01753324
• 27D. Coudert, G. Ducoffe, N. Nisse, M. Soto.
  
  On distance-preserving elimination orderings in graphs: Complexity and algorithms, in: Discrete Applied Mathematics, March 2018, vol. 243, pp. 140-153. [ DOI : 10.1016/j.dam.2018.02.007 ]
  
  https://hal.inria.fr/hal-01741277
• 28R. Dantas, F. Havet, R. Sampaio.
  
  Minimum density of identifying codes of king grids, in: Discrete Mathematics, October 2018, vol. 341, n^o 10, pp. 2708 - 2719. [ DOI : 10.1016/j.disc.2018.06.035 ]
  
  https://hal.inria.fr/hal-01861913
• 29G. Ducoffe.
  
  A short note on the complexity of computing strong pathbreadth, in: Information Processing Letters, 2018, vol. 133, pp. 56-58. [ DOI : 10.1016/j.ipl.2018.01.005 ]
  
  https://hal.archives-ouvertes.fr/hal-01735826
• 30F. Giroire, F. Havet, J. Moulierac.
  
  On the Complexity of Compressing Two Dimensional Routing Tables with Order, in: Algorithmica, January 2018, vol. 80, n^o 1, pp. 209 - 233. [ DOI : 10.1007/s00453-016-0243-7 ]
  
  https://hal.inria.fr/hal-01686641
• 31F. Giroire, N. Huin, J. Moulierac, T. K. Phan.
  
  Energy-Aware Routing in Software-Defined Network using Compression, in: The Computer Journal, October 2018, vol. 61, n^o 10, pp. 1537 - 1556. [ DOI : 10.1093/comjnl/bxy029 ]
  
  https://hal.inria.fr/hal-01920970
• 32F. Havet, A. K. Maia, B. Mohar.
  
  Finding a subdivision of a prescribed digraph of order 4, in: Journal of Graph Theory, April 2018, vol. 87, n^o 4, pp. 536-560. [ DOI : 10.1002/jgt.22174 ]
  
  https://hal.inria.fr/hal-01711403
• 33N. Huin, B. Jaumard, F. Giroire.
  
  Optimal Network Service Chain Provisioning, in: IEEE/ACM Transactions on Networking, June 2018, vol. 26, n^o 3, pp. 1320 - 1333. [ DOI : 10.1109/TNET.2018.2833815 ]
  
  https://hal.inria.fr/hal-01920951
• 34N. Huin, M. Rifai, F. Giroire, D. L. Pacheco, G. Urvoy-Keller, J. Moulierac.
  
  Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks, in: IEEE Transactions on Green Communications and Networking, May 2018, pp. 1128 - 1139. [ DOI : 10.1109/TGCN.2018.2842123 ]
  
  https://hal.archives-ouvertes.fr/hal-01877868
• 35N. Huin, A. Tomassilli, F. Giroire, B. Jaumard.
  
  Energy-Efficient Service Function Chain Provisioning, in: Journal of optical communications and networking, 2018, vol. 10, n^o 3. [ DOI : 10.1364/JOCN.10.000114 ]
  
  https://hal.inria.fr/hal-01920960
• 36W. Lochet.
  
  Immersion of transitive tournaments in digraphs with large minimum outdegree, in: Journal of Combinatorial Theory, Series B, May 2018, 4 p. [ DOI : 10.1016/j.jctb.2018.05.004 ]
  
  https://hal.archives-ouvertes.fr/hal-01835124

Invited Conferences

• 37B. Jaumard, H. Pouya, D. Coudert.
  
  Make-Before-Break Wavelength Defragmentation, in: 20th International Conference on Transparent Optical Networks (ICTON), Bucharest, Romania, IEEE, July 2018, 5 p. [ DOI : 10.1109/ICTON.2018.8473893 ]
  
  https://hal.inria.fr/hal-01883689

International Conferences with Proceedings

• 38J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, S. Pérennes.
  
  Localiser une cible dans un graphe, in: ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018.
  
  https://hal.inria.fr/hal-01774827
• 39J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, S. Pérennes.
  
  Sequential Metric Dimension, in: 16th Workshop on Approximation and Online Algorithms (WAOA 2018), Helsinki, Finland, August 2018.
  
  https://hal.inria.fr/hal-01883712
• 40J.-C. Bermond, A. Chaintreau, G. Ducoffe, D. Mazauric.
  
  How long does it take for all users in a social network to choose their communities?, in: 9th International Conference on Fun with Algorithms (FUN 2018), La Maddalena, Italy, 2018.
  
  https://hal.inria.fr/hal-01780627
• 41C. Caillouet, F. Giroire, T. Razafindralambo.
  
  Déploiement efficace de drones pour la collecte de données de capteurs mobiles, in: Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Roscoff, France, May 2018.
  
  https://hal.archives-ouvertes.fr/hal-01786010
• 42C. Caillouet, F. Giroire, T. Razafindralambo.
  
  Optimization of mobile sensor coverage with UAVs, in: 11th International Workshop on Wireless Sensor, Robot and UAV Networks (WiSARN@IEEE INFOCOM 2018), Honolulu, United States, April 2018. [ DOI : 10.1109/INFCOMW.2018.8406980 ]
  
  https://hal.inria.fr/hal-01850442
• 43C. Caillouet, T. Razafindralambo.
  
  Analyse bi-objectif pour la couverture de cibles par des drones, in: Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Roscoff, France, May 2018.
  
  https://hal.archives-ouvertes.fr/hal-01784809
• 44C. Caillouet, T. Razafindralambo, D. Zorbas.
  
  Recharging wireless sensor networks using drones and wireless power transfer, in: 29th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2018) Recent Results track, Bologne, Italy, September 2018.
  
  https://hal.inria.fr/hal-01850446
• 45D. Coudert, G. Ducoffe, A. Popa.
  
  Fully polynomial FPT algorithms for some classes of bounded clique-width graphs, in: ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, SIAM, January 2018, 20 p. [ DOI : 10.1137/1.9781611975031.176 ]
  
  https://hal.inria.fr/hal-01676187
• 46H. Duong, B. Jaumard, D. Coudert, R. Armolavicius.
  
  Efficient Make Before Break Capacity Defragmentation, in: IEEE International Conference on High Performance Switching and Routing, Bucharest, Romania, IEEE, June 2018, 6 p.
  
  https://hal.inria.fr/hal-01930552
• 47H. Duong, B. Jaumard, D. Coudert, R. Armolavicius.
  
  Modèle d'optimisation pour la défragmentation de la capacité, in: ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018.
  
  https://hal.inria.fr/hal-01773572
• 48N. Huin, B. Jaumard, F. Giroire.
  
  Optimisation pour le Provisionnement de Chaînes de Services Réseau, in: ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018.
  
  https://hal.archives-ouvertes.fr/hal-01779589
• 49A. Tomassilli, F. Giroire, N. Huin, S. Pérennes.
  
  Algorithmes d'approximation pour le placement de chaînes de fonctions de services avec des contraintes d'ordre, in: ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018.
  
  https://hal.archives-ouvertes.fr/hal-01774540
• 50A. Tomassilli, F. Giroire, N. Huin, S. Pérennes.
  
  Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints, in: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, Honolulu, United States, IEEE, April 2018. [ DOI : 10.1109/INFOCOM.2018.8486275 ]
  
  https://hal.inria.fr/hal-01921112
• 51A. Tomassilli, N. Huin, F. Giroire, B. Jaumard.
  
  Resource Requirements for Reliable Service Function Chaining, in: 2018 IEEE International Conference on Communications (ICC 2018), Kansas City, United States, IEEE, May 2018. [ DOI : 10.1109/ICC.2018.8422774 ]
  
  https://hal.inria.fr/hal-01921096
• 52A. Tomassilli, B. Jaumard, F. Giroire.
  
  Path protection in optical flexible networks with distance-adaptive modulation formats, in: 2018 International Conference on Optical Network Design and Modeling (ONDM), Dublin, France, IEEE, May 2018. [ DOI : 10.23919/ONDM.2018.8396102 ]
  
  https://hal.inria.fr/hal-01921082

Conferences without Proceedings

• 53J.-C. Bermond, T. Kodate, J. Yu.
  
  Gossiping with interference in radio chain networks, in: 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Manila, Philippines, September 2018.
  
  https://hal.inria.fr/hal-01960744

Scientific Books (or Scientific Book chapters)

• 54F. Havet, J. Bang-Jensen.
  
  Tournaments and Semicomplete Digraphs, in: Classes of Directed Graphs, 2018.
  
  https://hal.inria.fr/hal-01958359

Internal Reports

• 55O. Baudon, J. Bensmail, T. Davot, H. Hocquard, J. Przybyło, M. Senhaji, E. Sopena, M. Woźniak.
  
  A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions, LaBRI, Université de Bordeaux ; I3S, Université Côte d'Azur ; AGH University of Science and Technology ; LIRMM, Université de Montpellier, July 2018, pp. 1-16.
  
  https://hal.archives-ouvertes.fr/hal-01690222
• 56J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, S. Perennes.
  
  Sequential Metric Dimension, Inria, 2018.
  
  https://hal.archives-ouvertes.fr/hal-01717629
• 57J. Bensmail, F. Mc Inerney, N. Nisse.
  
  Metric Dimension: from Graphs to Oriented Graphs, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, November 2018.
  
  https://hal.inria.fr/hal-01938290
• 58A. Gausseran, A. Tomassilli, F. Giroire, J. Moulierac.
  
  Don't Interrupt Me When You Reconfigure my Service Function Chains, UCA, Inria ; Université de Nice Sophia-Antipolis (UNS) ; CNRS ; UCA,I3S, December 2018, n^o RR-9241.
  
  https://hal.inria.fr/hal-01963270
• 59F. Havet, N. Nisse.
  
  Constrained ear decompositions in graphs and digraphs, Inria - Sophia Antipolis, 2018.
  
  https://hal.inria.fr/hal-01798795
• 60F. Mc Inerney, N. Nisse, S. Pérennes.
  
  Eternal Domination in Grids, Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France, May 2018.
  
  https://hal.inria.fr/hal-01790322
• 61N. Nisse.
  
  Network Decontamination, Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France, 2018, pp. 1-30.
  
  https://hal.archives-ouvertes.fr/hal-01814161
• 62A. Tomassilli, F. Giroire, N. Huin, S. Pérennes.
  
  Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints, Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis, January 2018, n^o RR-9141.
  
  https://hal.inria.fr/hal-01676501

Other Publications

• 63O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, E. Sopena.
  
  Edge Weights and Vertex Colours: Minimizing Sum Count, July 2018, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01839537
• 64J. Bensmail, T. Blanc, N. Cohen, F. Havet, L. Rocha.
  
  Backbone colouring and algorithms for TDMA scheduling, July 2018, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01851600
• 65J. Bensmail, B. Li.
  
  More Aspects of Arbitrarily Partitionable Graphs, November 2018, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01915633
• 66J. Bensmail, S. Nandi, M. Roy, S. Sen.
  
  On homomorphisms of planar signed graphs and absolute cliques, November 2018, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01919007

References in notes

• 67A. 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
• 68A. 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
• 69J. 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, 2017, vol. 124, pp. 39-55.
• 70F. Botler, G. Mota, M. Oshiro, Y. Wakabayashi.
  
  Decomposing highly edge-connected graphs into paths of any given length, in: Journal of Combinatorial Theory, Series B, 2017, vol. 122, pp. 508-542.
• 71V. Chepoi.
  
  On distance-preserving and domination elimination orderings, in: SIAM Journal on Discrete Mathematics, 1998, vol. 11, n^o 3, pp. 414–436.
  
  http://dx.doi.org/10.1137/S0895480195291230
• 72M. DeVos, J. McDonald, B. Mohar, D. Scheide.
  
  Immersing complete digraphs, in: European Journal of Combinatorics, 2012, vol. 33, n^o 6, pp. 1294 - 1302.
• 73F. 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
• 74A. 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
• 75A. 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, n^o Supplement C, pp. 67 - 95.
  
  http://dx.doi.org/10.1016/j.tcs.2017.05.017
• 76T. 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
• 77D. Kratsch, J. P. Spinrad.
  
  Minimal fill in O(n${}^{\text{2.69}}$) time, in: Discrete Mathematics, 2006, vol. 306, n^o 3, pp. 366–371.
  
  https://doi.org/10.1016/j.disc.2005.12.009
• 78A. Leitert, F. F. Dragan.
  
  On Strong Tree-Breadth, in: International Conference on Combinatorial Optimization and Applications (COCOA), Lecture Notes in Computer Science, Springer, 2016, vol. 10043, pp. 62–76.
  
  http://dx.doi.org/10.1007/978-3-319-48749-6_5
• 79R. E. Tarjan.
  
  Decomposition by clique separators, in: Discrete Mathematics, 1985, vol. 55, n^o 2, pp. 221–232. [ DOI : 10.1016/0012-365X(85)90051-2 ]
  
  http://www.sciencedirect.com/science/article/pii/0012365X85900512
• 80C. Thomassen.
  
  Decompositions of highly connected graphs into paths of length 3, in: Journal of Graph Theory, 2008, vol. 58, pp. 286-292.
• 81C. Thomassen.
  
  Edge-decompositions of highly connected graphs, in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2008, vol. 18, pp. 17-26.
• 82C. Thomassen.
  
  Decomposing graphs into paths of fixed length, in: Combinatorica, 2013, vol. 33, n^o 1, pp. 97-123.
• 83V. 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