EN FR
Homepage Inria website


Bibliography

Major publications by the team in recent years
  • 1D. 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, vol. 14, pp. 2274-2284. [ DOI : 10.1074/mcp.M114.047779 ]

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

    Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture, in: Combinatorica, April 2019, vol. 39, no 2, pp. 239-263. [ DOI : 10.1007/s00493-017-3661-5 ]

    https://hal.archives-ouvertes.fr/hal-01744515
  • 3C. Caillouet, F. Giroire, T. Razafindralambo.

    Efficient Data Collection and Tracking with Flying Drones, in: Ad Hoc Networks, 2019, vol. 89, no C, pp. 35-46. [ DOI : 10.1016/j.adhoc.2019.01.011 ]

    https://hal.inria.fr/hal-02043136
  • 4N. 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, no 4, pp. 439-456. [ DOI : 10.1002/jgt.22360 ]

    https://hal.archives-ouvertes.fr/hal-01834779
  • 5D. Coudert, G. Ducoffe.

    Revisiting Decomposition by Clique Separators, in: SIAM Journal on Discrete Mathematics, January 2018, vol. 32, no 1, pp. 682-694. [ DOI : 10.1137/16M1059837 ]

    https://hal.inria.fr/hal-01753324
  • 6D. 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
  • 7E. Cruciani, E. Natale, G. Scornavacca.

    Distributed Community Detection via Metastability of the 2-Choices Dynamics, in: AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence, Honolulu, United States, January 2019.

    https://hal.archives-ouvertes.fr/hal-02002462
  • 8F. Dross, F. Havet.

    On the Unavoidability of Oriented Trees, in: Electronic Notes in Theoretical Computer Science, August 2019, vol. 346, pp. 425-436. [ DOI : 10.1016/j.entcs.2019.08.038 ]

    https://hal.inria.fr/hal-02350215
  • 9F. Giroire, F. Havet, J. Moulierac.

    On the Complexity of Compressing Two Dimensional Routing Tables with Order, in: Algorithmica, January 2018, vol. 80, no 1, pp. 209-233. [ DOI : 10.1007/s00453-016-0243-7 ]

    https://hal.inria.fr/hal-01686641
  • 10L. 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
  • 11W. 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
  • 12M. 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
  • 13A. 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
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 16P. Aboulker, N. Cohen, F. Havet, W. Lochet, P. F. S. Moura, S. Thomassé.

    Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number, in: The Electronic Journal of Combinatorics, July 2019, vol. 26, P3.19 p.

    https://hal.archives-ouvertes.fr/hal-02275082
  • 17D. Aguirre-Guerrero, G. Ducoffe, L. Fabrega, P. Vila, D. Coudert.

    Low Time Complexity Algorithms for Path Computation in Cayley Graphs, in: Discrete Applied Mathematics, April 2019, vol. 259, pp. 218-225. [ DOI : 10.1016/j.dam.2018.12.005 ]

    https://hal.inria.fr/hal-01973608
  • 18S. D. Andres, M. Huggan, F. Mc Inerney, R. J. Nowakowski.

    The Orthogonal Colouring Game, in: Theoretical Computer Science, February 2019.

    https://hal.inria.fr/hal-02017462
  • 19S. Angelopoulos, N. Nisse, D. M. Thilikos.

    Preface to special issue on Theory and Applications of Graph Searching, in: Theoretical Computer Science, November 2019, vol. 794, pp. 1-2. [ DOI : 10.1016/j.tcs.2019.09.043 ]

    https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342745
  • 20J. Bang-Jensen, S. Bessy, F. Havet, A. Yeo.

    Bipartite spanning sub(di)graphs induced by 2-partitions, in: Journal of Graph Theory, October 2019, vol. 92, no 2, pp. 130-151. [ DOI : 10.1002/jgt.22444 ]

    https://hal.inria.fr/hal-02350210
  • 21O. 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, in: Discrete Mathematics and Theoretical Computer Science, April 2019, vol. 21, no 1.

    https://hal.archives-ouvertes.fr/hal-01690222
  • 22O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, E. Sopena.

    Edge Weights and Vertex Colours: Minimizing Sum Count, in: Discrete Applied Mathematics, November 2019, vol. 270, pp. 13-24.

    https://hal.archives-ouvertes.fr/hal-01839537
  • 23J. Bensmail.

    A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs, in: Discrete Applied Mathematics, February 2019, vol. 257, pp. 31-39. [ DOI : 10.1016/j.dam.2018.10.008 ]

    https://hal.archives-ouvertes.fr/hal-01509365
  • 24J. Bensmail.

    On the 2-edge-coloured chromatic number of grids, in: The Australasian Journal of Combinatorics, 2019, vol. 75, no 3, pp. 365-384.

    https://hal.archives-ouvertes.fr/hal-02264958
  • 25J. Bensmail, T. Blanc, N. Cohen, F. Havet, L. Rocha.

    Backbone colouring and algorithms for TDMA scheduling, in: Discrete Mathematics and Theoretical Computer Science, July 2019, vol. 21, no 3, pp. 1-24.

    https://hal.archives-ouvertes.fr/hal-01851600
  • 26J. Bensmail, F. Dross, H. Hocquard, E. Sopena.

    From light edges to strong edge-colouring of 1-planar graphs, in: Discrete Mathematics and Theoretical Computer Science, January 2020, vol. vol. 22 no. 1, no 2.

    https://hal.archives-ouvertes.fr/hal-02112188
  • 27J. Bensmail, A. Harutyunyan, T.-N. Le, S. Thomassé.

    Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture, in: Combinatorica, April 2019, vol. 39, no 2, pp. 239-263. [ DOI : 10.1007/s00493-017-3661-5 ]

    https://hal.archives-ouvertes.fr/hal-01744515
  • 28J. Bensmail, F. Mc Inerney, K. Lyngsie.

    On a,b-edge-weightings of bipartite graphs with odd a,b, in: Discussiones Mathematicae Graph Theory, 2019, forthcoming.

    https://hal.archives-ouvertes.fr/hal-01988399
  • 29J. Bensmail, J. Przybyło.

    Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture, in: Discrete Applied Mathematics, September 2019. [ DOI : 10.1016/j.dam.2019.04.011 ]

    https://hal.archives-ouvertes.fr/hal-02288797
  • 30J.-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: Discrete Applied Mathematics, 2019, vol. 270, pp. 37-57. [ DOI : 10.1016/j.dam.2019.07.023 ]

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

    On spectrum assignment in elastic optical tree-networks, in: Discrete Applied Mathematics, 2019, vol. 257, pp. 40-52. [ DOI : 10.1016/j.dam.2018.09.021 ]

    https://hal.inria.fr/hal-01962617
  • 32M. Borassi, E. Natale.

    KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, in: ACM Journal of Experimental Algorithmics, February 2019, vol. 24, no 1. [ DOI : 10.1145/3284359 ]

    https://hal.inria.fr/hal-02043367
  • 33N. Bousquet, W. Lochet, S. Thomassé.

    A proof of the Erdős–Sands–Sauer–Woodrow conjecture, in: Journal of Combinatorial Theory, Series B, July 2019, vol. 137, pp. 316-319. [ DOI : 10.1016/j.jctb.2018.11.005 ]

    https://hal.archives-ouvertes.fr/hal-02158330
  • 34C. Caillouet, F. Giroire, T. Razafindralambo.

    Efficient Data Collection and Tracking with Flying Drones, in: Ad Hoc Networks, 2019, vol. 89, no C, pp. 35-46. [ DOI : 10.1016/j.adhoc.2019.01.011 ]

    https://hal.inria.fr/hal-02043136
  • 35D. Coudert, G. Ducoffe, A. Popa.

    P-FPT algorithms for bounded clique-width graphs, in: ACM Transactions on Algorithms, June 2019, vol. 15, no 3, pp. 1-57. [ DOI : 10.1145/3310228 ]

    https://hal.archives-ouvertes.fr/hal-02152971
  • 36F. Dross, F. Havet.

    On the Unavoidability of Oriented Trees, in: Electronic Notes in Theoretical Computer Science, August 2019, vol. 346, pp. 425-436. [ DOI : 10.1016/j.entcs.2019.08.038 ]

    https://hal.inria.fr/hal-02350215
  • 37V. Garnero, C. Paul, I. Sau Valls, D. M. Thilikos.

    Explicit Linear Kernels for Packing Problems, in: Algorithmica, April 2019, vol. 81, no 4, pp. 1615-1656. [ DOI : 10.1007/s00453-018-0495-5 ]

    https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342736
  • 38F. Havet, N. Nisse.

    Constrained ear decompositions in graphs and digraphs, in: Discrete Mathematics and Theoretical Computer Science, September 2019, vol. vol. 21 no. 4.

    https://hal.inria.fr/hal-01798795
  • 39B. Jaumard, H. Pouya, D. Coudert.

    Wavelength Defragmentation for Seamless Migration, in: Journal of Lightwave Technology, September 2019, vol. 37, no 17, pp. 4382-4393. [ DOI : 10.1109/JLT.2019.2924914 ]

    https://hal.inria.fr/hal-02167682
  • 40K. Knauer, N. Nisse.

    Computing metric hulls in graphs, in: Discrete Mathematics and Theoretical Computer Science, May 2019, vol. vol. 21 no. 1, ICGT 2018.

    https://hal.inria.fr/hal-01612515
  • 41W. Lochet.

    Immersion of transitive tournaments in digraphs with large minimum outdegree, in: Journal of Combinatorial Theory, Series B, January 2019, vol. 134, pp. 350-353. [ DOI : 10.1016/j.jctb.2018.05.004 ]

    https://hal.archives-ouvertes.fr/hal-01835124

International Conferences with Proceedings

  • 42J. Bensmail, F. Mc Inerney, N. Nisse.

    Dimension Métrique des Graphes Orientés, in: AlgoTel 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, June 2019.

    https://hal.inria.fr/hal-02118847
  • 43J. Bensmail, F. Mc Inerney, N. Nisse.

    Metric Dimension: from Graphs to Oriented Graphs, in: LAGOS 2019 - 10th Latin & American Algorithms, Graphs and Optimization Symposium, Belo Horizonte, Brazil, June 2019.

    https://hal.inria.fr/hal-02098194
  • 44Y. Busnel, C. Caillouet, D. Coudert.

    Self-organized Disaster Management System by Distributed Deployment of Connected UAVs, in: ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management, Paris, France, December 2019.

    https://hal.inria.fr/hal-02349396
  • 45Y. Busnel, C. Caillouet, D. Coudert.

    Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities, in: NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications, Cambridge, United States, September 2019.

    https://hal.inria.fr/hal-02267396
  • 46C. Caillouet, M. Heusse, F. Rousseau.

    Optimal SF Allocation in LoRaWAN Considering Physical Capture and Imperfect Orthogonality, in: GLOBECOM 2019 - IEEE Global Communications Conference, Waikoloa, United States, December 2019.

    https://hal.inria.fr/hal-02267218
  • 48C. Caillouet, T. Razafindralambo, D. Zorbas.

    Utiliser des drones pour recharger efficacement des capteurs, in: ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, June 2019.

    https://hal.inria.fr/hal-02129960
  • 49G. Di Lena, A. Tomassilli, D. Saucez, F. Giroire, T. Turletti, C. Lac.

    Mininet on steroids: exploiting the cloud for Mininet performance, in: IEEE International Conference on Cloud Networking (CloudNet), Coimbra, Portugal, November 2019.

    https://hal.inria.fr/hal-02362997
  • 50A. Gausseran, A. Tomassilli, F. Giroire, J. Moulierac.

    No Interruption When Reconfiguring my SFCs, in: CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019, This work has been supported by the French government through the UCAJEDI (ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Future projects, and by Inria associated team EfDyNet.

    https://hal.inria.fr/hal-02295967
  • 51F. Giroire, N. Huin, A. Tomassilli, S. Pérennes.

    When Network Matters: Data Center Scheduling with Network Tasks, in: INFOCOM 2019 - IEEE International Conference on Computer Communications, Paris, France, April 2019.

    https://hal.inria.fr/hal-01989755
  • 52F. Mc Inerney, N. Nisse, S. Pérennes.

    Eternal Domination in Grids, in: CIAC 2019 - 11th International Conference on Algorithms and Complexity, Rome, Italy, May 2019.

    https://hal.inria.fr/hal-02098169
  • 53A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Pérennes, T. Turletti, R. Sadykov, F. Vanderbeck, C. Lac.

    Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks, in: CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019.

    https://hal.inria.fr/hal-02292971
  • 54A. Tomassilli, N. Huin, F. Giroire.

    The Structured Way of Dealing with Heterogeneous Live Streaming Systems, in: 3PGCIC - International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, Anvers, Belgium, Advances on P2P, Parallel, Grid, Cloud and Internet Computing, November 2019.

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

Conferences without Proceedings

  • 55J.-C. Bermond, T. Kodate, J. Yu.

    Gossiping with interference in radio chain networks (upper bound algorithms), in: JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Tokyo, Japan, September 2019.

    https://hal.inria.fr/hal-02316854
  • 56E. Cruciani, E. Natale, G. Scornavacca.

    Distributed Community Detection via Metastability of the 2-Choices Dynamics, in: AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence, Honolulu, United States, January 2019, https://arxiv.org/abs/1805.01406.

    https://hal.archives-ouvertes.fr/hal-02002462
  • 57A. Gausseran, A. Tomassilli, F. Giroire, J. Moulierac.

    Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains, in: IFIP Networking Conference 2019, Varsovie, Poland, May 2019.

    https://hal.inria.fr/hal-02083579
  • 58A. Gausseran, A. Tomassilli, F. Giroire, J. Moulierac.

    Reconfiguration de chaînes de fonctions de services sans interruption, in: CORES 2019 - Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Saint Laurent de la Cabrerisse, France, June 2019.

    https://hal.archives-ouvertes.fr/hal-02118989
  • 59C. Morin, G. Texier, C. Caillouet, G. Desmangles, C.-T. Phan.

    VNF placement algorithms to address the mono- and multi-tenant issues in edge and core networks, in: CloudNet 2019 - IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019.

    https://hal.archives-ouvertes.fr/hal-02313403
  • 60E. Natale, I. Ramezani.

    On the Necessary Memory to Compute the Plurality in Multi-Agent Systems, in: CIAC 2019 - 11th International Conference Algorithms and Complexity, Rome, Italy, 2019, pp. 323-338. [ DOI : 10.1007/978-3-030-17402-6_27 ]

    https://hal.archives-ouvertes.fr/hal-02002448

Scientific Books (or Scientific Book chapters)

Internal Reports

  • 62S. D. Andres, F. Dross, M. Huggan, F. Mc Inerney, R. J. Nowakowski.

    On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution, Inria - Sophia Antipolis, March 2019.

    https://hal.inria.fr/hal-02053265
  • 63J. Bensmail, F. Dross, N. Nisse.

    Decomposing degenerate graphs into locally irregular subgraphs, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2019.

    https://hal.archives-ouvertes.fr/hal-02090804
  • 64J. Bensmail, B. Li, B. Li, N. Nisse.

    On Minimizing the Maximum Color for the 1-2-3 Conjecture, université côte d'azur, 2019.

    https://hal.archives-ouvertes.fr/hal-02330418
  • 65Y. Busnel, C. Caillouet, D. Coudert.

    VESPA: Constrained target coverage by distributed deployment of connected UAVs, Inria ; I3S, Université Côte d'Azur ; IMT Atlantique, May 2019.

    https://hal.inria.fr/hal-02125359
  • 66A. Gagnon, A. Hassler, J. Huang, A. Krim-Yee, F. Mc Inerney, A. M. Zacarías, B. Seamone, V. Virgile.

    A method for eternally dominating strong grids, Inria - Sophia Antipolis, February 2019.

    https://hal.archives-ouvertes.fr/hal-02004770
  • 67A. Gausseran, F. Giroire, B. Jaumard, J. Moulierac.

    Be Scalable and Rescue My Slices During Reconfiguration, Inria - Sophia Antipolis ; I3S, Université Côte d'Azur ; Concordia University, December 2019.

    https://hal.inria.fr/hal-02416096
  • 68F. Havet, D. Mazauric, V.-H. Nguyen, R. Watrigant.

    Overlaying a hypergraph with a graph with bounded maximum degree, Inria Sophia Antipolis, February 2019, no RR-9258.

    https://hal.inria.fr/hal-02025469
  • 69A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Pérennes, T. Turletti, R. Sadykov, F. Vanderbeck, C. Lac.

    Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks, Inria Sophia Antipolis - I3S, April 2019.

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

Other Publications

References in notes
  • 81J. 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.
  • 82L. Boczkowski, E. Natale, O. Feinerman, A. Korman.

    Limits on reliable information flows through stochastic populations, in: PLOS Computational Biology, 06 2018, vol. 14, no 6, pp. 1-15.

    http://dx.doi.org/10.1371/journal.pcbi.1006195
  • 83H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, D. M. Thilikos.

    (Meta) Kernelization, in: Journal of the ACM, November 2016, vol. 63, no 5.

    https://doi.org/10.1145/2973749
  • 84F. 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.
  • 85L. X. Bui, S. Sanghavi, R. Srikant.

    Distributed Link Scheduling With Constant Overhead, in: IEEE/ACM Transactions on Networking, Oct 2009, vol. 17, no 5, pp. 1467-1480.

    http://dx.doi.org/10.1109/TNET.2009.2013621
  • 86W. Chen, J. T. Wilson, S. Tyree, K. Q. Weinberger, Y. Chen.

    Compressing Neural Networks with the Hashing Trick, in: Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37, ICML'15, JMLR.org, 2015, pp. 2285–2294.

    http://dl.acm.org/citation.cfm?id=3045118.3045361
  • 87F. Dross.

    Vertex partition of sparse graphs, Université Montpellier, June 2018.

    https://tel.archives-ouvertes.fr/tel-01882331
  • 88F. V. Fomin, D. Lokshtanov, S. Saurabh, D. M. Thilikos.

    Bidimensionality and Kernels, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, USA, SODA ’10, Society for Industrial and Applied Mathematics, 2010, pp. 503-510.

    https://epubs.siam.org/doi/abs/10.1137/1.9781611973075.43
  • 89V. Garnero, C. Paul, I. Sau, D. M. Thilikos.

    Explicit Linear Kernels via Dynamic Programming, in: SIAM J. Discrete Math., 2015, vol. 29, no 4, pp. 1864-1894.

    https://doi.org/10.1137/140968975
  • 90E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, S. Sikdar.

    Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions, in: ACM Trans. Algorithms, 2016, vol. 12, no 2, pp. 21:1-21:41.

    https://doi.org/10.1145/2797140
  • 91I. Lamprou, R. Martin, S. Schewe.

    Perpetually Dominating Large Grids, in: 10th International Conference Algorithms and Complexity (CIAC), Lecture Notes in Computer Science, 2017, vol. 10236, pp. 393–404.

    http://dx.doi.org/10.1007/978-3-319-57586-5_33
  • 92W. Lochet.

    Substructures in digraphs, Université Côte d'Azur, July 2018.

    https://hal.archives-ouvertes.fr/tel-01957030
  • 93S. Sanghavi, L. Bui, R. Srikant.

    Distributed Link Scheduling with Constant Overhead, in: SIGMETRICS Perform. Eval. Rev., June 2007, vol. 35, no 1, pp. 313–324.

    http://doi.acm.org/10.1145/1269899.1254920
  • 94C. Thomassen.

    Decompositions of highly connected graphs into paths of length 3, in: Journal of Graph Theory, 2008, vol. 58, pp. 286-292.
  • 95C. Thomassen.

    Edge-decompositions of highly connected graphs, in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2008, vol. 18, pp. 17-26.
  • 96C. Thomassen.

    Decomposing graphs into paths of fixed length, in: Combinatorica, 2013, vol. 33, no 1, pp. 97-123.