Author:
Klavík Pavel,Kratochvíl Jan,Otachi Yota,Rutter Ignaz,Saitoh Toshiki,Saumell Maria,Vyskočil Tomáš
Publisher
Springer International Publishing
Reference20 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: SODA 2010: Proc. 21st Annu. ACM-SIAM Sympos. Discr. Alg., pp. 202–221 (2010)
2. Lecture Notes in Computer Science;M. Balko,2013
3. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: SODA 2013: Proc. 24th Annu. ACM-SIAM Sympos. Discr. Alg., pp. 1030–1043 (2013)
4. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. System Sci. 13, 335–379 (1976)
5. Chaplick, S., Dorbec, P., Kratochvíl, J., Montassier, M., Stacho, J.: Contact representations of planar graph: Rebuilding is hard. In: WG 2014 (to appear, 2014)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献