A note on frucht diagrams, boolean graphs and hamilton cycles. - Italo J. Dejter; Walter Cedeño; V. Jauregui (Discret. Math., 1993)

Multi-Niche Crowding in Genetic Algorithms and its Application to the Assembly of DNA Restriction-Fragments. - Walter Cedeño; V. Rao Vemuri; Tom Slezak (Evol. Comput., 1994)

On the use of niching for dynamic landscapes. - Walter Cedeño; V. Rao Vemuri (ICEC, 1997)

In vitro selection for a OneMax DNA evolutionary computation. - David Harlan Wood; Junghuei Chen; Eugene Antipov; Bertrand Lemieux; Walter Cedeño (DNA Based Computers, 1999)

Analysis of Speciation and Niching in the Multi-Niche Crowding GA. - Walter Cedeño; V. Rao Vemuri (Theor. Comput. Sci., 1999)

A design for DNA computation of the OneMax problem. - David Harlan Wood; Junghuei Chen; Eugene Antipov; Bertrand Lemieux; Walter Cedeño (Soft Comput., 2001)

On the Use of Neural Network Ensembles in QSAR and QSPR. - Dimitris K. Agrafiotis; Walter Cedeño; Victor S. Lobanov (J. Chem. Inf. Comput. Sci., 2002)

Using particle swarms for the development of QSAR models based on K-nearest neighbor and kernel regression. - Walter Cedeño; Dimitris K. Agrafiotis (J. Comput. Aided Mol. Des., 2003)

A Comparison of Particle Swarms Techniques for the Development of Quantitative Structure-Activity Relationship Models for Drug Design. - Walter Cedeño; Dimitris K. Agrafiotis (CSB Workshops, 2005)

The enhanced evolutionary tabu search and its application to the quadratic assignment problem. - John F. McLoughlin III; Walter Cedeño (GECCO, 2005)