Publisher
Springer Nature Switzerland
Reference29 articles.
1. Adnan, M.A.: Minimum Segment Drawings of Outerplanar Graphs. Master’s thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka (2008). http://lib.buet.ac.bd:8080/xmlui/bitstream/handle/123456789/1565/Full%20%20Thesis%20.pdf?sequence=1&isAllowed=y
2. Balko, M., Chaplick, S., Gupta, S., Hoffmann, M., Valtr, P., Wolff, A.: Bounding and computing obstacle numbers of graphs. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) Proceedings of 30th European Symposium Algorithms (ESA 2022). LIPIcs, vol. 244, pp. 11:1–13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022). https://doi.org/10.4230/LIPIcs.ESA.2022.11
3. Berger, M.: Geometry Revealed: A Jacob’s Ladder to Modern Higher Geometry. Springer, Cham (2010). https://doi.org/10.1007/978-3-540-70997-8
4. Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. 24(4), 603–620 (2020). https://doi.org/10.7155/jgaa.00526
5. Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335–352 (2022). https://doi.org/10.7155/jgaa.00597