Author:
Angelini Patrizio,Da Lozzo Giordano,Di Bartolomeo Marco,Di Battista Giuseppe,Hong Seok-Hee,Patrignani Maurizio,Roselli Vincenzo
Publisher
Springer International Publishing
Reference10 articles.
1. Abellanas, M., Aiello, A., Hernández, G., Silveira, R.I.: Network drawing with geographical constraints on vertices. In: Actas XI Encuentros de Geom. Comput., pp. 111–118 (2005)
2. Lecture Notes in Computer Science;P. Angelini,2013
3. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013)
4. Dumitrescu, A., Mitchell, J.S.B.: Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1), 135–159 (2003)
5. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献