Edge crossings in random linear arrangements. - Lluís Alemany-Puig; Ramon Ferrer-i-Cancho (CoRR, 2019)

Fast calculation of the variance of edge crossings in random linear arrangements. - Lluís Alemany-Puig; Ramon Ferrer-i-Cancho (CoRR, 2020)

Reappraising the distribution of the number of edge crossings of graphs on a sphere. - Lluís Alemany-Puig; Mercè Mora; Ramon Ferrer-i-Cancho (CoRR, 2020)

The optimality of syntactic dependency distances. - Ramon Ferrer-i-Cancho; Carlos Gómez-Rodríguez; Juan Luis Esteban; Lluís Alemany-Puig (CoRR, 2020)

The Linear Arrangement Library. A new tool for research on syntactic dependency structures. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (CoRR, 2021)

Linear-Time Calculation of the Expected Sum of Edge Lengths in Random Projective Linearizations of Trees. - Lluís Alemany-Puig; Ramon Ferrer-i-Cancho (Comput. Linguistics, 2022)

Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees. - Lluís Alemany-Puig; Ramon Ferrer-i-Cancho (CoRR, 2022)

Minimum projective linearizations of trees in linear time. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (Inf. Process. Lett., 2022)

On The Maximum Linear Arrangement Problem for Trees. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (CoRR, 2023)

expected sum of edge lengths in planar linearizations of trees. - Lluís Alemany-Puig; Ramon Ferrer-i-Cancho (J. Lang. Model., 2024)

The maximum linear arrangement problem for trees under projectivity and planarity. - Lluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho (Inf. Process. Lett., 2024)