Publisher
Springer International Publishing
Reference18 articles.
1. Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 1–42 (2015). https://doi.org/10.1145/2629341
2. Angelini, P., Kindermann, P., Löffler, A., Schlipf, L., Symvonis, A.: One-bend drawings of outerplanar graphs inside simple polygons. Arxiv Report 2108.12321 (2021). https://arxiv.org/abs/2108.12321
3. Lecture Notes in Computer Science;F Brandenburg,2004
4. Chan, T.M., Frati, F., Gutwenger, C., Lubiw, A., Mutzel, P., Schaefer, M.: Drawing partially embedded and simultaneously planar graphs. J. Graph Algorithms Appl. 19(2), 681–706 (2015). https://doi.org/10.7155/jgaa.00375
5. Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing. Int. J. Comput. Geom. Appl. 22(6), 543–558 (2012). https://doi.org/10.1142/S021819591250015X