1. On the mapping problem;Bokhari;IEEE Trans. Comput. C,1981
2. Task allocation onto a hypercube by recursive mincut bipartitioning;Ramanujam F;J. of Parallel and Distributed Comp.,1990
3. J. Marenco. Un algoritmo branch-and-cut para el problema de mapping, Master's thesis, Universidade de Buenos Aires, 1999. Supervisor: I. Loiseau
4. J. Marenco. New facets of the mapping polytope, In CLAIO, 2006
5. Maximum common subgraph isomorphism algorithms for the matching of chemical structures;Raymond;J. of Computer-Aided Molecular Design,2002