Publications of Julien Bensmail

BACK TO COATI PUBLICATION INDEX

Publications of Julien Bensmail

Articles in journal or book's chapters
  1. Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Eric Sopena, and Mariusz Wozniak. A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discrete Mathematics and Theoretical Computer Science, vol. 21 no. 1, ICGT 2018, April 2019. [WWW ] [PDF ]
    Keywords: Coloured weighted degrees, 1-2-3 Conjecture, Locally irregular decompositions. [bibtex-entry]
     
  2. Julien Bensmail. A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs. Discrete Applied Mathematics, 257:31-39, February 2019. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, 5-regular graphs, four weights. [bibtex-entry]
     
  3. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, and Eric Sopena. On locally irregular decompositions of subcubic graphs. Opuscula Mathematica, 38(6):795-817, July 2018. [WWW ] [PDF ] [bibtex-entry]
     
  4. Olivier Baudon, Julien Bensmail, Jakub Przybylo, and Mariusz Wozniak. On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discrete Mathematics and Theoretical Computer Science, vol. 20 no. 2, October 2018. [WWW ] [PDF ]
    Keywords: 1-2 Conjecture, locally irregular decompositions, digraphs. [bibtex-entry]
     
  5. Olivier Baudon, Julien Bensmail, Mohammed Senhaji, and Eric Sopena. Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture. Discrete Applied Mathematics, 251(83-92), November 2018. [WWW ] [PDF ]
    Keywords: Bipartite graphs, 1-2-3 Conjecture, Difference-2 distinction. [bibtex-entry]
     
  6. Julien Bensmail and Nick Brettell. Orienting edges to fight fire in graphs. The Australasian Journal of Combinatorics, 71(1):12-42, March 2018. [WWW ] [PDF ] [bibtex-entry]
     
  7. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Discrete Applied Mathematics, 250(11):110-129, 2018. [WWW ] [PDF ]
    Keywords: trees, maximum matchings, bounded-length augmentations. [bibtex-entry]
     
  8. Julien Bensmail, Ararat Harutyunyan, and Ngoc Khang Le. List coloring digraphs. Journal of Graph Theory, 87(4):492-508, April 2018. [WWW ] [PDF ]
    Keywords: dichromatic number, list dichromatic number, list coloring, digraphs. [bibtex-entry]
     
  9. Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, and Stéphan Thomassé. Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Combinatorica, 2018. [WWW ] [PDF ] [bibtex-entry]
     
  10. Emma Barme, Julien Bensmail, Jakub Przybylo, and Mariusz Wozniak. On a directed variation of the 1-2-3 and 1-2 Conjectures. Discrete Applied Mathematics, 217(2):123-131, January 2017. [WWW ] [PDF ] [bibtex-entry]
     
  11. Olivier Baudon, Julien Bensmail, Florent Foucaud, and Monika Pilsniak. Structural properties of recursively partitionable graphs with connectivity 2. Discussiones Mathematicae Graph Theory, 37:89-115, February 2017. [WWW ] [PDF ]
    Keywords: balloon graph, graph with connectivity 2, online arbitrarily partitionable graph, recursively arbitrarily partitionable graph, balloon, structural properties. [bibtex-entry]
     
  12. Julien Bensmail. On q-power cycles in cubic graphs. Discussiones Mathematicae Graph Theory, 37(1):211 - 220, 2017. [WWW ] [PDF ] [bibtex-entry]
     
  13. Julien Bensmail, Christopher Duffy, and Sagnik Sen. Analogues of Cliques for (m,n)-colored Mixed Graphs. Graphs and Combinatorics, 33(4):735--750, May 2017. [WWW ] [PDF ]
    Keywords: graph homomorphisms, planar graphs, colored mixed graphs, signed graphs, graph homomorphism, chromatic number, clique number. [bibtex-entry]
     
  14. Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le, Binlong Li, and Nicolas Lichiardopol. Disjoint cycles of different lengths in graphs and digraphs. The Electronic Journal of Combinatorics, 24(4), December 2017. [WWW ] [PDF ]
    Keywords: minimum degree, vertex-disjoint cycles, different lengths. [bibtex-entry]
     
  15. Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, and Stéphan Thomassé. A Proof of the Barát--Thomassen Conjecture. Journal of Combinatorial Theory, Series B, 124:39 - 55, May 2017. [WWW ] [PDF ]
    Keywords: large edge-connectivity, Barát-Thomassen Conjecture, tree-decomposition. [bibtex-entry]
     
  16. Julien Bensmail, Martin Merker, and Carsten Thomassen. Decomposing graphs into a constant number of locally irregular subgraphs. European Journal of Combinatorics, 60:124 - 134, February 2017. [WWW ] [PDF ] [bibtex-entry]
     
  17. Julien Bensmail, Soumen Nandi, and Sagnik Sen. On oriented cliques with respect to push operation. Discrete Applied Mathematics, 232:50 - 63, December 2017. [WWW ] [PDF ]
    Keywords: oriented graphs, oriented cliques, push operation, planar graphs. [bibtex-entry]
     
  18. Julien Bensmail, Mohammed Senhaji, and Kasper Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discrete Mathematics and Theoretical Computer Science, 19(1), August 2017. [WWW ] [PDF ]
    Keywords: equitable edge-weightings, 1-2-3 Conjecture, Antimagic Labelling Conjecture. [bibtex-entry]
     
  19. Julien Bensmail, Mohammed Senhaji, and Kasper Szabo Lyngsie. On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. Discrete Mathematics and Theoretical Computer Science, 19(1), August 2017. [WWW ] [PDF ]
    Keywords: equitable edge-weightings, 1-2-3 Conjecture, Antimagic Labelling Conjecture. [bibtex-entry]
     
Conference's articles
  1. Julien Bensmail, Fionn Mc Inerney, and Nicolas 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. [WWW ] [PDF ]
    Keywords: Graphes, Dimension Métrique, Ensembles Resolvants, Orientations fortement connexes. [bibtex-entry]
     
  2. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. In 10th Latin & American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brazil, June 2019. [WWW ] [PDF ]
    Keywords: Resolving sets, Metric dimension, Strongly-connected orientations. [bibtex-entry]
     
  3. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. In 16th Workshop on Approximation and Online Algorithms (WAOA 2018), Helsinki, Finland, August 2018. [WWW ] [PDF ]
    Keywords: metric dimension, Games in graphs, complexity. [bibtex-entry]
     
  4. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane 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. [WWW ] [PDF ]
    Keywords: Mots-clefs : Graphes, Dimension Métrique, Dimension Centro¨idaleCentro¨idale, Jeux dans les graphes. [bibtex-entry]
     
  5. Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, and Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in graphs. In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 62 of Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)), Marseille, France, pages 3-8, September 2017. [WWW ] [PDF ]
    Keywords: Graph, Matching, Augmenting paths, Complexity, Trees. [bibtex-entry]
     
  6. Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch, and Valentin Weber. Recovery of disrupted airline operations using k-Maximum Matching in graphs. In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Marseille, France, September 2017. [WWW ] [PDF ]
    Keywords: Graph, Matching, Augmenting paths, Complexity, Trees. [bibtex-entry]
     
Internal reports
  1. Julien Bensmail, François Dross, Hervé Hocquard, and Eric Sopena. From light edges to strong edge-colouring of 1-planar graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Inria & Labri, Univ. Bordeaux, April 2019. [WWW ] [PDF ]
    Keywords: strong edge-colouring, strong chromatic index, 1-planar graphs, light edges. [bibtex-entry]
     
  2. Julien Bensmail, François Dross, and Nicolas Nisse. Decomposing degenerate graphs into locally irregular subgraphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2019. [WWW ] [PDF ]
    Keywords: locally irregular decompositions, degenerate graphs, cacti, k-trees, planar graphs. [bibtex-entry]
     
  3. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. Research Report, Inria, 2018. [WWW ] [PDF ]
    Keywords: complexity, Metric dimension, Games in graphs. [bibtex-entry]
     
  4. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, November 2018. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Metric dimension, Resolving sets. [bibtex-entry]
     
  5. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Research Report, Université Côte d'Azur, July 2017. [WWW ] [PDF ]
    Keywords: trees, bounded-length augmentations, maximum matchings. [bibtex-entry]
     
  6. Julien Bensmail, Valentin Garnero, and Nicolas Nisse. On improving matchings in trees, via bounded-length augmentations. Research Report, Université Côte d'Azur, July 2017. [WWW ] [PDF ]
    Keywords: trees, bounded-length augmentations, maximum matchings. [bibtex-entry]
     
  7. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, and Eric Sopena. On locally irregular decompositions of subcubic graphs. Research Report, Université de bordeaux ; Université de Nice - Sophia Antipolis, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  8. Olivier Baudon, Julien Bensmail, Jakub Przybylo, and Mariusz Wozniak. On locally irregular decompositions and the 1-2 Conjecture in digraphs. Research Report, Inria, CNRS, Université de Bordeaux, AGH University, September 2016. [WWW ] [PDF ] [bibtex-entry]
     
Miscellaneous
  1. Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, and Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ] [bibtex-entry]
     
  2. Julien Bensmail, Fionn Mc Inerney, and Kasper Lyngsie. On a,b-edge-weightings of bipartite graphs with odd a,b.
    Note: Working paper or preprint, January 2019. [WWW ] [PDF ] [bibtex-entry]
     
  3. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, and Eric Sopena. Edge Weights and Vertex Colours: Minimizing Sum Count.
    Note: Working paper or preprint, July 2018. [WWW ] [PDF ] [bibtex-entry]
     
  4. Julien Bensmail and Binlong Li. More Aspects of Arbitrarily Partitionable Graphs.
    Note: Working paper or preprint, November 2018. [WWW ] [PDF ]
    Keywords: arbitrarily partitionable graphs, partition into connected subgraphs, Hamiltonicity. [bibtex-entry]
     
  5. Julien Bensmail, Soumen Nandi, Mithun Roy, and Sagnik Sen. On homomorphisms of planar signed graphs and absolute cliques.
    Note: Working paper or preprint, November 2018. [WWW ] [PDF ]
    Keywords: absolute signed cliques, planar graphs, graph homomorphisms, signed graphs. [bibtex-entry]
     
  6. Olivier Baudon, Julien Bensmail, Mohammed Senhaji, and Eric Sopena. Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture.
    Note: Working paper or preprint, May 2017. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, Difference-2 distinction, Bipartite graphs. [bibtex-entry]
     
  7. Julien Bensmail. A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs.
    Note: Working paper or preprint, April 2017. [WWW ] [PDF ]
    Keywords: 1-2-3 Conjecture, four weights, 5-regular graphs. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Wed Oct 9 16:05:43 2019