63 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université de BourgogneFR10 papers
- Laboratoire d’Électronique, Informatique et ImageFR3 papers
- Centre National de la Recherche ScientifiqueFR1 paper
- Institut Agro DijonFR1 paper
- Institute of Mathematics, Physics, and MechanicsSI1 paper
- Institut National des Sciences Appliquées de LyonFR1 paper
- LabEx PERSYVAL-LabFR1 paper
- Laboratoire d'Électronique, Antennes et TélécommunicationsFR1 paper
- Laboratoire Interdisciplinaire Carnot de BourgogneFR1 paper
- Lebanese UniversityLB1 paper
- Lyon 1 UniversitéFR1 paper
- Macao Polytechnic UniversityMO1 paper
5 papers · 1 filter
Knowledge-based Drug Samples' Comparison
Sébastien Guillemin, Ana Roxin, Laurence Dujourdy +1
Drug sample comparison is a process used by the French National police to identify drug distribution networks. The current approach is based on manual comparison done by forensic e…
Greedy Gray Codes for some Restricted Classes of Binary Words
Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalize…
Enumerating runs, valleys, and peaks in Catalan words
Jean-Luc Baril, Pamela E. Harris, Kimberly J. Harry +2
We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (desce…
The Combinatorics of Motzkin Polyominoes
Jean-Luc Baril, Sergey Kirgizov, José L. Ramírez +1
A word over the set of positive integers is a Motzkin word whenever , , and for . It c…
Asymptotic probability for connectedness
Thierry Monteil, Khaydar Nurligareev
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are int…