Baril Jean-Luc
Baril Jean-Luc
Professeur - Université de Bourgogne - Dijon
Verified email at u-bourgogne.fr - Homepage
Title
Cited by
Cited by
Year
Blockchain based trust & authentication for decentralized sensor networks
A Moinet, B Darties, JL Baril
arXiv preprint arXiv:1706.01730, 2017
832017
Gray code for derangements
JL Baril, V Vajnovszki
Discrete Applied Mathematics 140 (1-3), 207-221, 2004
412004
Adjacent vertex distinguishing edge-colorings of meshes and hypercubes
JL Baril, H Kheddouci, O Togni
The Australasian Journal of Combinatorics 35, 89-102, 2006
352006
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
JL Baril, JM Pallo
Information Processing Letters 100 (4), 131-136, 2006
282006
Gray code for permutations with a fixed number of cycles
JL Baril
Discrete Mathematics 307 (13), 1559-1571, 2007
242007
Minimal change list for Lucas strings and some graph theoretic consequences
JL Baril, V Vajnovszki
Theoretical computer science 346 (2-3), 189-199, 2005
222005
The irregularity strength of circulant graphs
JL Baril, H Kheddouci, O Togni
Discrete Mathematics 304 (1-3), 1-10, 2005
182005
More restrictive Gray codes for some classes of pattern avoiding permutations
JL Baril
Information Processing Letters 109 (14), 799-804, 2009
122009
ECO-generation for p-generalized Fibonacci and Lucas permutations
JL Baril, PT Do
Journal of Pure Mathematics and Applications 17 (1-2), 19-37, 2006
122006
A permutation code preserving a double Eulerian bistatistic
JL Baril, V Vajnovszki
Discrete Applied Mathematics 224, 9-15, 2017
102017
Motzkin subposets and Motzkin geodesics in Tamari lattices
JL Baril, JM Pallo
Information Processing Letters 114 (1-2), 31-37, 2014
102014
Classical sequences revisited with permutations avoiding dotted pattern
JL Baril
the electronic journal of combinatorics, P178-P178, 2011
102011
Whole mirror duplication-random loss model and pattern avoiding permutations
JL Baril, R Vernay
Information Processing Letters 110 (11), 474-480, 2010
102010
Statistics-preserving bijections between classical and cyclic permutations
JL Baril
Information Processing Letters 113 (1-2), 17-22, 2013
82013
Vertex Distinguishing Edge-and Total-Colorings of Cartesian and other Product Graphs.
JL Baril, H Kheddouci, O Togni
Ars Comb. 107, 109-127, 2012
82012
The phagocyte lattice of Dyck words
JL Baril, JM Pallo
Order 23 (2-3), 97-107, 2006
72006
Dyck paths with a first return decomposition constrained by height
JL Baril, S Kirgizov, A Petrossian
Discrete Mathematics 341 (6), 1620-1628, 2018
62018
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks
A Moinet, B Darties, N Gastineau, JL Baril, O Togni
2017 IEEE 13th International Conference on Wireless and Mobile Computing …, 2017
62017
Avoiding patterns in irreducible permutations
JL Baril
Discrete Mathematics & Theoretical Computer Science 17, 2016
62016
Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two.
JL Baril, A Petrossian
J. Integer Seq. 18 (7), 15.7.1, 2015
62015
The system can't perform the operation now. Try again later.
Articles 1–20