Mohamed Mosbah
University of Bordeaux
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Mohamed Mosbah.
Theoretical Computer Science | 1993
Bruno Courcelle; Mohamed Mosbah
Abstract Every graph generated by a hyperedge replacement graph-grammar can be represented by a tree, namely the derivation tree of the derivation sequence that produced it. Certain functions on graphs can be computed recursively on the derivation trees of these graphs. By using monadic second-order logic and semiring homomorphisms, we describe in a single formalism a large class of such functions. Polynomial and even linear algorithms can be constructed for some of these functions. We unify similar results obtained by Takamizawa (1982), Bern (1987), Arnborg (1991) and Habel (1989).
Algorithmica | 2007
Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah
AbstractWe use Schnyder woods of 3-connected planar graphs to produce convex straight-line drawings on a grid of size
international colloquium on automata languages and programming | 2002
Nicolas Bonichon; Bertrand Le Saëc; Mohamed Mosbah
(n-2-\Delta)\times (n-2-\Delta).
graph drawing | 2004
Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah
The parameter
IEEE Transactions on Intelligent Transportation Systems | 2014
Wafa Ben Jaballah; Mauro Conti; Mohamed Mosbah; Claudio E. Palazzi
\Delta\geq 0
acs/ieee international conference on computer systems and applications | 2008
Mohamed Amine Haddar; A. Hadj Kacem; Yves Métivier; Mohamed Mosbah; Mohamed Jmaiel
depends on the Schnyder wood used for the drawing. This parameter is in the range
joint ifip wireless and mobile networking conference | 2008
Imen Jemili; Abdelfatteh Belghith; Mohamed Mosbah
0 \leq \Delta\leq {n}/{2}-2.
Theoretical Computer Science | 2003
Nicolas Bonichon; Mohamed Mosbah
The algorithm is a refinement of the face-counting algorithm; thus, in particular, the size of the grid is at most
Electronic Notes in Theoretical Computer Science | 2003
Michel Bauderon; Mohamed Mosbah
(f-2)\times(f-2).
international conference on enterprise information systems | 2006
Shehla Abbas; Mohamed Mosbah; A. Zemmari
The above bound on the grid size simultaneously matches or improves all previously known bounds for convex drawings, in particular Schnyders and the recent Zhang and He bound for triangulations and the Chrobak and Kant bound for 3-connected planar graphs. The algorithm takes linear time. The drawing algorithm has been implemented and tested. The expected grid size for the drawing of a random triangulation is close to
