28 citations · 104 across the 8 of their papers we have counts for
10 papers
Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Linear arrangements of graphs are a well-known type of graph labeling and are found in many important computational problems. A linear arrangement is usually defined as a permutati…
Locally analytic completed cohomology
J. E. Rodríguez Camargo
We compute the geometric Sen operator for arbitrary Shimura varieties in terms of equivariant vector bundles of flag varieties and the Hodge-Tate period map. As an application, we…
The Maximum Linear Arrangement Problem for trees under projectivity and planarity
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
A linear arrangement is a mapping from the vertices of a graph to distinct consecutive integers. Linear arrangements can be represented by drawing the vertices alon…
The Linear Arrangement Library. A new tool for research on syntactic dependency structures
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this f…
Minimum projective linearizations of trees in linear time
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping from vertices of a graph to distinct integers that minimizes . In t…
The optimality of syntactic dependency distances
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban +1
It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of lan…
Bounds of the sum of edge lengths in linear arrangements of trees
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the un…
Are crossing dependencies really scarce?
Ramon Ferrer-i-Cancho, Carlos Gomez-Rodriguez, J. L. Esteban
The syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that…
The scaling of the minimum sum of edge lengths in uniformly random trees
Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there…
A correction on Shiloach's algorithm for minimum linear arrangement of trees
Juan Luis Esteban, Ramon Ferrer-i-Cancho
More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of t…