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
17 papers
An Evaluation Tool for Backbone Extraction Techniques in Weighted Complex Networks
Ali Yassin, Abbas Haidar, Hocine Cherifi +2
Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical…
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…
Grand Dyck paths with air pockets
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal +1
Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the -axis. We present enumerative results on GDAP (or t…
On List Coloring with Separation of the Complete Graph and Set System Intersections
Jean-Christophe Godin, Rémi Grisot, Olivier Togni
We consider the following list coloring with separation problem: Given a graph and integers , find the largest integer such that for any list assignment of wit…
Comparative evaluation of community-aware centrality measures
Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1
Influential nodes play a critical role in boosting or curbing spreading phenomena in complex networks. Numerous centrality measures have been proposed for identifying and ranking t…
Identifying Influential Nodes Using Overlapping Modularity Vitality
Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1
It is of paramount importance to uncover influential nodes to control diffusion phenomena in a network. In recent works, there is a growing trend to investigate the role of the com…
Comparing Community-aware Centrality Measures in Online Social Networks
Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1
Identifying key nodes is crucial for accelerating or impeding dynamic spreading in a network. Community-aware centrality measures tackle this problem by exploiting the community st…
How Correlated are Community-aware and Classical Centrality Measures in Complex Networks?
Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1
Unlike classical centrality measures, recently developed community-aware centrality measures use a network's community structure to identify influential nodes in complex networks.…
Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks
Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1
Identifying vital nodes in networks exhibiting a community structure is a fundamental issue. Indeed, community structure is one of the main properties of real-world networks. Recen…
Leader Election And Local Identifiers For 3D Programmable Matter
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek +1
In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-r…
hidden markov random fields and cuckoo search method for medical image segmentation
EL-Hachemi Guerrout, Ramdane Mahiou, Dominique Michelucci +2
Segmentation of medical images is an essential part in the process of diagnostics. Physicians require an automatic, robust and valid results. Hidden Markov Random Fields (HMRF) pro…
Catalan words avoiding pairs of length three patterns
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, p…
Packing colorings of subcubic outerplanar graphs
Boštjan Brešar, Nicolas Gastineau, Olivier Togni
Given a graph and a nondecreasing sequence of positive integers, the mapping is called an -packing coloring of $G…