Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (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, MR3050657, S2CID8344088, doi:10.1145/2261250.2261310..
Angelini, Patrizio; Di Bartolomeo, Marco; Di Battista, Giuseppe (2013), «Implementing a partitioned 2-page book embedding testing algorithm», Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, Lecture Notes in Computer Science 7704, Springer, pp. 79-89, MR3067219, S2CID15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8..
Rosenberg, Arnold L. (1986), «Book embeddings and wafer-scale integration», Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986), Congressus Numerantium 54, pp. 217-224, MR885282..
Kainen, Paul C. (1990), «The book thickness of a graph. II», Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), Congressus Numerantium 71, pp. 127-132, MR1041623..
Angelini, Patrizio; Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Rutter, Ignaz (2012), «Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph», Journal of Discrete Algorithms14: 150-172, MR2922068, doi:10.1016/j.jda.2011.12.015..
Wood, David R. (2002), «Bounded degree book embeddings and three-dimensional orthogonal graph drawing», Graph Drawing: 9th International Symposium, GD 2001, Vienna, Austria, September 23–26, 2001, Revised Papers, Lecture Notes in Computer Science 2265, Springer, Berlin, pp. 312-327, MR1962433, doi:10.1007/3-540-45848-4_25..
Nicholson, T. A. J. (1968), «Permutation procedure for minimising the number of crossings in a network», Proceedings of the Institution of Electrical Engineers115: 21-26, MR0311416, doi:10.1049/piee.1968.0004..
Bannister, Michael J.; Eppstein, David (2014), «Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth», Proc. 22nd Int. Symp. Graph Drawing (GD 2014), Lecture Notes in Computer Science 8871, Springer-Verlag, pp. 210-221, MR3333228, arXiv:1408.6321, doi:10.1007/978-3-662-45803-7_18..
McKenzie, Thomas; Overbay, Shannon (2010), «Book embeddings and zero divisors», Ars Combinatoria95: 55-63, MR2656248..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk33 (4): 25-37, 96, MR1746427, S2CID121089736, doi:10.1007/BF02467109..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae69 (3): 243-283, MR1885279, S2CID116488382, doi:10.1023/A:1014299416618..
archives-ouvertes.fr
hal.archives-ouvertes.fr
Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine (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, Lecture Notes in Computer Science 4614, pp. 140-151, doi:10.1007/978-3-540-74450-4_13..
Bekos, Michael A.; Gronemann, Martin; Raftopoulou, Chrysanthi N. (2014), «Two-page book embeddings of 4-planar graphs», Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics (LIPIcs) 25, pp. 137-148, ISBN9783939897651, arXiv:1401.0684, doi:10.4230/LIPIcs.STACS.2014.137..
Bekos, Michael A.; Kaufmann, Micheal; Klute, Fabian; Pupyrev, Sergey; Raftopoulou, Chrysanthi; Ueckerdt, Torsten (2020), «Four Pages Are Indeed Necessary for Planar Graphs», Journal of Computational Geomerty1 (11): 332-353, arXiv:2004.07630..
Angelini, Patrizio; Di Bartolomeo, Marco; Di Battista, Giuseppe (2013), «Implementing a partitioned 2-page book embedding testing algorithm», Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, Lecture Notes in Computer Science 7704, Springer, pp. 79-89, MR3067219, S2CID15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8..
Bannister, Michael J.; Eppstein, David; Simons, Joseph A. (2013), «Fixed parameter tractability of crossing minimization of almost-trees», Graph Drawing: 21st International Symposium, GD 2013, vínculoaux, France, September 23–25, 2013, Revised Selected Papers, Lecture Notes in Computer Science 8242, pp. 340-351, S2CID10142319, arXiv:1308.5741, doi:10.1007/978-3-319-03841-4_30..
Bannister, Michael J.; Eppstein, David (2014), «Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth», Proc. 22nd Int. Symp. Graph Drawing (GD 2014), Lecture Notes in Computer Science 8871, Springer-Verlag, pp. 210-221, MR3333228, arXiv:1408.6321, doi:10.1007/978-3-662-45803-7_18..
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (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, MR3050657, S2CID8344088, doi:10.1145/2261250.2261310..
Bekos, Michael A.; Gronemann, Martin; Raftopoulou, Chrysanthi N. (2014), «Two-page book embeddings of 4-planar graphs», Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics (LIPIcs) 25, pp. 137-148, ISBN9783939897651, arXiv:1401.0684, doi:10.4230/LIPIcs.STACS.2014.137..
Heath, Lenny (1984), «Embedding planar graphs In seven pages», Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pp. 74-83, doi:10.1109/SFCS.1984.715903..
Bekos, Michael A.; Bruckdorfer, Till; Kaufmann, Michael; Raftopoulou, Chrysanthi (2015), «1-Planar graphs have constant book thickness», Algorithms – ESA 2015, Lecture Notes in Computer Science 9294, 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, Lecture Notes in Computer Science 577, Berlin: Springer, pp. 389-400, doi:10.1007/3-540-55210-3_199..
Unger, Walter (1988), «On the k-colouring of circle-graphs», Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science (STACS '88), Lecture Notes in Computer Science 294, Springer-Verlag, pp. 61-72, doi:10.1007/BFb0035832..
Angelini, Patrizio; Di Bartolomeo, Marco; Di Battista, Giuseppe (2013), «Implementing a partitioned 2-page book embedding testing algorithm», Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, Lecture Notes in Computer Science 7704, Springer, pp. 79-89, MR3067219, S2CID15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8..
Baur, Michael; Brandes, Ulrik (2005), «Crossing reduction in circular layouts», en van Leeuwen, Jan, ed., Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, Lecture Notes in Computer Science 3353, Springer, pp. 332-343, doi:10.1007/978-3-540-30559-0_28..
Angelini, Patrizio; Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Rutter, Ignaz (2012), «Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph», Journal of Discrete Algorithms14: 150-172, MR2922068, doi:10.1016/j.jda.2011.12.015..
Wood, David R. (2002), «Bounded degree book embeddings and three-dimensional orthogonal graph drawing», Graph Drawing: 9th International Symposium, GD 2001, Vienna, Austria, September 23–26, 2001, Revised Papers, Lecture Notes in Computer Science 2265, Springer, Berlin, pp. 312-327, MR1962433, doi:10.1007/3-540-45848-4_25..
Nicholson, T. A. J. (1968), «Permutation procedure for minimising the number of crossings in a network», Proceedings of the Institution of Electrical Engineers115: 21-26, MR0311416, doi:10.1049/piee.1968.0004..
Miyauchi, Miki (2006), «Topological book embedding of bipartite graphs», IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A (5): 1223-1226, Bibcode:2006IEITF..89.1223M, doi:10.1093/ietfec/e89-a.5.1223..
Giordano, Francesco; Liotta, Giuseppe; Mchedlidze, Tamara; Symvonis, Antonios (2007), «Computing upward topological book embeddings of upward planar digraphs», Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007, Proceedings, Lecture Notes in Computer Science 4835, Springer, pp. 172-183, doi:10.1007/978-3-540-77120-3_17..
Shahrokhi, Farhad; Sýkora, Ondrej; Székely, László A.; Vrt'o, Imrich (1995), «Book embeddings and crossing numbers», Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94, Herrsching, Germany, June 16–18, 1994, Proceedings, Lecture Notes in Computer Science 903, Springer, pp. 256-268, doi:10.1007/3-540-59071-4_53..
Bannister, Michael J.; Eppstein, David; Simons, Joseph A. (2013), «Fixed parameter tractability of crossing minimization of almost-trees», Graph Drawing: 21st International Symposium, GD 2013, vínculoaux, France, September 23–25, 2013, Revised Selected Papers, Lecture Notes in Computer Science 8242, pp. 340-351, S2CID10142319, arXiv:1308.5741, doi:10.1007/978-3-319-03841-4_30..
Bannister, Michael J.; Eppstein, David (2014), «Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth», Proc. 22nd Int. Symp. Graph Drawing (GD 2014), Lecture Notes in Computer Science 8871, Springer-Verlag, pp. 210-221, MR3333228, arXiv:1408.6321, doi:10.1007/978-3-662-45803-7_18..
Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine (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, Lecture Notes in Computer Science 4614, pp. 140-151, doi:10.1007/978-3-540-74450-4_13..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk33 (4): 25-37, 96, MR1746427, S2CID121089736, doi:10.1007/BF02467109..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae69 (3): 243-283, MR1885279, S2CID116488382, doi:10.1023/A:1014299416618..
Miyauchi, Miki (2006), «Topological book embedding of bipartite graphs», IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A (5): 1223-1226, Bibcode:2006IEITF..89.1223M, doi:10.1093/ietfec/e89-a.5.1223..
Baur, Michael; Brandes, Ulrik (2005), «Crossing reduction in circular layouts», en van Leeuwen, Jan, ed., Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, Lecture Notes in Computer Science 3353, Springer, pp. 332-343, doi:10.1007/978-3-540-30559-0_28..
He, Hongmei; Sykora, Ondrej (2004), «New circular drawing algorithms», Proceedings of the Workshop on Information Technologies – Applications and Theory (ITAT), Slovakia, September 15–19, 2004..
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (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, MR3050657, S2CID8344088, doi:10.1145/2261250.2261310..
Angelini, Patrizio; Di Bartolomeo, Marco; Di Battista, Giuseppe (2013), «Implementing a partitioned 2-page book embedding testing algorithm», Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, Lecture Notes in Computer Science 7704, Springer, pp. 79-89, MR3067219, S2CID15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8..
Bannister, Michael J.; Eppstein, David; Simons, Joseph A. (2013), «Fixed parameter tractability of crossing minimization of almost-trees», Graph Drawing: 21st International Symposium, GD 2013, vínculoaux, France, September 23–25, 2013, Revised Selected Papers, Lecture Notes in Computer Science 8242, pp. 340-351, S2CID10142319, arXiv:1308.5741, doi:10.1007/978-3-319-03841-4_30..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk33 (4): 25-37, 96, MR1746427, S2CID121089736, doi:10.1007/BF02467109..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae69 (3): 243-283, MR1885279, S2CID116488382, doi:10.1023/A:1014299416618..