$Description : Description : Description : Description : Description : Description : Description : C:\Users\baril\Desktop\bar3_anm.gif$

jl.baril.u-bourgogne.fr

$Description : Description : Description : Description : Description : Description : Description : C:\Users\baril\Desktop\bar3_anm.gif$

Revues internationales (50)

J.-L. Baril, J.-M. Pallo, Matchings in three Catalan lattices, Intern. J. Computer Math., 2003, Vol. 80(2), pp. 193-200, pdf
J.-L. Baril, Gray code for Cayley permutations, Computer Science Journal of M., 2003, Vol.11 (2), pp. 124-136, pdf
J.-L. Baril, V. Vajnovszki, Gray Code for Derangements, Discrete Applied Mathematics, 2004, Vol. 140 (1-3), pp. 207-221, pdf
J.-L. Baril, V. Vajnovszki, Minimal change list for Lucas Strings and some graph theoritic consequences, Theoretical Computer Science, A dedicated to Alberto Del Lungo, 2005, Vol. 346 (2-3), pp. 189-199, pdf
J.-L. Baril, H. Kheddouci and O. Togni, Irregularity strength of circulant graphs, Discrete Mathematics, 2005, Vol. 304 (1-3), pp. 1-10, pdf
J.-L. Baril, H. Kheddouci and O. Togni, Adjacent vertex distinguishing edge-colorings of meshes and hypercubes, Australasian Journal of Combinatorics, 2006, Vol. 35, pp. 89-102, pdf
J.-L. Baril, J.-M. Pallo, The Phagocyte Lattice of Dyck Words, Order, 2006, Vol 23(2-3), pp. 97-107, pdf
J.-L. Baril, J.-M. Pallo, Efficient lower and upper bounds of the diagonal-flip distance between triangulations, Information Processing Letters, 2006, Vol. 100, pp. 131-136, pdf
J.-L. Baril, Gray code for permutations with a fixed number of cycles, Discrete Mathematics, 2007, Vol. 307, pp. 1559-1571, pdf
J.-L. Baril,, Hamiltonian paths for involutions in the square of a Cayley graph, Journal of Discrete Mathematical Sciences & Cryptography, 2007, Vol. 10(2), pdf
J.-L. Baril, P.-T. Do, ECO-generation for p-generalized Fibonacci and Lucas permutations, Journal of Pure Mathematics and Applications, 2006, Vol. 17(1-2), pp. 19-37, pdf
J.-L. Baril, J.-M. Pallo, The pruning-grafting lattice of binary trees, Theoretical Computer Science, 2008, Vol. 409(3), pp. 382-293, pdf
J.-L. Baril, C. Moreira Dos Santos, Gray code for compositions of n with parts 1 and p, Advances and Applications in Discrete Mathematics, 2009, Vol. 3(1), pp. 67-84, pdf
J.-L. Baril, More restrictive Gray codes for some classes of pattern avoiding permutations, Information Processing Letters, 2009, Vol. 109, pp. 799–804, pdf
J.-L. Baril, O. Togni, Neighbor-distinguishing k-tuple edge-colorings of graphs, Discrete Mathematics, 2009, Vol. 309(16), pp. 5147-5157, pdf
J.-L. Baril, Efficient generating algorithm for permutations with a fixed number of excedances, Pure Mathematics and Applications/Algebra and Theoretical Computer Science, 2009, Vol 19(3-4), pp. 61-70, pdf.
J.-L. Baril, R. Vernay, Whole mirror duplication-random loss model and pattern avoiding permutations, Information Processing Letters, 2010, Vol. 110, pp. 474-480, pdf
J.-L. Baril, Cyclic and lift closures for k...21-avoiding permutations, Discrete Mathematics, 2011, Vol. 311, pp. 51-57, pdf
J.-L. Baril, Classical sequences revisited with permutations avoiding dotted pattern, Electronic journal of combinatorics, 2011, Vol. 18, P#178, pdf
J.-L. Baril, H. Kheddouci and O. Togni, Vertex distinguishing edge- and total-colorings of cartesian and other product graphs, Ars Combinatoria, Vol. CVII, October, pp. 109-127, 2012, pdf
J.-L. Baril, P.-T. Do, ECO-generation for some restricted classes of compositions, Computer science Journal of M., 2013, Vol. 21, 1(61), pdf.
J.-L. Baril, Statistics-preserving bijections between classical and cyclic permutations, Information Processing Letters, 2013, Vol. 113, pp. 17-22, pdf
J.-L. Baril, Gray code for permutations with a fixed number of left-to-right minima., Ars Combinatoria, 2013, Vol. CXI, pp. 225-239, pdf
J.-L. Baril, J.-M. Pallo, Motzkin subposets and Motzkin geodesics in Tamari lattices, Information Processing Letters, 2014, Vol. 114, pp. 31-37, pdf
J.-L. Baril, T. Mansour, A. Petrossian, Equivalence classes of permutations modulo excedances, Journal of combinatorics, 2014, Vol. 5(4), pp. 453-469, pdf
J.-L. Baril, A. Petrossian, Equivalence classes of Dyck paths modulo some statistics, Discrete Mathematics, 2015, Vol. 338(4), pp. 655-660, pdf
J.-L. Baril, J.-M. Pallo, A Motzkin filter in the Tamari lattice, Discrete mathematics, 2015, Vol. 338, pp. 1370-1378, pdf.
J.-L. Baril, A. Petrossian, Equivalence classes of permutations modulo descents and left-to-right maxima, Pure Mathematics and Applications, 2015, Vol. 25(1), pp. 19-29, pdf.
J.-L. Baril, A. Petrossian, Equivalence classes of Motzkin paths modulo a pattern of length at most two, Journal of Integer Sequences, 2015, Vol. 18, Article 15.7.1, pdf.
J.-L. Baril, R. Genestier, A. Giorgetti, A. Petrossian, Rooted planar maps modulo some patterns, Discrete Mathematics, 2016, Vol. 339, pp. 1199-1205, pdf.
J.-L. Baril, Avoiding patterns in irreducible permutations, Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17(3), pdf.
C. Banderier, J.-L. Baril, C. Moreira Dos Santos, Right-jumps and pattern avoiding permutations, Discrete Mathematics and Theoretical Computer Science, 2017, Vol. 18(2), pdf.
J.-L. Baril, V. Vajnovszki, A permutation code preserving a double Eulerian bistatistic, Discrete Applied Mathematics, 2016, Vol. 224, pp. 9-15, pdf.
J.-L. Baril, S. Kirgizov, Pure descent statistic on permutations, Discrete mathematics, 2017, Vol. 340(10), pp. 2550-2558, pdf.
J.-L. Baril, S. Kirgizov, V. Vajnovszki, Patterns in treeshelves, Discrete mathematics, 2017, Vol. 340(12), pp. 2946-2954, pdf.
J.-L. Baril, S. Kirgizov, A. Petrossian, Forests and pattern avoiding permutations modulo pure descents, Pure Mathematics and Applications, 2018, Vol. 27(1), pp. 18-31, pdf.
J.-L. Baril, S. Kirgizov, A. Petrossian, Dyck paths with a first return decomposition constrained by height, Discrete Mathematics, 2018, Vol. 341(6), pp. 1620-1628, pdf.
J.-L. Baril, S. Kirgizov, V. Vajnovszki, Descent distribution on Catalan words avoiding a pattern of length at most three, Discrete Mathematics, 2018, Vol. 341(9), pp. 2608-2615, pdf
L. Morlet, C. Gentil, S. Lanquetin, M. Neveu, J.-L. Baril, Representation of Nurbs surfaces by controlled iterated functions system automata, Computer & Graphic: X, 2019, Vol. 2, pdf
J.-L. Baril, S. Kirgizov, A. Petrossian, Enumeration of Lukasiewicz paths modulo some patterns, Discrete Mathematics, 2019, Vol. 342(4), pp. 997-1005, pdf
J.-L. Baril, C. Moreira, Pizza-cutter’s problem and Hamiltonian path, Mathematics Magazine, 2019, Vol. 92(5), pp. 359-367, pdf
J.-L. Baril, S. Kirgizov, A. Petrossian, Motzkin paths with a restricted first return decomposition, Integers: Electronic Journal of Combinatorial Number Theory, 2019, Vol. 19, #A46, pdf
J.-L. Baril, V. Vajnovszki, Popularity of patterns over d-equivalence classes of words and permutations, Theoretical Computer Science, 2020, Vol. 814, pp. 249-258, pdf
J.-L. Baril, D. Bevan, S. Kirgizov, Bijections between directed animals, multisets and Grand-Dyck paths, The Electronic Journal of Combinatorics, 2020, Vol. 27(2), #P2.10, pdf
J.-L. Baril, R. Genestier, S. Kirgizov, Pattern distribution in Dyck paths with a first return decomposition constrained by height, Discrete Mathematics, 2020, Vol. 343(9), pdf
J.-L. Baril, S. Kirgizov, Transformation à la Foata for special kinds of descents and excedances, Enumerative Combinatorics and Applications, 2021, Vol. 1(3), #S2R19, pdf
J.-L. Baril, G. Cerbai, C. Khalil, V. Vajnovszki, Catalan and Schröder permutations sortable by two restricted stacks, Information Processing Letters, to appear, 2021, pdf
J.-L. Baril, C. Khalil, V. Vajnovszki, Catalan words avoiding pairs of length three patterns, Discrete Mathematics and Theoretical Computer Science, 2021, Vol. 22(2), pdf
J.-L. Baril, S. Kirgizov, Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths, Discrete Mathematics Letters, 2021, Vol. 7, pp. 5-10, pdf
J.-L. Baril, A. Burstein, S. Kirgizov, Pattern distribution in faro words and permutations, Discrete Mathematics, To appear, 2021, pdf

--------------------------- Submitted papers (1) -----------------------------------------------------------

J.-L. Baril, S. Kirgizov, V. Vajnovszki, Gray codes for Fibonacci q-decreasing words, 2020 , pdf

--------------------------- Papers without referring (2) -----------------------------------------------------------

A. Moinet, B. Darties, J.-L. Baril, Blockchain based trust & authentication for decentralized sensor networks, 2017, pdf
A. Moinet, B. Darties, J.-L. Baril, Architecture of a smart contract based authentication and trust system for Wireless Sensor Networks, Submitted IEEE, 2017

--------------------------- Papers in progress (2) -----------------------------------------------------------

J.-L. Baril, S. Kirgizov, Equivalence modulo ……., in progress, 2021

--------------------------------------------------------------------------------------

Conférences internationales (23)

J.-L. Baril, V. Vajnovszki, Gray codes for order p Lucas strings, in Proceedings of the 4th International Conference on Combinatorics on Words, September 2003, Turku, Finland (ed. Tero Harju and Juhani Karhumaki), pp. 149-158. TUCS General Publication, No 27, August 2003, pdf
J.-L. Baril, P.-T. Do, Generalized Fibonacci permutations generation by the ECO method, Conference on Combinatorics, Automata and Number Theory, Liège, 8-19 May 2006 pdf
J.-L. Baril, P.-T. Do, ECO generation for Fibonacci and Lucas permutations, Gascom'06, Dijon, 12-15 September 2006, pdf
J.-L. Baril, Gray code for permutations with exactly k-cycles, Gascom'06, Dijon, 12-15 September 2006, pdf
J.-L. Baril, A CAT algorithm for generating permutations with a fixed number of excedances, Gascom'08, Dedicated to Jean-Guy Penaud on the occasion of his 65th birthday, Bibbiena, 16-20 june 2008, Italy, pdf
J.-L. Baril, H. Kheddouci and O. Togni, VD-colorings of product graphs , Gascom'08, Dedicated to Jean-Guy Penaud on the occasion of his 65th birthday, Bibbiena, 16-20 june 2008, Italy, pdf
J.-L. Baril, C. Moreira Dos Santos, More restrictive Gray code for (1,p)-compositions and relatives, Journées Montoises d'Informatique Théorique, UMH, Université de Mons-Hainaut, Belgique, 28 aout 2008, pdf
J.-L. Baril, P.-T. Do, ECO generation for compositions and their restrictions, Permutation patterns, University of Otago, New Zealand, 16 - 20 June, 2008.
J.-L. Baril, P.-T. Do, Efficient generating algorithms for some combinatorial object classes. Combinatorics and Statistical Mechanics, Erwin Schrödinger International Institute for Mathematical Physics, Vienna, Austria, 7-18/07/2008
J.-L. Baril, R. Vernay, Whole mirror duplication-random loss model and pattern avoiding permutations, Permutation patterns, University of Firenze, Italy, 13 - 17 July, 2009.
J.-L. Baril, A. Petrossian, Equivalence classes of Dyck paths modulo some statistics, 9th International colloquium on graph theory and combinatorics, Grenoble, France, June 30-July 4, 2014, pdf.
J.-L. Baril, A. Petrossian, Equivalence classes of permutations modulo descents and left-to-right maxima, GASCom, 9th Edition, Bertinoro, Italie, June 23-25, 2014.
J.-L. Baril, A. Petrossian, Permutations avoiding generalized patterns modulo left-to-right maxima, Permutation patterns, London, 15 - 19 June, 2015, pdf.
C. Banderier, J.-L. Baril, C. Moreira Dos Santos, Random deletion-right insertion and pattern avoiding permutations, Permutation patterns, London, 15 - 19 June, 2015, pdf.
C. Banderier, J.-L. Baril, C. Moreira Dos Santos, Some unusual asymptotics for a variant of insertion sort, 26th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Strobl, Austria, 8 - 12 June, 2015.
J.-L. Baril, S. Kirgizov, A. Petrossian, Forests and pattern avoiding permutations modulo pure descents, Pattern Permutation, Reykjavik University, Iceland, June 26-30, 2017.
J.-L. Baril, B. Darties, N. Gastineau, A. Moinet, O. Togni, Completely independent spanning trees for enhancing the robustness in ad-hoc networks, STWiMob, Rome, October 9-11, 2017.
J.-L. Baril, B. Darties, A. Moinet, De l’existence d’arbres couvrants complètement disjoints dans les réseaux sans fil, 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Algotel’18, May 2018, Roscoff, France.
L. Morlet, C. Gentil, S. Lanquetin, M. Neveu, J.-L. Baril, Representation of Nurbs surfaces by controlled iterated functions system automata, Shape Modeling International, SMI’19, June 2019, Vancouver, Canada.
J.-L. Baril, C. Khalil, V. Vajnovszki, Catalan words avoiding pairs of length three patterns, Permutation Pattern, Zurich, Switzerland, June 17-21, 2019
J.-L. Baril, V. Vajnovszki, Equipopularity of descent-equivalent patterns over descent-equivalence classes of words and permutations, Graph Theory, Combinatorics and Applications, GTCA 2019, U.A.E. 2019, Al Ain, United Arab Emirates. pdf
J.-L. Baril, S. Kirgizov, Pattern distribution in faro words and permutations, Permutation Pattern, Valparaiso University (virtual conference), United States, June 30, 2020.
J.-L. Baril, G. Cerbai, C. Khalil, V. Vajnovszki, Catalan and Schröder permutations sortable by two restricted stacks, Permutation Pattern, Valparaiso University (virtual conference), United States, June 30, 2020.

--------------------------------------------------------------------------------------
The On-Line Encyclopedia of Integer Sequences ( > 115)

Sloane

--------------------------------------------------------------------------------------

Conférences nationales

J.-L. Baril, Construction de réseaux en patchwork, Journées Algorithmiques, Luminy, 1995
J.-L. Baril, V. Vajnovszki, Hamiltonisme du cube de Lucas d'ordre p, Journées Graphes 2003, Dijon
J.-L. Baril, H. Kheddouci and O. Togni, Force d'irrégularité des graphes circulants, Journées Graphes 2003, Dijon
J.-L. Baril, R. Vernay, Autour de la duplication du génome, EJCIM' 09, Clermont, 2009
.....

--------------------------------------------------------------------------------------

Livres

Jean-Luc Baril, M. Poneti, Pu.m.a., Firenze, 2009.

--------------------------------------------------------------------------------------

Rapports internes de recherche - Mémoires

Jean-Luc Baril, Autour de l'algorithme de Voronoï : construction de réseaux euclidiens, Thèse en Mathématiques, Bordeaux 1996, pdf
Jean-Luc Baril, Génération exhaustive et étude de structures de classes combinatoires, Habilitation à diriger des recherches, 2010, pdf
Jean-Luc Baril, Etude des réseaux contigus à Dn, Mémoire de DEA, Bordeaux 1991
Quelques ballades combinatoires -- Ballades

Membre editorial board :

· Enumerative Combinatorics and Applications (International Journal)

--------------------------------------------------------------------------------------

Co-auteurs (21): Cyril Banderier (CNRS - Univ. Paris 13), David Bevan (Univ. Strathclyde, Scotland), Alexander Burstein (Howard University, Washington, United States), Giulio Cerbai (Univ. Florence, Italie), Phan-Thuan Do (Univ. Hanoï, Vietnam), Richard Genestier (Univ. Bourgogne Franche-Comté), Christian Gentil (Univ. Dijon), Alain Giorgetti (Univ. Franche-Comté, Besançon), Hamamache Kheddouci (Univ. Lyon), Sergey Kirgizov (Univ. Dijon), Sandrine Lanquetin (Univ. Dijon), Toufik Mansour (Univ. Haïfa, Israel), Lucas Morlet (Univ. Dijon), Céline Moreira Dos Santos (Univ. Dijon), Marc Neveu (Univ. Dijon), Jean-Marcel Pallo (Univ. Dijon), Armen Petrossian (Univ. Dijon), M. Poneti (Florence, Italie), Olivier Togni (Univ. Dijon), Vincent Vajnovszki (Univ. Dijon), Rémi Vernay (EISTI - Pau)

--------------------------------------------------------------------------------------

· Citations de mes travaux

· Catalan Lattices, Motzkin Geodesic in Tamari

· Hal

· Mathscinet

· DBLP

· Scholar Google

· Sloane

$Description : Description : Description : Description : Description : Description : Description : C:\Users\baril\Desktop\bar3_anm.gif$