3 papers
cs.DS2026
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…
math.NT2026
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…
cs.DS2024
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 . I…