•[2026] Hochbaum, D.S., Irribarra-Cortés, A., Asín-Achá, R. "Faster and better quality conductance solutions with the incremental parametric cut algorithm". Optimization and Engineering. WOS Q2.
•[2026] Alvarado-Ulloa, B., Dilkina, B., Hochbaum, D.S., Nanculef, R., Asín-Achá, R. "Backbone-based Predict and Search for Pseudo-Boolean Optimization". Proceedings of the 23rd International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2026). Rabat, Morocco. Conferencia CORE B.
•[2026] Salinas-Pinto, A., Pezo, C., Hochbaum, D.S., Dilkina, B., Nanculef, R., Asín-Achá, R. "Probing Features for Automatic Algorithm Selection for Pseudo-Boolean Optimization". Proceedings of the 23rd International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2026). Rabat, Morocco. Conferencia CORE B.
•[2026] Francia-Carramiñana, M., Alvarado-Ulloa, B., Hochbaum, D.S., Dilkina, B., Nanculef, R., Asín-Achá, R. "Backbones in Pseudo-Boolean Optimization: Extraction and Analysis". Proceedings of the 19th International Conference on the Agents and Artificial Intelligence (ICAART 2026). Marbella, Spain. Conferencia CORE B.
•[2025] Lagos-Cortés, C., Carmona, G., Asín-Achá, R. "Brodnik’s Data Structure in Practice, Revisited". In 2025 LI Latin American Computer Conference (CLEI 2025). Conferencia CORE C.
•[2025] Irribarra-Cortés, A., Asín-Achá, R., Fuentes-Sepúlveda, J., Seco, D. "Heuristic-based computation of tailored spanning trees to speed up compact planar graphs". The Computer Journal, 68(10), 1476–1484. WOS Q3.
•[2025] López, R., Asín-Achá, R., Baier, J.A. "A Theoretical Bound which Improves the Performance of Compilation-Based Multi-Agent Path Finding". IEEE Access. WOS Q2.
•[2025] Pezo, C., Hochbaum, D., Godoy, J., Asin-Acha, R. "Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits". Computers & Operations Research, 173, 106836. WOS Q1.
•[2024] Zapata, A., Godoy, J., Asín-Achá, R. "Anytime automatic algorithm selection for the multi-agent path finding problem". IEEE Access, 12, 62177–62188. WOS Q2.
•[2024] Salinas-Pinto, A., Alvarado-Ulloa, B., Hochbaum, D.S., Francia-Carramiñana, M., Nanculef, R., Asín-Achá, R. "Text-Based Feature-Free Automatic Algorithm Selection". Proceedings of the 17th International Conference on Knowledge Discovery and Information Retrieval (KDIR, part of IC3K). Porto, Portugal. Conferencia CORE C.
•[2024] López, R., Asín-Achá, R., Baier, J.A. "A New Upper Bound for the Makespan of Cost-Optimal Solutions for Multi-Agent Path Finding". In Proceedings of the International Symposium on Combinatorial Search. Alberta, Canada. Conferencia CORE B.
•[2024] Asín-Achá, R., Espinoza, A., Goldschmidt, O., Hochbaum, D.S., Huerta, I.I. "Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques". Networks, 84(4), 465–480. WOS Q4.
•[2022] Asín-Achá, R., López, R., Hagedorn, S., Baier, J. "Multi-agent path finding: A new boolean encoding". Journal of Artificial Intelligence Research, 75, 323–350. WOS Q2.
•[2022] Huerta, I.I., Goldschmidt, O., Hochbaum, D., Asín-Achá, R. "Fast algorithm for the Capacitated Vehicle Routing Problem using Machine Learning selection of algorithm’s parameters". Proceedings of the 15th International Conference on Knowledge Discovery and Information Retrieval (KDIR, part of IC3K). Rome, Italy. Conferencia CORE C.
•[2022] Irribarra-Cortés, A., Fuentes-Sepúlveda, J., Seco, D., Asín-Achá, R. "Speeding up compact planar graphs by using shallower trees". Proceedings of the Data Compression Conference 2022 (DCC 2022). Snowbird, Utah, USA. Conferencia CORE B.
•[2022] Huerta, I.I., Neira, D.A., Ortega, D.A., Varas, V., Godoy, J., Asín-Achá, R. "Improving the state-of-the-art in the traveling salesman problem: An anytime automatic algorithm selection". Expert Systems with Applications, 187, Article 115948. WOS Q1.
•[2021] Asín, R., López, R., Hagedorn, S., Baier, J.A. "A new boolean encoding for MAPF and its performance with ASP and MaxSAT solvers". Proceedings of the 14th International Symposium on Combinatorial Search (SoCS 2021). Guangzhou, China. Conferencia CORE B.
•[2021] Huerta, I.I., Neira, D.A., Ortega, D.A., Varas, V., Godoy, J., Asín-Achá, R. "Anytime automatic algorithm selection for knapsack". Expert Systems with Applications, 158, Article 113613. WOS Q1.
•[2020] Hernández, C.H., Baier, J.A., Asín-Achá, R. "Multipath adaptive A*: Factors that influence performance in goal-directed navigation in unknown terrain". IEEE Access, 8(1), 116724–116732. WOS Q2.
•[2020] Asín Achá, R., Hochbaum, D.S., Spaen, Q. "HNCcorr: Combinatorial optimization for neuron identification". Annals of Operations Research, 289(1), 5–32. WOS Q1.
•[2019] Spaen, Q., Asín, R., Chettih, S., Minderer, M., Harvey, C., Hochbaum, D. "HNCcorr: A novel combinatorial approach for cell identification in calcium imaging movies". eNeuro, 6(2), 1–19. WOS Q2.
•[2018] Jahren, E., Asín, R. "Resizing cardinality constraints for MaxSAT". AI Communications, 31(4), 355–367. WOS Q4.
•[2018] Jahren, E., Asín, R. "A column generation approach and new bounds for the car sequencing problem". Annals of Operations Research, 264, 193–211. WOS Q1.
•[2017] Jahren, E., Asín, R. "The MSUSorting MaxSAT solver". Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017). Melbourne, Australia. Conferencia CORE A.
•[2016] Hernández, C., Baier, J.A., Asín, R. "Time-bounded best-first search for reversible and non-reversible search graphs". Journal of Artificial Intelligence Research, 56, 547–571. WOS Q2.
•[2016] Asín, R., Bezem, M., Nieuwenhuis, R. "Improving IntSat by expressing disjunctions of bounds as linear constraints". AI Communications, 29(1), 205–209. WOS Q4.
•[2015] Hernández, C., Baier, J.A., Asín, R. "Reusing previously found A* paths for fast goal-directed navigation in dynamic terrain". Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI-15). Austin, Texas, USA. Conferencia CORE A*.
•[2015] Asín, R. "Comments on: An overview of curriculum-based course timetabling". TOP, 23(2), 350–354. WOS Q4.
•[2014] Hernández, C., Asín, R., Baier, J.A. "Time-bounded best-first search". Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014). Prague, Czech Republic. Conferencia CORE B.
•[2014] Hernández, C., Baier, J.A., Asín, R. "Making A* run faster than D*-Lite for path-planning in partially known terrain". Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014). Portsmouth, USA. Conferencia CORE A*.
•[2014] Asín, R., Nieuwenhuis, R. "Curriculum-based course timetabling with SAT". Annals of Operations Research, 218, 71–91. WOS Q1.
•[2011] Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E. "Cardinality networks: A theoretical and empirical study". Constraints, 16(2), 195–221. WOS Q3.
•[2010] Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E. "Practical algorithms for unsatisfiability proof and core generation in SAT solvers". AI Communications, 23(2–3), 145–157. WOS Q4.
•[2010] Asín, R., Nieuwenhuis, R. "Curriculum-based course timetabling with SAT and MaxSAT". Proceedings of the 8th International Conference on Practice and Theory of Automated Timetabling (PATAT 2010), pp. 42–56. Belfast, Northern Ireland, UK. Conferencia CORE C.
•[2009] Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E. "Cardinality networks and their applications". Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT), pp. 167–180. Swansea, UK. Conferencia CORE A.
•[2008] Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E. "Efficient generation of unsatisfiability proofs and cores in SAT". Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), pp. 16–30. Doha, Qatar. Conferencia CORE B.
