Global Convexity in the Bi-Criteria Traveling Salesman Problem. - Marcos Villagra; Benjamín Barán; Osvaldo Gómez (IFIP AI, 2006)

Asynchronous Team Algorithms for Boolean Satisfiability. - Carlos Rodríguez 001; Marcos Villagra; Benjamín Barán (BIONETICS, 2007)

A Global Convexity Analysis on the MAX-SAT Domain. - Marcos Villagra; Benjamín Barán (BIONETICS, 2007)

Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing. - Marcos Villagra; Benjamín Barán (WoLLIC, 2007)

Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. - Marcos Villagra; Masaki Nakanishi; Shigeru Yamashita; Yasuhiko Nakashima (Electron. Colloquium Comput. Complex., 2012)

Quantum Walks on the Line with Phase Parameters. - Marcos Villagra; Masaki Nakanishi; Shigeru Yamashita; Yasuhiko Nakashima (IEICE Trans. Inf. Syst., 2012)

Exponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity. - Xiaoming Sun 001; Marcos Villagra (Electron. Colloquium Comput. Complex., 2013)

Quantum and Reversible Verification of Proofs Using Constant Memory Space. - Marcos Villagra; Tomoyuki Yamakami (TPNC, 2014)

Quantum State Complexity of Formal Languages. - Marcos Villagra; Tomoyuki Yamakami (DCFS, 2015)

Language recognition power and succintness of affine automata. - Marcos Villagra; Abuzer Yakaryilmaz (CoRR, 2016)

Multiobjective Optimization in a Quantum Adiabatic Computer. - Benjamín Barán; Marcos Villagra (CLEI Selected Papers, 2016)

Multiobjective Optimization Grover Adaptive Search. - Benjamín Barán; Marcos Villagra (WCO@FedCSIS, 2017)

Comparison of two types of Quantum Oracles based on Grover's Adaptative Search Algorithm for Multiobjective Optimization Problems. - Gerardo G. Fogel; Benjamín Barán; Marcos Villagra (FedCSIS, 2017)

A Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance. - Marcos Villagra (CoRR, 2017)

Hard and Easy Instances of L-Tromino Tilings. - Javier T. Akagi; Carlos F. Gaona; Fabricio Mendoza; Marcos Villagra (CoRR, 2017)

Classically Time-Controlled Quantum Automata. - Alejandro Díaz-Caro; Marcos Villagra (TPNC, 2018)

Computational Complexity of Space-Bounded Real Numbers. - Masaki Nakanishi; Marcos Villagra (CoRR, 2018)

Language recognition power and succinctness of affine automata. - Marcos Villagra; Abuzer Yakaryilmaz (Nat. Comput., 2018)

A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization. - Benjamín Barán; Marcos Villagra (Axioms, 2019)

A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. - Fabricio Mendoza-Granada; Marcos Villagra (CoRR, 2020)

Hard and easy instances of L-tromino tilings. - Javier T. Akagi; Carlos F. Gaona; Fabricio Mendoza; Manjil P. Saikia; Marcos Villagra (Theor. Comput. Sci., 2020)

Tromino Tilings with Pegs via Flow Networks. - Javier T. Akagi; Eduardo A. Canale; Marcos Villagra (LAGOS, 2021)

A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits. - Benjamín Barán; Alejo Carballude; Marcos Villagra (SN Comput. Sci., 2021)

Reinforcement Learning applied to the Routing and Spectrum Assignment in Elastic Optical Networks. - Santiago Arce; Luis Ayala Albertini; Ivan Ríos; Diego P. Pinto-Roa; José Colbes; Marcos Villagra (LA-CCI, 2022)

Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices. - Sergio Mercado; Marcos Villagra (Discret. Math. Algorithms Appl., 2022)

Classically time-controlled quantum automata: definition and properties. - Alejandro Díaz-Caro; Marcos Villagra (Comput. J., 2025)

ZKLoRA: Efficient Zero-Knowledge Proofs for LoRA Verification. - Bidhan Roy; Peter Potash; Marcos Villagra (CoRR, 2025)