Author:
Bläsius Thomas,Rutter Ignaz
Publisher
Springer Berlin Heidelberg
Reference12 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: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 202–221. SIAM (2010)
2. Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the Simultaneous Embeddability of two Graphs whose Intersection is a Biconnected or a Connected Graph. J. Discr. Alg. 14, 150–172 (2012),
http://dx.doi.org/10.1016/j.jda.2011.12.015
3. Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. CoRR abs/1204.5853 (2012)
4. Bläsius, T., Rutter, I.: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. CoRR abs/1112.0245 (2011)
5. Di Battista, G., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4), 302–318 (1996)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献