Publisher
Springer International Publishing
Reference34 articles.
1. Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1–32:42 (2015)
2. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms (TALG) 12(2), 1–46 (2015)
3. Bok, J., Jedličková, N.: A note on simultaneous representation problem for interval and circular-arc graphs. arXiv preprint arXiv:1811.04062 (2018)
4. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)
5. Lecture Notes in Computer Science;S Chaplick,2014