342 citations · 1.8k across the 65 of their papers we have counts for
66 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…
Linguistic laws in biology
Stuart Semple, Ramon Ferrer-i-Cancho, Morgan L. Gustison
Linguistic laws, the common statistical patterns of human language, have been investigated by quantitative linguists for nearly a century. Recently, biologists from a range of disc…
Direct and indirect evidence of compression of word lengths. Zipf's law of abbreviation revisited
Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell +3
Zipf's law of abbreviation, the tendency of more frequent words to be shorter, is one of the most solid candidates for a linguistic universal, in the sense that it has the potentia…
The distribution of syntactic dependency distances
Sonia Petrini, Ramon Ferrer-i-Cancho
The syntactic structure of a sentence can be represented as a graph, where vertices are words and edges indicate syntactic dependencies between them. In this setting, the distance…
The optimality of word lengths. Theoretical foundations and an empirical study
Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell +3
Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of form…
The expected sum of edge lengths in planar linearizations of trees. Theory and applications
Lluís Alemany-Puig, Ramon Ferrer-i-Cancho
Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges c…