 | 2010 |
| 13 |  | Chahrazad Adiche,
Méziane Aïder:
A Hybrid Method for Solving the Multi-objective Assignment Problem.
J. Math. Model. Algorithms 9(2): 149-164 (2010) |
| 2009 |
| 12 |  | Kahina Meslem,
Méziane Aïder:
On an extension of distance hereditary graphs.
Discrete Mathematics 309(11): 3644-3652 (2009) |
| 11 |  | Méziane Aïder,
Sylvain Gravier,
Kahina Meslem:
Isometric embeddings of subdivided connected graphs into hypercubes.
Discrete Mathematics 309(22): 6402-6407 (2009) |
| 2008 |
| 10 |  | Méziane Aïder:
Bipartite almost distance-hereditary graphs.
Discrete Mathematics 308(5-6): 865-871 (2008) |
| 9 |  | Chahrazad Adiche,
Méziane Aïder:
New variants of simulated annealing for solving a biobjective assignment problem.
Revue d'Intelligence Artificielle 22(2): 237-255 (2008) |
| 2006 |
| 8 |  | Méziane Aïder,
Sylvain Gravier,
Kahina Meslem:
Isometric embedding of subdivided Connected graphs in the hypercube.
Electronic Notes in Discrete Mathematics 24: 145-151 (2006) |
| 2005 |
| 7 |  | Kahina Meslem,
Méziane Aïder:
On an extension of distance-hereditary graphs.
Electronic Notes in Discrete Mathematics 22: 253-259 (2005) |
| 6 |  | Méziane Aïder,
Mustapha Aouchiche:
Distance monotonicity and a new characterization of Hamming graphs.
Inf. Process. Lett. 96(6): 207-213 (2005) |
| 2004 |
| 5 |  | Méziane Aïder:
Extended Distance-Hereditary Graphs.
CTW 2004: 21-23 |
| 4 |  | Méziane Aïder:
Extended Distance-Hereditary Graphs.
Electronic Notes in Discrete Mathematics 17: 15-17 (2004) |
| 2002 |
| 3 |  | Méziane Aïder:
Almost distance-hereditary graphs.
Discrete Mathematics 242(1-3): 1-16 (2002) |
| 2 |  | Méziane Aïder,
Mustapha Aouchiche:
Distance monotonicity and a new characterization of hypercubes.
Discrete Mathematics 245(1-3): 55-62 (2002) |
| 2000 |
| 1 |  | Méziane Aïder,
Sylvain Gravier:
Critical graphs for clique-coloring.
Electronic Notes in Discrete Mathematics 5: 3-6 (2000) |