1. Aracena, J., Caro, C.T.: The weighted sitting closer to friends than enemies problem in the line. arXiv preprint arXiv:1906.11812 (2019)
2. Becerra, R., Caro, C.T.: On the sitting closer to friends than enemies problem in trees and an intersection model for strongly chordal graphs. arXiv preprint arXiv:1911.11494 (2019)
3. Benítez, F., Aracena, J., Caro, C.T.: The sitting closer to friends than enemies problem in the circumference. arXiv preprint arXiv:1811.02699 (2018)
4. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)
5. Cancho, R.F.: Euclidean distance between syntactically linked words. Phys. Rev. E 70(5), 056135 (2004)