Verificación y Validación en el Ámbito del Desarrollo Basado en Modelos de Interfaces de Usuario. - Miguel Romero 001; Juan de Lara (DSDM, 2006)

A Graph-Oriented Model and Query Language for Events. - Miguel Romero 001; M. Andrea Rodríguez (ER Workshops, 2007)

Explicitly Task Oriented Probabilistic Active Vision for a Mobile Robot. - Pablo Guerrero; Javier Ruiz-del-Solar; Miguel Romero 001 (RoboCup, 2008)

Task-Oriented Probabilistic Active Vision. - Pablo Guerrero; Javier Ruiz-del-Solar; Miguel Romero 001; Sergio Angulo (Int. J. Humanoid Robotics, 2010)

On Low Treewidth Approximations of Conjunctive Queries. - Pablo Barceló; Leonid Libkin; Miguel Romero 001 (AMW, 2012)

The SMO-index: a succinct moving object structure for timestamp and interval queries. - Miguel Romero 001; Nieves R. Brisaboa; M. Andrea Rodríguez (SIGSPATIAL/GIS, 2012)

Does query evaluation tractability help query containment? - Pablo Barceló; Miguel Romero 001; Moshe Y. Vardi (PODS, 2014)

Efficient Approximations of Conjunctive Queries. - Pablo Barceló; Leonid Libkin; Miguel Romero 001 (SIAM J. Comput., 2014)

SPARQL with Property Paths. - Egor V. Kostylev; Juan L. Reutter; Miguel Romero 001; Domagoj Vrgoc (ISWC (1), 2015)

Semantic Acyclicity on Graph Databases. - Pablo Barceló; Miguel Romero 001; Moshe Y. Vardi (SIAM J. Comput., 2016)

The Complexity of Reverse Engineering Problems for Conjunctive Queries. - Pablo Barceló; Miguel Romero 001 (ICDT, 2017)

The homomorphism problem for regular graph patterns. - Miguel Romero 001; Pablo Barceló; Moshe Y. Vardi (LICS, 2017)

Regular Queries on Graph Databases. - Juan L. Reutter; Miguel Romero 001; Moshe Y. Vardi (Theory Comput. Syst., 2017)

Semantic Optimization in Tractable Classes of Conjunctive Queries. - Pablo Barceló; Andreas Pieris; Miguel Romero 001 (SIGMOD Rec., 2017)

The Complexity of General-Valued CSPs Seen from the Other Side. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (FOCS, 2018)

The Tractability Frontier of Well-designed SPARQL Queries. - Miguel Romero 001 (PODS, 2018)

Boundedness of Conjunctive Regular Path Queries. - Pablo Barceló; Diego Figueira; Miguel Romero 001 (ICALP, 2019)

A More General Theory of Static Approximations for Conjunctive Queries. - Pablo Barceló; Miguel Romero 001; Thomas Zeume (Theory Comput. Syst., 2020)

Point-Width and Max-CSPs. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (ACM Trans. Algorithms, 2020)

Treewidth-Pliability and PTAS for Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (SODA, 2021)

Weisfeiler and Leman Go Relational. - Pablo Barceló; Mikhail Galkin 001; Christopher Morris 001; Miguel A. Romero Orth (LoG, 2022)

On Computing Probabilistic Explanations for Decision Trees. - Marcelo Arenas; Pablo Barceló; Miguel A. Romero Orth; Bernardo Subercaseaux (NeurIPS, 2022)

The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side. - Clément Carbonnel; Miguel Romero 001; Stanislav Zivný (SIAM J. Comput., 2022)

A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs. - Xingyue Huang; Miguel Romero 001; Ismail Ilkan Ceylan; Pablo Barceló (NeurIPS, 2023)

Conjunctive Regular Path Queries under Injective Semantics. - Diego Figueira; Miguel Romero 001 (PODS, 2023)

A Theory of Link Prediction via Relational Weisfeiler-Leman. - Xingyue Huang; Miguel A. Romero Orth; Ismail Ilkan Ceylan; Pablo Barceló (CoRR, 2023)

A neuro-symbolic framework for answering conjunctive queries. - Pablo Barceló; Tamara Cucumides; Floris Geerts; Juan L. Reutter; Miguel Romero 001 (CoRR, 2023)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views. - Michael Benedikt; Stanislav Kikot; Piotr Ostropolski-Nalewaja; Miguel Romero 001 (ACM Trans. Comput. Log., 2023)

Modeling GPU Dynamic Parallelism for self similar density workloads. - Felipe A. Quezada; Cristóbal A. Navarro; Miguel Romero 001; Cristhian Aguilera (Future Gener. Comput. Syst., 2023)

Pliability and Approximating Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (J. ACM, 2023)

The Distributional Uncertainty of the SHAP Score in Explainable Machine Learning. - Santiago Cifuentes; Leopoldo E. Bertossi; Nina Pardal; Sergio Abriola; Maria Vanina Martinez; Miguel Romero 001 (ECAI, 2024)

UnRavL: A Neuro-Symbolic Framework for Answering Graph Pattern Queries in Knowledge Graphs. - Tamara Cucumides; Daniel Daza; Pablo Barceló; Michael Cochez; Floris Geerts; Juan L. Reutter; Miguel Romero 001 (LoG, 2024)

On Computing Probabilistic Explanations for Decision Trees. - Marcelo Arenas; Pablo Barceló; Alexander Kozachinskiy; Miguel Romero 001; Bernardo Subercaseaux (J. Artif. Intell. Res., 2025)

Link Prediction with Relational Hypergraphs. - Xingyue Huang; Miguel A. Romero Orth; Pablo Barceló; Michael M. Bronstein; Ismail Ilkan Ceylan (Trans. Mach. Learn. Res., 2025)

Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations. - Pablo Barceló; Alexander Kozachinskiy; Miguel A. Romero Orth; Bernardo Subercaseaux; José Verschae (CoRR, 2025)

How Expressive are Knowledge Graph Foundation Models? - Xingyue Huang; Pablo Barceló; Michael M. Bronstein; Ismail Ilkan Ceylan; Mikhail Galkin 001; Juan L. Reutter; Miguel Romero 001 (CoRR, 2025)

Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations. - Pablo Barceló; Alexander Kozachinskiy; Miguel Romero 001; Bernardo Subercaseaux; José Verschae (Proc. ACM Manag. Data, 2025)

Minimizing Conjunctive Regular Path Queries. - Diego Figueira; Rémi Morvan; Miguel Romero 001 (Proc. ACM Manag. Data, 2025)