Author:
Chan Timothy M.,Frati Fabrizio,Gutwenger Carsten,Lubiw Anna,Mutzel Petra,Schaefer Marcus
Publisher
Springer International Publishing
Reference23 articles.
1. Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: Proc. Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 202–221. SIAM (2010)
2. Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2-3), 129–142 (2008)
3. Bern, M., Gilbert, J.R.: Drawing the planar dual. Inform. Process. Lett. 43(1), 7–13 (1992)
4. Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous embeddings of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. Discrete Mathematics and Its Applications, ch. 11, pp. 349–382. Chapman and Hall/CRC (2013)
5. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM Journal on Computing 42(5), 1803–1829 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献