Ábrego, Bernardo M.; Aichholzer, Oswin & Fernández-Merchant, Silvia et al. (2012), "The 2-page crossing number of Kn (extended abstract)", Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12), ACM, New York, pp. 397–403, DOI 10.1145/2261250.2261310.
Bekos, Michael A.; Bruckdorfer, Till & Kaufmann, Michael et al. (2015), "1-Planar graphs have constant book thickness", Algorithms – ESA 2015, vol. 9294, Lecture Notes in Computer Science, Springer, pp. 130–141, DOI 10.1007/978-3-662-48350-3_12.
Unger, Walter (1992), "The complexity of colouring circle graphs", STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13–15, 1992, Proceedings, vol. 577, Lecture Notes in Computer Science, Berlin: Springer, pp. 389–400, DOI 10.1007/3-540-55210-3_199.
Baur, Michael & Brandes, Ulrik (2005), "Crossing reduction in circular layouts", in van Leeuwen, Jan, Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, vol. 3353, Lecture Notes in Computer Science, Springer, pp. 332–343, DOI 10.1007/978-3-540-30559-0_28.
Miyauchi, Miki (2006), "Topological book embedding of bipartite graphs", IEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesE89-A (5): 1223–1226, DOI 10.1093/ietfec/e89-a.5.1223.
Shahrokhi, Farhad; Sýkora, Ondrej & Székely, László A. et al. (1995), "Book embeddings and crossing numbers", Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94, Herrsching, Germany, June 16–18, 1994, Proceedings, vol. 903, Lecture Notes in Computer Science, Springer, pp. 256–268, DOI 10.1007/3-540-59071-4_53.
Blin, Guillaume; Fertin, Guillaume & Rusu, Irena et al. (2007), "Extending the hardness of RNA secondary structure comparison", Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, vol. 4614, Lecture Notes in Computer Science, pp. 140–151, DOI 10.1007/978-3-540-74450-4_13.
Pavan, A.; Tewari, Raghunath & Vinodchandran, N. V. (2012), "On the power of unambiguity in log-space", Computational Complexity21 (4): 643–670, DOI 10.1007/s00037-012-0047-3.