Author:
Klavík Pavel,Kratochvíl Jan,Krawczyk Tomasz,Walczak Bartosz
Publisher
Springer Berlin Heidelberg
Reference21 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, pp. 202–221 (2010)
2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Process. Lett. 8, 121–123 (1979)
3. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms. J. Comput. Sys. Sci. 13, 335–379 (1976)
4. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems (2011), http://arxiv.org/abs/1112.0245
5. Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. ACM 19, 400–410 (1972)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献