Efficient Generation of Unsatisfiability Proofs and Cores in SAT. - Roberto Asín; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (LPAR, 2008)

Cardinality Networks and Their Applications. - Roberto Asín; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (SAT, 2009)

Practical algorithms for unsatisfiability proof and core generation in SAT solvers. - Roberto Javier Asín Achá; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (AI Commun., 2010)

Cardinality Networks: a theoretical and empirical study. - Roberto Asín; Robert Nieuwenhuis; Albert Oliveras; Enric Rodríguez-Carbonell (Constraints An Int. J., 2011)

Cache Performance Study of Portfolio-Based Parallel CDCL SAT Solvers. - Roberto Asín; Juan Olate; Leo Ferres (CoRR, 2013)

Making A* Run Faster than D*-Lite for Path-Planning in Partially Known Terrain. - Carlos Hernández 003; Jorge A. Baier; Roberto Asín (ICAPS, 2014)

Time-Bounded Best-First Search. - Carlos Hernández 003; Roberto Asín; Jorge A. Baier (SOCS, 2014)

Curriculum-based course timetabling with SAT and MaxSAT. - Roberto Javier Asín Achá; Robert Nieuwenhuis (Ann. Oper. Res., 2014)

Reusing Previously Found A* Paths for Fast Goal-Directed Navigation in Dynamic Terrain. - Carlos Hernández 003; Roberto Asín; Jorge A. Baier (AAAI, 2015)

Improving IntSat by expressing disjunctions of bounds as linear constraints. - Roberto Asín; Marc Bezem; Robert Nieuwenhuis (AI Commun., 2016)

Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs. - Carlos Hernández 003; Jorge A. Baier; Roberto Asín (J. Artif. Intell. Res., 2016)

Resizing cardinality constraints for MaxSAT. - Eivind Jahren; Roberto Javier Asín Achá (AI Commun., 2018)

A column generation approach and new bounds for the car sequencing problem. - Eivind Jahren; Roberto Javier Asín Achá (Ann. Oper. Res., 2018)

Multipath Adaptive A*: Factors That Influence Performance in Goal-Directed Navigation in Unknown Terrain. - Carlos Hernández Ulloa; Jorge A. Baier; Roberto Javier Asín Achá (IEEE Access, 2020)

HNCcorr: combinatorial optimization for neuron identification. - Roberto Javier Asín Achá; Dorit S. Hochbaum; Quico Spaen (Ann. Oper. Res., 2020)

Anytime automatic algorithm selection for knapsack. - Isaías I. Huerta; Daniel A. Neira; Daniel A. Ortega; Vicente Varas; Julio Godoy; Roberto Javier Asín Achá (Expert Syst. Appl., 2020)

A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. - Roberto Javier Asín Achá; Rodrigo López; Sebastián Hagedorn; Jorge A. Baier (SOCS, 2021)

Speeding up compact planar graphs by using shallower trees. - Alexander Irribarra-Cortés; José Fuentes-Sepúlveda; Diego Seco; Roberto Asín (DCC, 2022)

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. - Roberto Javier Asín Achá; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (KDIR, 2022)

Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection. - Isaías I. Huerta; Daniel A. Neira; Daniel A. Ortega; Vicente Varas; Julio Godoy; Roberto Javier Asín Achá (Expert Syst. Appl., 2022)

Multi-Agent Path Finding: A New Boolean Encoding. - Roberto Javier Asín Achá; Rodrigo López; Sebastián Hagedorn; Jorge A. Baier (J. Artif. Intell. Res., 2022)

Text-Based Feature-Free Automatic Algorithm Selection. - Amanda Salinas-Pinto; Bryan Alvarado-Ulloa; Dorit S. Hochbaum; Matías Francia-Carramiñana; Ricardo Ñanculef; Roberto Javier Asín Achá (KDIR, 2024)

A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding (Extended Abstract). - Rodrigo López; Roberto Javier Asín Achá; Jorge A. Baier (SOCS, 2024)

Anytime Automatic Algorithm Selection for the Multi-Agent Path Finding Problem. - Angelo Zapata; Julio Godoy; Roberto Javier Asín Achá (IEEE Access, 2024)

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques. - Roberto Javier Asín Achá; Alexis Espinoza; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (Networks, 2024)

A Theoretical Bound Which Improves the Performance of Compilation-Based Multi-Agent Path Finding. - Rodrigo López; Roberto Javier Asín Achá; Jorge A. Baier (IEEE Access, 2025)

Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits. - Catalina Pezo; Dorit S. Hochbaum; Julio Godoy; Roberto Javier Asín Achá (Comput. Oper. Res., 2025)