Partenaires


Rechercher

Sur ce site

Sur le Web du CNRS


Accueil du site > Membres > Membres Permanents > Professeurs des Universités > Jean-Luc Baril

Jean-Luc Baril

Professeur

Le2i, Université de Bourgogne
BP 47870, 21078 DIJON Cedex, France

Tél : 03 80 39 38 01
Fax : 03 80 39 59 99
Email : barjl u-bourgogne.fr
Web : http://jl.baril.u-bourgogne.fr/

Projets :


Publications

Revues (28)

  • "Equivalence classes of Dyck paths modulo some statistics", armen petrossian, Jean-Luc Baril, Discrete Mathematics, 338 , pp. 655-660, 2015 lien sur HAL
  • "A Motzkin filter in the Tamari lattice", Jean Marcel Pallo, Jean-Luc Baril, Discrete Mathematics, 338 , pp. 1370-1378,, 2015 lien sur HAL
  • "Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two", Jean-Luc Baril, armen petrossian, Journal of Integer Sequences, 18 , pp. Aericle 15.7.1, 2015 lien sur HAL
  • "Motzkin subposets and Motzkin geodesics in Tamari lattices", Jean-Luc Baril, Jean Marcel Pallo, Information Processing Letters 114, (2014) 31-37, 2014 lien sur HAL
  • "Equivalence classes of permutations modulo excedances", armen petrossian, Toufik Mansour, Jean-Luc Baril, Journal of Combinatorics, 5 (4), pp. 453-469, 2014 lien sur HAL
  • "Gray code for permutations with a fixed number of left-to-right minima", Jean-Luc Baril, Ars Combinatoria CXI 225-239, 2013 lien sur HAL
  • "ECO-generation for some restricted classes of compositions", Jean-Luc Baril, Phan Thuan Do, Computer science Journal of M. 21, (2013) 1(61), 2013 lien sur HAL
  • "Vertex distinguishing edge- and total-colorings of cartesian and other product graphs", Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni, Ars Combinatoria, Vol. CVII,, Janvier 2012 lien sur HAL
  • "Statistics-preserving bijections between classical and cyclic permutations", Jean-Luc Baril, Information Processing Letters 113, (2012) 17-22, 2012 lien sur HAL
  • "Cyclic and lift closures for k...21-avoiding permutations", Jean-Luc Baril, Discrete Mathematics, 311 , pp. 51-57, January 2011 lien sur HAL
  • "Classical sequences revisited with permutations avoiding dotted pattern", Jean-Luc Baril, The Electronic Journal of Combinatorics 18 (2011) #P178, 2011 lien sur HAL
  • "Whole mirror duplication-random loss model and pattern avoiding permutations", Jean-Luc Baril, Rémi Vernay, Information Processing Letters, Vol. 110 , pp. 474-480, 16 Mai 2010 lien sur HAL http://jl.baril.u-bourgogne.fr/mirror.pdf
  • "Neighbor-distinguishing k-tuple edge-colorings of graphs", Jean-Luc Baril, Olivier Togni, Discrete Mathematics, 309 , pp. 5147-5157, August 2009 lien sur HAL
  • "Gray code for compositions of n with parts 1 and p.", Jean-Luc Baril, Celine Moreira Dos Santos, Advances and Applications in Discrete Mathematics, 3 (1), pp. 67-84, 2009
  • "More restrictive Gray codes for some classes of pattern avoiding permutations", Jean-Luc Baril, Information Processing Letters, Vol. 109, pp. 799–804, 2009
  • "Efficient generating algorithm for permutations with a fixed number of excedances", Jean-Luc Baril, To appear in Pure Mathematics and Applications/Algebra and Theoretical Computer Science, 2009
  • "The pruning-grafting lattice of binary trees", Jean-Luc Baril, Jean Marcel Pallo, Theoretical Computer Science, 409 (3), pp. 382-393, December 2008
  • "Hamiltonian paths for involutions in the square of a Cayley graph", Jean-Luc Baril, Journal of Discrete Mathematical Sciences & Cryptography, 10 (4), pp. 473-484, August 2007
  • "ECO-generation for p-generalized Fibonacci and Lucas permutations", Jean-Luc Baril, Phan Thuan Do, Journal of Pure Mathematics and Applications, 17 (1-2), pp. 19-37, 2007 http://www.u-bourgogne.fr/LE2I/jl.baril/bado.pdf
  • "Gray code for permutations with a fixed number of cycles", Jean-Luc Baril, Discrete Math., 307 , pp. 1559-1571, 2007 http://www.u-bourgogne.fr/LE2I/jl.baril/kcycles.pdf
  • "Efficient lower and upper bounds of the diagonal-flip distance between triangulations", Jean-Luc Baril, Jean Marcel Pallo, Information Processing Letters,, 100 (4), pp. 131-136, November 2006
  • "The Phagocyte Lattice of Dyck Words", Jean-Luc Baril, Jean Marcel Pallo, Order, 23 (2-3), pp. 97-107, August 2006
  • "Adjacent vertex distinguishing edge-colorings of meshes", Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni, Australasian Journal of Combinatorics, 35 , pp. 89-102, June 2006 lien sur HAL
  • "Minimal changes list for Lucas Strings", Jean-Luc Baril, Vincent Vajnovszki, Theoretical Computer Science, 346 , pp. 189-199, 2005
  • "Irregularity strength of circulant graphs", Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni, Discrete Mathematics 304, 1-3 (2005) 1-10, 2005 lien sur HAL
  • "Gray code for derangements", Jean-Luc Baril, Vincent Vajnovszki, Discrete Applied Mathematics, 140 (1-3), pp. 207-221, 15 May 2004
  • "Gray code for Cayley permutations", Jean-Luc Baril, Computer Science Journal of M., Vol. 11 (No. 3), 2003
  • "Matchings in three Catalan lattices", Jean-Luc Baril, Jean Marcel Pallo, Intern. J. Computer Math., 8 (2), pp. 193-200, 2003

Livres (1)

  • "Proceeding of Gascom 2008, PU.M.A.", Jean-Luc Baril, M. Poneti, To appear, 2009

Conférences internationales (15)

  • "Permutations avoiding generalized patterns modulo left-to-right maxima", Jean-Luc Baril, armen petrossian, Permutation patterns, London, gb, 2015 lien sur HAL
  • "Random deletion-right insertion and pattern avoiding permutations", Banderier Cyril, Jean-Luc Baril, Celine Moreira Dos Santos, Permutation patterns, London, gb, 2015 lien sur HAL
  • "Some unusual asymptotics for a variant of insertion sort", Banderier Cyril, Jean-Luc Baril, Celine Moreira Dos Santos, 26th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Strobl, at, 2015 lien sur HAL
  • "Equivalence classes of permutations modulo descents and left-to-right maxima", armen petrossian, Jean-Luc Baril, Gascom, Bertinoro : Italie, 2014 lien sur HAL
  • "Equivalence classes of Dyck paths modulo some statistics", armen petrossian, Jean-Luc Baril, 9th International colloquium on graph theory and combinatorics, Grenoble : France, 2014 lien sur HAL
  • "Whole mirror duplication-random loss model and pattern avoiding permutations", Jean-Luc Baril, Rémi Vernay, Pattern Permutations, Florence, Italie, 14 Juillet 2009 http://www.dsi.unifi.it/~PP2009/talks/Talks_martedi/Talks_martedi/vernay.pdf
  • "A CAT algorithm for generating permutations with a fixed number of excedances", Jean-Luc Baril, GASCOM08, Bibbiena (Italy), 16-21 June, 2008
  • "VD-colorings of product graphs", Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni, Gascom'08, Dedicated to Jean-Guy Penaud on the occasion of his 65th birthday, Bibbiena, Italy,, 2008
  • "ECO-generation for compositions and their restrictions", Jean-Luc Baril, Phan Thuan Do, Pattern permutations, University of Otago, New-Zealand, 2008
  • "Efficient generating algorithms for some combinatorial object classes", Jean-Luc Baril, Phan Thuan Do, Combinatorics and Statistical Mechanics, Erwin Schrödinger International Institute for Mathematical Physics, Vienne, Autriche, 2008
  • "More restrictive Gray code for (1,p)-compositions and relatives,", Jean-Luc Baril, Celine Moreira Dos Santos, Journées Montoises d'Informatique Théorique, UMH, Université de Mons-Hainaut, Belgique, 2008
  • "ECO-generation for Fibonacci and Lucas permutations", Jean-Luc Baril, Phan Thuan Do, GASCOM06, Dijon, France, September 2006
  • "Generalized Fibonacci permutations generation by the ECO method", Jean-Luc Baril, Phan Thuan Do, CANT2006, Liege, Belgique, May 2006
  • "Gray code for permutations with exactly k-cycles", Jean-Luc Baril, GASCOM'06, Dijon, 2006
  • "Gray codes for p Lucas strings", Jean-Luc Baril, Vincent Vajnovszki, Proceedings of the 4th International Conference on Combinatorics on Words, pp. 149-158, Turku, Finland, TUCS General Publication,, September 2003

Conférences nationales (4)

  • "Autour de la duplication du génome", Jean-Luc Baril, Rémi Vernay, EJCIM' 09, Clermont-Ferrand, 2 Avril 2009
  • "Force d'irrégularité des graphes circulants", Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni, Journées Graphes&Algorithmes, Dijon, 2003 lien sur HAL
  • "Hamiltonisme du cube de Lucas d'ordre $p$, ", Jean-Luc Baril, Vincent Vajnovszki, Journées Graphes 2003, Dijon, 2003
  • "Construction de réseaux en patchwork", Jean-Luc Baril, Algorithmique, Luminy 96, 0

Thèses (2)

  • "Génératio exhaustive et étue de structures de classes combinatoires", Jean-Luc Baril, Mémoire d'habilitation à diriger des recherches, 15 June 2010
  • "Autour de l'algorithme de Voronoi: construction de réseaux euclidiens", Jean-Luc Baril, Mémoire de thèse, Bordeaux, janvier 1996

Autres (1)

  • "Réseaux en patchwork", Jean-Luc Baril, Rapport de recherche, UMR 5465 CNRS, A2x, Talence, 1996

Derniers billets publiés


Archives


LE2I - Laboratoire Electronique, Informatique et Image | webmestre : Antoine Trapet | info légales | logo SPIP 2