 | 2011 |
| 13 |  | Jean-Luc Baril:
Cyclic and lift closures for k...21-avoiding permutations.
Discrete Mathematics 311(1): 51-57 (2011) |
| 12 |  | Jean-Luc Baril:
Classical Sequences Revisited with Permutations Avoiding Dotted Pattern.
Electr. J. Comb. 18(1): (2011) |
| 2010 |
| 11 |  | Jean-Luc Baril,
Rémi Vernay:
Whole mirror duplication-random loss model and pattern avoiding permutations.
Inf. Process. Lett. 110(11): 474-480 (2010) |
| 2009 |
| 10 |  | Jean-Luc Baril,
Olivier Togni:
Neighbor-distinguishing k-tuple edge-colorings of graphs.
Discrete Mathematics 309(16): 5147-5157 (2009) |
| 9 |  | Jean-Luc Baril:
More restrictive Gray codes for some classes of pattern avoiding permutations.
Inf. Process. Lett. 109(14): 799-804 (2009) |
| 2008 |
| 8 |  | Jean-Luc Baril,
Jean Marcel Pallo:
The pruning-grafting lattice of binary trees.
Theor. Comput. Sci. 409(3): 382-393 (2008) |
| 2007 |
| 7 |  | Jean-Luc Baril:
Gray code for permutations with a fixed number of cycles.
Discrete Mathematics 307(13): 1559-1571 (2007) |
| 2006 |
| 6 |  | Jean-Luc Baril,
Jean Marcel Pallo:
Efficient lower and upper bounds of the diagonal-flip distance between triangulations.
Inf. Process. Lett. 100(4): 131-136 (2006) |
| 5 |  | Jean-Luc Baril,
Jean Marcel Pallo:
The Phagocyte Lattice of Dyck Words.
Order 23(2-3): 97-107 (2006) |
| 2005 |
| 4 |  | Jean-Luc Baril,
Hamamache Kheddouci,
Olivier Togni:
The irregularity strength of circulant graphs.
Discrete Mathematics 304(1-3): 1-10 (2005) |
| 3 |  | Jean-Luc Baril,
Vincent Vajnovszki:
Minimal change list for Lucas strings and some graph theoretic consequences.
Theor. Comput. Sci. 346(2-3): 189-199 (2005) |
| 2004 |
| 2 |  | Jean-Luc Baril,
Vincent Vajnovszki:
Gray code for derangements.
Discrete Applied Mathematics 140(1-3): 207-221 (2004) |
| 2003 |
| 1 |  | Jean-Luc Baril,
Jean Marcel Pallo:
Matchings in Three Catalan Lattices.
Int. J. Comput. Math. 80(2): 193-200 (2003) |