Author:
Da Lozzo Giordano,Eppstein David,Goodrich Michael T.,Gupta Siddharth
Publisher
Springer International Publishing
Reference24 articles.
1. Akitaya, H.A., Fulek, R., Tóth, C.D.: Recognizing weak embeddings of graphs. In: Czumaj, A. (ed.) SODA 2018, pp. 274–292. SIAM (2018)
2. Angelini, P., Da Lozzo, G.: Clustered planarity with pipes. In: Hong, S. (ed.) ISAAC 2016. LIPIcs, vol. 64, pp. 13:1–13:13. Schloss Dagstuhl - LZI (2016)
3. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing for embedded planar graphs. Algorithmica 77(4), 1022–1059 (2017)
4. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Relaxing the constraints of clustered planarity. Comput. Geom. 48(2), 42–75 (2015)
5. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献