Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IFIP TCS, 2004)

k-Restricted Rotation with an Application to Search Tree Rebalancing. - Alejandro Almeida Ruiz; Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (WADS, 2005)

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively. - Paola Flocchini; Antonio Mesa Enriques; Linda Pagli; Giuseppe Prencipe; Nicola Santoro (IEICE Trans. Inf. Syst., 2006)

k-Restricted rotation distance between binary trees. - Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (Inf. Process. Lett., 2007)

Lower bounds on the rotation distance of binary trees. - Fabrizio Luccio; Antonio Mesa Enriques; Linda Pagli (Inf. Process. Lett., 2010)