ACM - Normas
Justo Puerto
Arie Tamir
Federico Perea
Proceedings of the Behavioral and Quantitative Game Theory on Conference on Future Directions - BQGT ’10
On the minimum diameter spanning tree problem
Covering problems
A polynomial time algorithm for computing the nucleolus of convex games
Diameter-preserving spanning trees in sparse weighted graphs
The interval function of a graph
The core," International Journal of Game Theory, 1: 111--130 (1971)