The following pages link to Méziane Aïder (Q234378):
Displayed 18 items.
- Relaxed locally identifying coloring of graphs (Q343700) (← links)
- A hybrid method for solving the multi-objective assignment problem (Q656068) (← links)
- On an extension of distance hereditary graphs (Q1025561) (← links)
- Distance monotonicity and a new characterization of Hamming graphs (Q1044739) (← links)
- Isometric embeddings of subdivided connected graphs into hypercubes (Q1045174) (← links)
- Distance monotonicity and a new characterization of hypercubes (Q1348111) (← links)
- Uncertain interval programming model for multi-objective multi-item fixed charge solid transportation problem with budget constraint and safety measure (Q2153704) (← links)
- Bipartite almost distance-hereditary graphs (Q2470455) (← links)
- (Q2816053) (← links)
- Extended Distance-Hereditary Graphs (Q3439120) (← links)
- On an extension of distance-hereditary graphs (Q3439343) (← links)
- Isometric embedding of subdivided Connected graphs in the hypercube (Q3439428) (← links)
- (Q4298684) (← links)
- (Q5197810) (← links)
- On the star forest polytope for trees and cycles (Q5214329) (← links)
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation (Q5380972) (← links)
- Almost distance-hereditary graphs (Q5957743) (← links)
- Conflict hypergraphs to define new families of facets for the independence system polytope (Q6041231) (← links)