The HOM problem is decidable. - Guillem Godoy; Omer Giménez; Lander Ramos; Carme Àlvarez (STOC, 2010)

First-Order Unification on Compressed Terms. - Adrià Gascón; Sebastian Maneth; Lander Ramos (RTA, 2011)

Excessively duplicating patterns represent non-regular languages. - Carles Creus; Guillem Godoy; Lander Ramos (Inf. Process. Lett., 2014)

Graphs with degree constraints. - Elie de Panafieu; Lander Ramos (ANALCO, 2016)

The HOM Problem is EXPTIME-Complete. - Carles Creus; Adrià Gascón; Guillem Godoy; Lander Ramos (SIAM J. Comput., 2016)

Subgraph statistics in subcritical graph classes. - Michael Drmota; Lander Ramos; Juanjo Rué (Random Struct. Algorithms, 2017)

Random Planar Maps and Graphs with Minimum Degree Two and Three. - Marc Noy; Lander Ramos (Electron. J. Comb., 2018)

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. - Michael Drmota; Lander Ramos; Clément Requilé; Juanjo Rué (Electron. J. Comb., 2020)