Author Info
Name
Affiliation
Papers
CARLOS E. VALENCIA
Departamento de Matemáticas, Centro de Investigación y de Estudios Avanzados del IPN, Apartado Postal 14–740, 07000 México City, D.F., Mexico
11
Collaborators
Citations 
PageRank 
20
11
4.99
Referers 
Referees 
References 
29
68
43
Title
Citations
PageRank
Year
The equivalence between two classic algorithms for the assignment problem.00.342018
Counting arithmetical structures on paths and cycles.00.342018
Outperforming Several Heuristics for the Multidimensional Assignment Problem00.342018
Critical ideals of signed graphs with twin vertices00.342017
A simple but effective memetic algorithm for the multidimensional assignment problem00.342017
Graphs with few trivial critical ideals00.342015
Dimension reduction in principal component analysis for trees.50.482014
Graphs with two trivial critical ideals.20.462014
Optimum matchings in weighted bipartite graphs.10.362014
Multiplicities of edge subrings10.532005
Canonical modules of certain edge subrings21.142003