11 citations · 11 across the 5 of their papers we have counts for
6 papers
On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
In this paper, we study the existence problem of completely independent spanning trees (CIST) in chordal graphs through appropriate hypergraph representations and their panchromati…
Constructing two completely independent spanning trees in dual-cubes
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
In this paper, we prove the existence of two completely independent spanning trees in the -dimensional dual-cube , a variant of the hypercube, for every . To this…
Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
We study completely independent spanning trees (CIST), \textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a corresponden…
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…
Distributed leader election and computation of local identifiers for programmable matter
Nicolas Gastineau, Wahabou Abdou, Nader Mbarek +1
The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the…
Priority Levels Based Multi-hop Broadcasting Method for Vehicular Ad hoc Networks
Wahabou Abdou, Benoit Darties, Nader Mbarek
This paper deals with broadcasting problem in vehicular ad hoc networks (VANETs). This communication mode is commonly used for sending safety messages and traffic information. Howe…