Lander Ramos

According to our database, Lander Ramos authored at least 8 papers between 2010 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

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

2018

Random Planar Maps and Graphs with Minimum Degree Two and Three.

Marc Noy, Lander Ramos

Electron. J. Comb., 2018

2017

Subgraph statistics in subcritical graph classes.

Michael Drmota, Lander Ramos, Juanjo Rué

Random Struct. Algorithms, 2017

2016

The HOM Problem is EXPTIME-Complete.

Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos

SIAM J. Comput., 2016

Graphs with degree constraints.

Elie de Panafieu, Lander Ramos

Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2014

Excessively duplicating patterns represent non-regular languages.

Carles Creus, Guillem Godoy, Lander Ramos

Inf. Process. Lett., 2014

2011

First-Order Unification on Compressed Terms.

Adrià Gascón, Sebastian Maneth, Lander Ramos

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010

The HOM problem is decidable.

Guillem Godoy, Omer Giménez, Lander Ramos, Carme Àlvarez

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010