#### Filter Results:

- Full text PDF available (38)

#### Publication Year

2000

2017

- This year (9)
- Last 5 years (60)
- Last 10 years (104)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kaouther Drira, Hamida Seba, Hamamache Kheddouci
- Computer Communications
- 2010

- Yacine Belhoul, Mohammed Haddad, Éric Duchêne, Hamamache Kheddouci
- 2012 IEEE Ninth International Conference on…
- 2012

Retrieving matchings between process models becomes a significant challenge in many applications. Recent attempts have been done to measure similarity of process models based on graph-edit distance. This problem is known to be difficult and computational complexity of exact algorithms for graph matching is exponential. Thus, heuristics must be proposed to… (More)

- Ahmed Gater, Daniela Grigori, Mohammed Haddad, Mokrane Bouzeghoub, Hamamache Kheddouci
- 2011 IEEE International Conference on Service…
- 2011

The importance gained by the process models in modern information systems led to the increasing proliferation of process model repositories. Matching process models and assessing their similarity are critical functionalities required for the management of these collections. In this work<sup>1</sup> we present an efficient graph-based technique for matching… (More)

- Lyes Dekar, Hamamache Kheddouci
- 2009 International Conference on Advanced…
- 2009

A critical challenge in designing ad hoc networks is resource discovery. In this paper, we propose a resource discovery scheme for large scale ad hoc networks, which uses a hypercubes-based backbone. Hypercubes are constructed in the different localities of the network by considering closely its physical topology constraints and the hypercube multi-paths… (More)

- Mohammed Amin Tahraoui, Éric Duchêne, Hamamache Kheddouci
- Discrete Mathematics
- 2012

In this paper, we study a new coloring parameter of a graph called the Gap vertexdistinguishing edge coloring. It is a proper edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is given by the difference between the highest and the lowest colors of its adjacent edges. The minimum number of… (More)

Let G be a graph on vertices v1,v2, . . . ,vn. The b-chromatic number of G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1≤ i≤ k, has at least one representant xi adjacent to a vertex of every color j, 1 ≤ j 6= i ≤ k. In this paper, we give the exact… (More)

- Nabil Guellati, Hamamache Kheddouci
- J. Parallel Distrib. Comput.
- 2010

- Lyes Dekar, Hamamache Kheddouci
- Ad Hoc Networks
- 2008

The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These routes are prone to frequent ruptures because of nodes mobility. If the future movement of the mobile can… (More)

- Mohammed Haddad, Hamamache Kheddouci
- Inf. Process. Lett.
- 2009