Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem. - Rodrigo Alexander Castro Campos; Francisco Javier Zaragoza Martínez (CCE, 2012)

A cache-aware data structure for representing boolean polynomials. - Rodrigo Alexander Castro Campos; Féliu D. Sagols Troncoso; Francisco Javier Zaragoza Martínez (CCE, 2015)

A triplet integer programming model for the Euclidean 3-matching problem. - Gualberto Vazquez Casas; Rodrigo Alexander Castro Campos; Marco A. Heredia; Francisco Javier Zaragoza Martínez (CCE, 2015)

An Efficient Implementation of Boolean Gröbner Basis Computation. - Rodrigo Alexander Castro Campos; Feliu Davino Sagols Troncoso; Francisco Javier Zaragoza Martínez (CARLA, 2016)

Plowing with precedence in polynomial time. - Rodrigo Alexander Castro Campos; Cynthia A. Rodríguez Villalobos; Francisco Javier Zaragoza Martínez (Networks, 2020)

Extending protein interaction networks using proteoforms and small molecules. - Luis Francisco Hernández Sánchez; Bram Burger; Rodrigo Alexander Castro Campos; Stefan Johansson; Pål R. Njølstad; Harald Barsnes; Marc Vaudel (Bioinform., 2023)

The longest common subsequence problem for small alphabets in the word RAM model. - Rodrigo Alexander Castro Campos (Inf. Process. Lett., 2025)