BibTeX records: Julien Bensmail

download as .bib file

@article{DBLP:journals/ajc/BensmailB18,
  author    = {Julien Bensmail and
               Nick Brettell},
  title     = {Orienting edges to fight fire in graphs},
  journal   = {Australasian J. Combinatorics},
  volume    = {71},
  pages     = {12--42},
  year      = {2018},
  url       = {http://ajc.maths.uq.edu.au/pdf/71/ajc\_v71\_p012.pdf},
  timestamp = {Tue, 27 Mar 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ajc/BensmailB18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BensmailHL18,
  author    = {Julien Bensmail and
               Ararat Harutyunyan and
               Ngoc{-}Khang Le},
  title     = {List coloring digraphs},
  journal   = {Journal of Graph Theory},
  volume    = {87},
  number    = {4},
  pages     = {492--508},
  year      = {2018},
  url       = {https://doi.org/10.1002/jgt.22170},
  doi       = {10.1002/jgt.22170},
  timestamp = {Wed, 01 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jgt/BensmailHL18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BensmailHLLL17,
  author    = {Julien Bensmail and
               Ararat Harutyunyan and
               Ngoc{-}Khang Le and
               Binlong Li and
               Nicolas Lichiardopol},
  title     = {Disjoint Cycles of Different Lengths in Graphs and Digraphs},
  journal   = {Electr. J. Comb.},
  volume    = {24},
  number    = {4},
  pages     = {P4.37},
  year      = {2017},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p37},
  timestamp = {Wed, 01 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/combinatorics/BensmailHLLL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BarmeBPW17,
  author    = {Emma Barme and
               Julien Bensmail and
               Jakub Przybylo and
               Mariusz Wozniak},
  title     = {On a directed variation of the 1-2-3 and 1-2 Conjectures},
  journal   = {Discrete Applied Mathematics},
  volume    = {217},
  pages     = {123--131},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.dam.2016.08.013},
  doi       = {10.1016/j.dam.2016.08.013},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/BarmeBPW17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BensmailNS17,
  author    = {Julien Bensmail and
               Soumen Nandi and
               Sagnik Sen},
  title     = {On oriented cliques with respect to push operation},
  journal   = {Discrete Applied Mathematics},
  volume    = {232},
  pages     = {50--63},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.dam.2017.07.037},
  doi       = {10.1016/j.dam.2017.07.037},
  timestamp = {Wed, 18 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/BensmailNS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BaudonBFP17,
  author    = {Olivier Baudon and
               Julien Bensmail and
               Florent Foucaud and
               Monika Pilsniak},
  title     = {Structural properties of recursively partitionable graphs with connectivity
               2},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {37},
  number    = {1},
  pages     = {89--115},
  year      = {2017},
  url       = {https://doi.org/10.7151/dmgt.1925},
  doi       = {10.7151/dmgt.1925},
  timestamp = {Wed, 20 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/BaudonBFP17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Bensmail17,
  author    = {Julien Bensmail},
  title     = {On \emph{q}-power cycles in cubic graphs},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {37},
  number    = {1},
  pages     = {211--220},
  year      = {2017},
  url       = {https://doi.org/10.7151/dmgt.1926},
  doi       = {10.7151/dmgt.1926},
  timestamp = {Wed, 20 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/Bensmail17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BensmailSL17,
  author    = {Julien Bensmail and
               Mohammed Senhaji and
               Kasper Szabo Lyngsie},
  title     = {On a combination of the 1-2-3 Conjecture and the Antimagic Labelling
               Conjecture},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {19},
  number    = {1},
  year      = {2017},
  url       = {http://dmtcs.episciences.org/3849},
  timestamp = {Mon, 21 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BensmailSL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BensmailMT17,
  author    = {Julien Bensmail and
               Martin Merker and
               Carsten Thomassen},
  title     = {Decomposing graphs into a constant number of locally irregular subgraphs},
  journal   = {Eur. J. Comb.},
  volume    = {60},
  pages     = {124--134},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ejc.2016.09.011},
  doi       = {10.1016/j.ejc.2016.09.011},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/BensmailMT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BensmailGNSW17,
  author    = {Julien Bensmail and
               Valentin Garnero and
               Nicolas Nisse and
               Alexandre Salch and
               Valentin Weber},
  title     = {Recovery of disrupted airline operations using k-Maximum Matching
               in graphs},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {62},
  pages     = {3--8},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.endm.2017.10.002},
  doi       = {10.1016/j.endm.2017.10.002},
  timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/endm/BensmailGNSW17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BensmailDS17,
  author    = {Julien Bensmail and
               Christopher Duffy and
               Sagnik Sen},
  title     = {Analogues of Cliques for (m, n)-Colored Mixed Graphs},
  journal   = {Graphs and Combinatorics},
  volume    = {33},
  number    = {4},
  pages     = {735--750},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00373-017-1807-2},
  doi       = {10.1007/s00373-017-1807-2},
  timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/BensmailDS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BensmailHLMT17,
  author    = {Julien Bensmail and
               Ararat Harutyunyan and
               Tien{-}Nam Le and
               Martin Merker and
               St{\'{e}}phan Thomass{\'{e}}},
  title     = {A proof of the Bar{\'{a}}t-Thomassen conjecture},
  journal   = {J. Comb. Theory, Ser. {B}},
  volume    = {124},
  pages     = {39--55},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.jctb.2016.12.006},
  doi       = {10.1016/j.jctb.2016.12.006},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jct/BensmailHLMT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bensmail16,
  author    = {Julien Bensmail},
  title     = {On three polynomial kernels of sequences for arbitrarily partitionable
               graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {202},
  pages     = {19--29},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.dam.2015.08.016},
  doi       = {10.1016/j.dam.2015.08.016},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/Bensmail16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BensmailLV16,
  author    = {Julien Bensmail and
               Aur{\'{e}}lie Lagoutte and
               Petru Valicov},
  title     = {Strong edge-coloring of (3, {\(\Delta\)})-bipartite graphs},
  journal   = {Discrete Mathematics},
  volume    = {339},
  number    = {1},
  pages     = {391--398},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.disc.2015.08.026},
  doi       = {10.1016/j.disc.2015.08.026},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/BensmailLV16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BensmailDK16,
  author    = {Julien Bensmail and
               Romaric Duvignau and
               Sergey Kirgizov},
  title     = {The complexity of deciding whether a graph admits an orientation with
               fixed weak diameter},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {17},
  number    = {3},
  pages     = {31--42},
  year      = {2016},
  url       = {http://dmtcs.episciences.org/2161},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BensmailDK16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BensmailS16,
  author    = {Julien Bensmail and
               Brett Stevens},
  title     = {Edge-partitioning graphs into regular and locally irregular components},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {17},
  number    = {3},
  pages     = {43--58},
  year      = {2016},
  url       = {http://dmtcs.episciences.org/2154},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BensmailS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BensmailR16,
  author    = {Julien Bensmail and
               Gabriel Renault},
  title     = {Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs},
  journal   = {Graphs and Combinatorics},
  volume    = {32},
  number    = {5},
  pages     = {1707--1721},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00373-016-1705-z},
  doi       = {10.1007/s00373-016-1705-z},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/BensmailR16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BaudonBS15,
  author    = {Olivier Baudon and
               Julien Bensmail and
               {\'{E}}ric Sopena},
  title     = {An oriented version of the 1-2-3 Conjecture},
  journal   = {Discussiones Mathematicae Graph Theory},
  volume    = {35},
  number    = {1},
  pages     = {141--156},
  year      = {2015},
  url       = {https://doi.org/10.7151/dmgt.1791},
  doi       = {10.7151/dmgt.1791},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmgt/BaudonBS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BaudonBPW15,
  author    = {Olivier Baudon and
               Julien Bensmail and
               Jakub Przybylo and
               Mariusz Wozniak},
  title     = {On decomposing regular graphs into locally irregular subgraphs},
  journal   = {Eur. J. Comb.},
  volume    = {49},
  pages     = {90--104},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.ejc.2015.02.031},
  doi       = {10.1016/j.ejc.2015.02.031},
  timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/BaudonBPW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BensmailBH15,
  author    = {Julien Bensmail and
               Marthe Bonamy and
               Herv{\'{e}} Hocquard},
  title     = {Strong edge coloring sparse graphs},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {49},
  pages     = {773--778},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.endm.2015.06.104},
  doi       = {10.1016/j.endm.2015.06.104},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/BensmailBH15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bensmail15,
  author    = {Julien Bensmail},
  title     = {On the complexity of partitioning a graph into a few connected subgraphs},
  journal   = {J. Comb. Optim.},
  volume    = {30},
  number    = {1},
  pages     = {174--187},
  year      = {2015},
  url       = {https://doi.org/10.1007/s10878-013-9642-8},
  doi       = {10.1007/s10878-013-9642-8},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jco/Bensmail15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BaudonBS15,
  author    = {Olivier Baudon and
               Julien Bensmail and
               {\'{E}}ric Sopena},
  title     = {On the complexity of determining the irregular chromatic index of
               a graph},
  journal   = {J. Discrete Algorithms},
  volume    = {30},
  pages     = {113--127},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.jda.2014.12.008},
  doi       = {10.1016/j.jda.2014.12.008},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jda/BaudonBS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailB15,
  author    = {Julien Bensmail and
               Nick Brettell},
  title     = {Orienting edges to fight fire in graphs},
  journal   = {CoRR},
  volume    = {abs/1506.07338},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.07338},
  archivePrefix = {arXiv},
  eprint    = {1506.07338},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BensmailB15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailNS15,
  author    = {Julien Bensmail and
               Soumen Nandi and
               Sagnik Sen},
  title     = {On oriented cliques with respect to push operation},
  journal   = {CoRR},
  volume    = {abs/1511.08672},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.08672},
  archivePrefix = {arXiv},
  eprint    = {1511.08672},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BensmailNS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BensmailHHV14,
  author    = {Julien Bensmail and
               Ararat Harutyunyan and
               Herv{\'{e}} Hocquard and
               Petru Valicov},
  title     = {Strong edge-colouring of sparse planar graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {179},
  pages     = {229--234},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.dam.2014.07.006},
  doi       = {10.1016/j.dam.2014.07.006},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/BensmailHHV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BaudonBKMPW14,
  author    = {Olivier Baudon and
               Julien Bensmail and
               Rafal Kalinowski and
               Antoni Marczyk and
               Jakub Przybylo and
               Mariusz Wozniak},
  title     = {On the Cartesian product of of an arbitrarily partitionable graph
               and a traceable graph},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {16},
  number    = {1},
  pages     = {225--232},
  year      = {2014},
  url       = {http://dmtcs.episciences.org/1259},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BaudonBKMPW14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BaudonBS14,
  author    = {Olivier Baudon and
               Julien Bensmail and
               {\'{E}}ric Sopena},
  title     = {Partitioning Harary graphs into connected subgraphs containing prescribed
               vertices},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {16},
  number    = {3},
  pages     = {263--278},
  year      = {2014},
  url       = {http://dmtcs.episciences.org/641},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BaudonBS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaudonBPW14,
  author    = {Olivier Baudon and
               Julien Bensmail and
               Jakub Przybylo and
               Mariusz Wozniak},
  title     = {Partitioning powers of traceable or hamiltonian graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {520},
  pages     = {133--137},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.tcs.2013.10.016},
  doi       = {10.1016/j.tcs.2013.10.016},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/BaudonBPW14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailHHV14,
  author    = {Julien Bensmail and
               Ararat Harutyunyan and
               Herv{\'{e}} Hocquard and
               Petru Valicov},
  title     = {Strong edge-colouring of sparse planar graphs},
  journal   = {CoRR},
  volume    = {abs/1401.4568},
  year      = {2014},
  url       = {http://arxiv.org/abs/1401.4568},
  archivePrefix = {arXiv},
  eprint    = {1401.4568},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BensmailHHV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailDS14,
  author    = {Julien Bensmail and
               Christopher Duffy and
               Sagnik Sen},
  title     = {On cliques of signed and switchable signed graphs},
  journal   = {CoRR},
  volume    = {abs/1411.7376},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.7376},
  archivePrefix = {arXiv},
  eprint    = {1411.7376},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BensmailDS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BensmailLV14,
  author    = {Julien Bensmail and
               Aur{\'{e}}lie Lagoutte and
               Petru Valicov},
  title     = {Strong edge-coloring of {\textdollar}(3, {\(\Delta\)}){\textdollar}-bipartite
               graphs},
  journal   = {CoRR},
  volume    = {abs/1412.2624},
  year      = {2014},
  url       = {http://arxiv.org/abs/1412.2624},
  archivePrefix = {arXiv},
  eprint    = {1412.2624},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BensmailLV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier