Embebido en libro (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Embebido en libro" in Spanish language version.

refsWebsite

Global rank Spanish rank

53doi.org

2^nd place

38ams.org

451^st place

1,294^th place

14semanticscholar.org

11^th place

79^th place

12arxiv.org

69^th place

148^th place

4harvard.edu

18^th place

34^th place

3nih.gov

4^th place

1proquest.com

206^th place

1,369^th place

1icm.edu.pl

2,656^th place

low place

1ucsd.edu

1,933^rd place

1,730^th place

1web.archive.org

1^st place

1kyoto-u.ac.jp

2,913^th place

low place

1worldcat.org

5^th place

10^th place

1kit.edu

6,505^th place

low place

1lboro.ac.uk

4,065^th place

3,721^st place

1archives-ouvertes.fr

1,031^st place

2,356^th place

ams.org

Persinger, C. A. (1966), «Subsets of $n$ -books in $E 3$ », Pacific Journal of Mathematics 18: 169-173, MR 0195077, doi:10.2140/pjm.1966.18.169 ..
Atneosen, Gail Adele (1968), On the embeddability of compacta in $n$ -books: intrinsic and extrinsic properties, Ph.D. thesis, Universidad Estatal de Míchigan, p. 79, MR 2617705 .. See also Atneosen, Gail H. (1972), «One-dimensional n-leaved continua», Fundamenta Mathematicae 74 (1): 43-45, MR 0293592, doi:10.4064/fm-74-1-43-45 ..
Hales, T. C. (1997), «Sphere packings. II», Discrete and Computational Geometry 18 (2): 135-149, MR 1455511, doi:10.1007/PL00009312 ..
Bernhart, Frank R.; Kainen, Paul C. (1979), «The book thickness of a graph», Journal of Combinatorial Theory, Series B 27 (3): 320-331, MR 0554297, doi:10.1016/0095-8956(79)90021-2 ..
Shahrokhi, Farhad; Székely, László A.; Sýkora, Ondrej; Vrťo, Imrich (1996), «The book crossing number of a graph», Journal of Graph Theory 21 (4): 413-424, MR 1377615, doi:10.1002/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.3.CO;2-5 ..
Heath, Lenwood S. (1987), «Embedding outerplanar graphs in small books», SIAM Journal on Algebraic and Discrete Methods 8 (2): 198-218, MR 881181, doi:10.1137/0608018 ..
Stöhr, Elena (1988), «A trade-off between page number and page width of book embeddings of graphs», Information and Computation 79 (2): 155-162, MR 968104, doi:10.1016/0890-5401(88)90036-3 ..
Stöhr, Elena (1991), «The pagewidth of trivalent planar graphs», Discrete Mathematics 89 (1): 43-49, MR 1108073, doi:10.1016/0012-365X(91)90398-L ..
Enomoto, Hikoe; Miyauchi, Miki Shimabara (1999), «Embedding graphs into a three page book with $O (M log N)$ crossings of edges over the spine», SIAM Journal on Discrete Mathematics 12 (3): 337-341, MR 1710241, doi:10.1137/S0895480195280319 ..
Enomoto, Hikoe; Miyauchi, Miki Shimabara; Ota, Katsuhiro (1999), «Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph», Discrete Applied Mathematics 92 (2–3): 149-155, MR 1697548, doi:10.1016/S0166-218X(99)00044-X ..
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (2012), «The 2-page crossing number of $K n$ (extended abstract)», Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12), ACM, New York, pp. 397-403, MR 3050657, S2CID 8344088, doi:10.1145/2261250.2261310 ..
Para obtener resultados adicionales sobre el grosor del libro de gráficos bipartitos completos, consúltese Enomoto, Hikoe; Nakamigawa, Tomoki; Ota, Katsuhiro (1997), «On the pagenumber of complete bipartite graphs», Journal of Combinatorial Theory, Series B 71 (1): 111-120, MR 1469870, doi:10.1006/jctb.1997.1773 .; de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio (2014), «Book drawings of complete bipartite graphs», Discrete Applied Mathematics 167: 80-93, MR 3166108, S2CID 40920263, arXiv:1210.2918, doi:10.1016/j.dam.2013.11.001 ..
Sperfeld, Konrad (2013), «On the page number of complete odd-partite graphs», Discrete Mathematics 313 (17): 1689-1696, MR 3061004, doi:10.1016/j.disc.2013.04.028 ..
Hasunuma, Toru; Shibata, Yukio (1997), «Embedding de Bruijn, Kautz and shuffle-exchange networks in books», Discrete Applied Mathematics 78 (1–3): 103-116, MR 1475820, doi:10.1016/S0166-218X(97)00009-7 .; Tanaka, Yuuki; Shibata, Yukio (2010), «On the pagenumber of the cube-connected cycles», Mathematics in Computer Science 3 (1): 109-117, MR 2596254, S2CID 11830437, doi:10.1007/s11786-009-0012-y .. See also Obrenić, Bojana (1993), «Embedding de Bruijn and shuffle-exchange graphs in five pages», SIAM Journal on Discrete Mathematics 6 (4): 642-654, MR 1241401, doi:10.1137/0406049 ..
Ganley, Joseph L.; Heath, Lenwood S. (2001), «The pagenumber of $k$ -trees is $O (k)$ », Discrete Applied Mathematics 109 (3): 215-221, MR 1818238, doi:10.1016/S0166-218X(00)00178-5 ..
Malitz, Seth M. (1994), «Graphs with $E$ edges have pagenumber $O (\sqrt E)$ », Journal of Algorithms 17 (1): 71-84, MR 1279269, doi:10.1006/jagm.1994.1027 ..
Malitz, Seth M. (1994), «Genus $g$ graphs have pagenumber $O (\sqrt g)$ », Journal of Algorithms 17 (1): 85-109, MR 1279270, doi:10.1006/jagm.1994.1028 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics 28, Springer, pp. 321-328, ISBN 978-3-642-27874-7, MR 2920058, doi:10.1007/978-3-642-27875-4 ..
Barát, János; Matoušek, Jiří; Wood, David R. (2006), «Bounded-degree graphs have arbitrarily large geometric thickness», Electronic Journal of Combinatorics 13 (1): R3, MR 2200531, doi:10.37236/1029 ..
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, Bibcode:2015arXiv150105020D, arXiv:1501.05020 ., mejorando un resultado anterior que mostraba la existencia de expansores con número de página constante de Bourgain, Jean (2009), «Expanders and dimensional expansion», Comptes Rendus Mathématique 347 (7–8): 357-362, MR 2537230, doi:10.1016/j.crma.2009.02.009 .; Bourgain, Jean; Yehudayoff, Amir (2013), «Expansion in $\mathrm {SL} _{2}(\mathbb {R} )$ and monotone expanders», Geometric and Functional Analysis 23 (1): 1-41, MR 3037896, S2CID 121554827, doi:10.1007/s00039-012-0200-9 .. See also Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On 3-pushdown graphs with large separators», Combinatorica 9 (1): 9-19, MR 1010295, S2CID 37506294, doi:10.1007/BF02122679 .; Dvir, Zeev; Wigderson, Avi (2010), «Monotone expanders: constructions and applications», Theory of Computing 6: 291-308, MR 2770077, doi:10.4086/toc.2010.v006a012 ..
Heath, Lenwood S.; Rosenberg, Arnold L. (1992), «Laying out graphs using queues», SIAM Journal on Computing 21 (5): 927-958, MR 1181408, doi:10.1137/0221055 ..
Dujmović, Vida; Wood, David R. (2004), «On linear layouts of graphs», Discrete Mathematics & Theoretical Computer Science 6 (2): 339-357, MR 2081479 ..
Masuda, Sumio; Nakajima, Kazuo; Kashiwabara, Toshinobu; Fujisawa, Toshio (1990), «Crossing minimization in linear embeddings of graphs», IEEE Transactions on Computers 39 (1): 124-127, MR 1032144, doi:10.1109/12.46286 ..
Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H. (1980), «The complexity of coloring circular arcs and chords», SIAM Journal on Algebraic and Discrete Methods 1 (2): 216-227, MR 578325, doi:10.1137/0601025 ..
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, MR 3067219, S2CID 15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2008), «Grad and classes with bounded expansion. II. Algorithmic aspects», European Journal of Combinatorics 29 (3): 777-791, MR 2397336, S2CID 1139740, arXiv:math/0508324, doi:10.1016/j.ejc.2006.07.014 ..
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, MR 885282 ..
Knuth, Donald E. (1968), The Art Of Computer Programming Vol. 1, Boston: Addison-Wesley, Section 2.2.1, Exercises 4 and 5, ISBN 0-201-89683-4, MR 0286317, OCLC 155842391 ..
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, MR 1041623 ..
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 Algorithms 14: 150-172, MR 2922068, 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, MR 1962433, doi:10.1007/3-540-45848-4_25 ..
Saaty, Thomas L. (1964), «The minimum number of intersections in complete graphs», Proceedings of the National Academy of Sciences 52 (3): 688-690, Bibcode:1964PNAS...52..688S, MR 0166772, PMC 300329, PMID 16591215, doi:10.1073/pnas.52.3.688 ..
Nicholson, T. A. J. (1968), «Permutation procedure for minimising the number of crossings in a network», Proceedings of the Institution of Electrical Engineers 115: 21-26, MR 0311416, 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, MR 3333228, arXiv:1408.6321, doi:10.1007/978-3-662-45803-7_18 ..
Pavan, A.; Tewari, Raghunath; Vinodchandran, N. V. (2012), «On the power of unambiguity in log-space», Computational Complexity 21 (4): 643-670, MR 2988774, S2CID 8666071, arXiv:1001.2034, doi:10.1007/s00037-012-0047-3 ..
McKenzie, Thomas; Overbay, Shannon (2010), «Book embeddings and zero divisors», Ars Combinatoria 95: 55-63, MR 2656248 ..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk 33 (4): 25-37, 96, MR 1746427, S2CID 121089736, doi:10.1007/BF02467109 ..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae 69 (3): 243-283, MR 1885279, S2CID 116488382, 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 ..

arxiv.org

Para obtener resultados adicionales sobre el grosor del libro de gráficos bipartitos completos, consúltese Enomoto, Hikoe; Nakamigawa, Tomoki; Ota, Katsuhiro (1997), «On the pagenumber of complete bipartite graphs», Journal of Combinatorial Theory, Series B 71 (1): 111-120, MR 1469870, doi:10.1006/jctb.1997.1773 .; de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio (2014), «Book drawings of complete bipartite graphs», Discrete Applied Mathematics 167: 80-93, MR 3166108, S2CID 40920263, arXiv:1210.2918, doi:10.1016/j.dam.2013.11.001 ..
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, ISBN 9783939897651, 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 Geomerty 1 (11): 332-353, arXiv:2004.07630 ..
Eppstein, David (2001), Separating geometric thickness from book thickness, Bibcode:2001math......9195E, arXiv:math.CO/0109195 ..
Dujmović, Vida; Eppstein, David; Hickingbotham, Robert; Morin, Pat; Wood, David R. (August 2021), «Stack-number is not bounded by queue-number», Combinatorica, arXiv:2011.04195, doi:10.1007/s00493-021-4585-7 .
Dujmović, Vida; Wood, David R. (2007), «Graph treewidth and geometric thickness parameters», Discrete and Computational Geometry 37 (4): 641-670, S2CID 9141367, arXiv:math/0503553, doi:10.1007/s00454-007-1318-7 ..
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, Bibcode:2015arXiv150105020D, arXiv:1501.05020 ., mejorando un resultado anterior que mostraba la existencia de expansores con número de página constante de Bourgain, Jean (2009), «Expanders and dimensional expansion», Comptes Rendus Mathématique 347 (7–8): 357-362, MR 2537230, doi:10.1016/j.crma.2009.02.009 .; Bourgain, Jean; Yehudayoff, Amir (2013), «Expansion in $\mathrm {SL} _{2}(\mathbb {R} )$ and monotone expanders», Geometric and Functional Analysis 23 (1): 1-41, MR 3037896, S2CID 121554827, doi:10.1007/s00039-012-0200-9 .. See also Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On 3-pushdown graphs with large separators», Combinatorica 9 (1): 9-19, MR 1010295, S2CID 37506294, doi:10.1007/BF02122679 .; Dvir, Zeev; Wigderson, Avi (2010), «Monotone expanders: constructions and applications», Theory of Computing 6: 291-308, MR 2770077, doi:10.4086/toc.2010.v006a012 ..
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, MR 3067219, S2CID 15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2008), «Grad and classes with bounded expansion. II. Algorithmic aspects», European Journal of Combinatorics 29 (3): 777-791, MR 2397336, S2CID 1139740, arXiv:math/0508324, doi:10.1016/j.ejc.2006.07.014 ..
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, S2CID 10142319, 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, MR 3333228, arXiv:1408.6321, doi:10.1007/978-3-662-45803-7_18 ..
Pavan, A.; Tewari, Raghunath; Vinodchandran, N. V. (2012), «On the power of unambiguity in log-space», Computational Complexity 21 (4): 643-670, MR 2988774, S2CID 8666071, arXiv:1001.2034, doi:10.1007/s00037-012-0047-3 ..

doi.org

dx.doi.org

Persinger, C. A. (1966), «Subsets of $n$ -books in $E 3$ », Pacific Journal of Mathematics 18: 169-173, MR 0195077, doi:10.2140/pjm.1966.18.169 ..
Atneosen, Gail Adele (1968), On the embeddability of compacta in $n$ -books: intrinsic and extrinsic properties, Ph.D. thesis, Universidad Estatal de Míchigan, p. 79, MR 2617705 .. See also Atneosen, Gail H. (1972), «One-dimensional n-leaved continua», Fundamenta Mathematicae 74 (1): 43-45, MR 0293592, doi:10.4064/fm-74-1-43-45 ..
Yannakakis, Mihalis (1989), «Embedding planar graphs in four pages», Journal of Computer and System Sciences 38: 36-67, doi:10.1016/0022-0000(89)90032-9 .
Yannakakis, Mihalis (1986), «Four pages are necessary and sufficient for planar graphs», Proceedings of the 18th ACM Symposium on Theory of Computing (STOC '86), pp. 104-108, ISBN 0-89791-193-8, S2CID 5359519, doi:10.1145/12130.12141 ..
Haslinger, Christian; Stadler, Peter F. (1999), «RNA structures with pseudo-knots: Graph-theoretical, combinatorial, and statistical properties», Bulletin of Mathematical Biology 61 (3): 437-467, PMC 7197269, PMID 17883226, doi:10.1006/bulm.1998.0085 ..
Hales, T. C. (1997), «Sphere packings. II», Discrete and Computational Geometry 18 (2): 135-149, MR 1455511, doi:10.1007/PL00009312 ..
Bernhart, Frank R.; Kainen, Paul C. (1979), «The book thickness of a graph», Journal of Combinatorial Theory, Series B 27 (3): 320-331, MR 0554297, doi:10.1016/0095-8956(79)90021-2 ..
Shahrokhi, Farhad; Székely, László A.; Sýkora, Ondrej; Vrťo, Imrich (1996), «The book crossing number of a graph», Journal of Graph Theory 21 (4): 413-424, MR 1377615, doi:10.1002/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.3.CO;2-5 ..
Heath, Lenwood S. (1987), «Embedding outerplanar graphs in small books», SIAM Journal on Algebraic and Discrete Methods 8 (2): 198-218, MR 881181, doi:10.1137/0608018 ..
Stöhr, Elena (1988), «A trade-off between page number and page width of book embeddings of graphs», Information and Computation 79 (2): 155-162, MR 968104, doi:10.1016/0890-5401(88)90036-3 ..
Stöhr, Elena (1991), «The pagewidth of trivalent planar graphs», Discrete Mathematics 89 (1): 43-49, MR 1108073, doi:10.1016/0012-365X(91)90398-L ..
Enomoto, Hikoe; Miyauchi, Miki Shimabara (1999), «Embedding graphs into a three page book with $O (M log N)$ crossings of edges over the spine», SIAM Journal on Discrete Mathematics 12 (3): 337-341, MR 1710241, doi:10.1137/S0895480195280319 ..
Enomoto, Hikoe; Miyauchi, Miki Shimabara; Ota, Katsuhiro (1999), «Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph», Discrete Applied Mathematics 92 (2–3): 149-155, MR 1697548, doi:10.1016/S0166-218X(99)00044-X ..
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (2012), «The 2-page crossing number of $K n$ (extended abstract)», Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12), ACM, New York, pp. 397-403, MR 3050657, S2CID 8344088, doi:10.1145/2261250.2261310 ..
Para obtener resultados adicionales sobre el grosor del libro de gráficos bipartitos completos, consúltese Enomoto, Hikoe; Nakamigawa, Tomoki; Ota, Katsuhiro (1997), «On the pagenumber of complete bipartite graphs», Journal of Combinatorial Theory, Series B 71 (1): 111-120, MR 1469870, doi:10.1006/jctb.1997.1773 .; de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio (2014), «Book drawings of complete bipartite graphs», Discrete Applied Mathematics 167: 80-93, MR 3166108, S2CID 40920263, arXiv:1210.2918, doi:10.1016/j.dam.2013.11.001 ..
Sperfeld, Konrad (2013), «On the page number of complete odd-partite graphs», Discrete Mathematics 313 (17): 1689-1696, MR 3061004, doi:10.1016/j.disc.2013.04.028 ..
Hasunuma, Toru; Shibata, Yukio (1997), «Embedding de Bruijn, Kautz and shuffle-exchange networks in books», Discrete Applied Mathematics 78 (1–3): 103-116, MR 1475820, doi:10.1016/S0166-218X(97)00009-7 .; Tanaka, Yuuki; Shibata, Yukio (2010), «On the pagenumber of the cube-connected cycles», Mathematics in Computer Science 3 (1): 109-117, MR 2596254, S2CID 11830437, doi:10.1007/s11786-009-0012-y .. See also Obrenić, Bojana (1993), «Embedding de Bruijn and shuffle-exchange graphs in five pages», SIAM Journal on Discrete Mathematics 6 (4): 642-654, MR 1241401, doi:10.1137/0406049 ..
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, ISBN 9783939897651, 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 ..
Dujmović, Vida; Eppstein, David; Hickingbotham, Robert; Morin, Pat; Wood, David R. (August 2021), «Stack-number is not bounded by queue-number», Combinatorica, arXiv:2011.04195, doi:10.1007/s00493-021-4585-7 .
Dujmović, Vida; Wood, David R. (2007), «Graph treewidth and geometric thickness parameters», Discrete and Computational Geometry 37 (4): 641-670, S2CID 9141367, arXiv:math/0503553, doi:10.1007/s00454-007-1318-7 ..
Ganley, Joseph L.; Heath, Lenwood S. (2001), «The pagenumber of $k$ -trees is $O (k)$ », Discrete Applied Mathematics 109 (3): 215-221, MR 1818238, doi:10.1016/S0166-218X(00)00178-5 ..
Malitz, Seth M. (1994), «Graphs with $E$ edges have pagenumber $O (\sqrt E)$ », Journal of Algorithms 17 (1): 71-84, MR 1279269, doi:10.1006/jagm.1994.1027 ..
Malitz, Seth M. (1994), «Genus $g$ graphs have pagenumber $O (\sqrt g)$ », Journal of Algorithms 17 (1): 85-109, MR 1279270, doi:10.1006/jagm.1994.1028 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics 28, Springer, pp. 321-328, ISBN 978-3-642-27874-7, MR 2920058, doi:10.1007/978-3-642-27875-4 ..
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 ..
Barát, János; Matoušek, Jiří; Wood, David R. (2006), «Bounded-degree graphs have arbitrarily large geometric thickness», Electronic Journal of Combinatorics 13 (1): R3, MR 2200531, doi:10.37236/1029 ..
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, Bibcode:2015arXiv150105020D, arXiv:1501.05020 ., mejorando un resultado anterior que mostraba la existencia de expansores con número de página constante de Bourgain, Jean (2009), «Expanders and dimensional expansion», Comptes Rendus Mathématique 347 (7–8): 357-362, MR 2537230, doi:10.1016/j.crma.2009.02.009 .; Bourgain, Jean; Yehudayoff, Amir (2013), «Expansion in $\mathrm {SL} _{2}(\mathbb {R} )$ and monotone expanders», Geometric and Functional Analysis 23 (1): 1-41, MR 3037896, S2CID 121554827, doi:10.1007/s00039-012-0200-9 .. See also Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On 3-pushdown graphs with large separators», Combinatorica 9 (1): 9-19, MR 1010295, S2CID 37506294, doi:10.1007/BF02122679 .; Dvir, Zeev; Wigderson, Avi (2010), «Monotone expanders: constructions and applications», Theory of Computing 6: 291-308, MR 2770077, doi:10.4086/toc.2010.v006a012 ..
Heath, Lenwood S.; Rosenberg, Arnold L. (1992), «Laying out graphs using queues», SIAM Journal on Computing 21 (5): 927-958, MR 1181408, doi:10.1137/0221055 ..
Chung, Fan R. K.; Leighton, Frank Thompson; Rosenberg, Arnold L. (1987), «Embedding graphs in books: A layout problem with applications to VLSI design», SIAM Journal on Algebraic and Discrete Methods 8 (1): 33-58, doi:10.1137/0608002 ..
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 ..
Masuda, Sumio; Nakajima, Kazuo; Kashiwabara, Toshinobu; Fujisawa, Toshio (1990), «Crossing minimization in linear embeddings of graphs», IEEE Transactions on Computers 39 (1): 124-127, MR 1032144, doi:10.1109/12.46286 ..
Garey, M. R.; Johnson, D. S.; Miller, G. L.; Papadimitriou, C. H. (1980), «The complexity of coloring circular arcs and chords», SIAM Journal on Algebraic and Discrete Methods 1 (2): 216-227, MR 578325, doi:10.1137/0601025 ..
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, MR 3067219, S2CID 15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2008), «Grad and classes with bounded expansion. II. Algorithmic aspects», European Journal of Combinatorics 29 (3): 777-791, MR 2397336, S2CID 1139740, arXiv:math/0508324, doi:10.1016/j.ejc.2006.07.014 ..
Wattenberg, M. (2002), «Arc diagrams: visualizing structure in strings», Proceedings of IEEE Symposium on Information Visualization (INFOVIS 2002), pp. 110-116, S2CID 881989, doi:10.1109/INFVIS.2002.1173155 ..
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 Algorithms 14: 150-172, MR 2922068, 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, MR 1962433, doi:10.1007/3-540-45848-4_25 ..
Saaty, Thomas L. (1964), «The minimum number of intersections in complete graphs», Proceedings of the National Academy of Sciences 52 (3): 688-690, Bibcode:1964PNAS...52..688S, MR 0166772, PMC 300329, PMID 16591215, doi:10.1073/pnas.52.3.688 ..
Nicholson, T. A. J. (1968), «Permutation procedure for minimising the number of crossings in a network», Proceedings of the Institution of Electrical Engineers 115: 21-26, MR 0311416, 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, S2CID 10142319, 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, MR 3333228, 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 ..
Clote, Peter; Dobrev, Stefan; Dotu, Ivan; Kranakis, Evangelos; Krizanc, Danny; Urrutia, Jorge (2012), «On the page number of RNA secondary structures with pseudoknots», Journal of Mathematical Biology 65 (6–7): 1337-1357, PMID 22159642, S2CID 8700502, doi:10.1007/s00285-011-0493-6 ..
Pavan, A.; Tewari, Raghunath; Vinodchandran, N. V. (2012), «On the power of unambiguity in log-space», Computational Complexity 21 (4): 643-670, MR 2988774, S2CID 8666071, arXiv:1001.2034, doi:10.1007/s00037-012-0047-3 ..
Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines», Journal of Computer and System Sciences 38 (1): 134-149, doi:10.1016/0022-0000(89)90036-6 ..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk 33 (4): 25-37, 96, MR 1746427, S2CID 121089736, doi:10.1007/BF02467109 ..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae 69 (3): 243-283, MR 1885279, S2CID 116488382, doi:10.1023/A:1014299416618 ..

harvard.edu

adsabs.harvard.edu

Eppstein, David (2001), Separating geometric thickness from book thickness, Bibcode:2001math......9195E, arXiv:math.CO/0109195 ..
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, Bibcode:2015arXiv150105020D, arXiv:1501.05020 ., mejorando un resultado anterior que mostraba la existencia de expansores con número de página constante de Bourgain, Jean (2009), «Expanders and dimensional expansion», Comptes Rendus Mathématique 347 (7–8): 357-362, MR 2537230, doi:10.1016/j.crma.2009.02.009 .; Bourgain, Jean; Yehudayoff, Amir (2013), «Expansion in $\mathrm {SL} _{2}(\mathbb {R} )$ and monotone expanders», Geometric and Functional Analysis 23 (1): 1-41, MR 3037896, S2CID 121554827, doi:10.1007/s00039-012-0200-9 .. See also Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On 3-pushdown graphs with large separators», Combinatorica 9 (1): 9-19, MR 1010295, S2CID 37506294, doi:10.1007/BF02122679 .; Dvir, Zeev; Wigderson, Avi (2010), «Monotone expanders: constructions and applications», Theory of Computing 6: 291-308, MR 2770077, doi:10.4086/toc.2010.v006a012 ..
Saaty, Thomas L. (1964), «The minimum number of intersections in complete graphs», Proceedings of the National Academy of Sciences 52 (3): 688-690, Bibcode:1964PNAS...52..688S, MR 0166772, PMC 300329, PMID 16591215, doi:10.1073/pnas.52.3.688 ..
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 ..

icm.edu.pl

matwbn.icm.edu.pl

Atneosen, Gail Adele (1968), On the embeddability of compacta in $n$ -books: intrinsic and extrinsic properties, Ph.D. thesis, Universidad Estatal de Míchigan, p. 79, MR 2617705 .. See also Atneosen, Gail H. (1972), «One-dimensional n-leaved continua», Fundamenta Mathematicae 74 (1): 43-45, MR 0293592, doi:10.4064/fm-74-1-43-45 ..

kit.edu

publikationen.bibliothek.kit.edu

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 ..

kyoto-u.ac.jp

www-or.amp.i.kyoto-u.ac.jp

Hong, Seok-Hee; Nagamochi, Hiroshi (2009), Two-page book embedding and clustered graph planarity, Technical report (2009-004 edición), Dept. of Applied Mathematics and Physics, University of Kyoto, Japan, archivado desde el original el 24 de septiembre de 2020, consultado el 2 de septiembre de 2022 ..

lboro.ac.uk

dspace.lboro.ac.uk

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 ..

nih.gov

ncbi.nlm.nih.gov

Haslinger, Christian; Stadler, Peter F. (1999), «RNA structures with pseudo-knots: Graph-theoretical, combinatorial, and statistical properties», Bulletin of Mathematical Biology 61 (3): 437-467, PMC 7197269, PMID 17883226, doi:10.1006/bulm.1998.0085 ..
Saaty, Thomas L. (1964), «The minimum number of intersections in complete graphs», Proceedings of the National Academy of Sciences 52 (3): 688-690, Bibcode:1964PNAS...52..688S, MR 0166772, PMC 300329, PMID 16591215, doi:10.1073/pnas.52.3.688 ..
Clote, Peter; Dobrev, Stefan; Dotu, Ivan; Kranakis, Evangelos; Krizanc, Danny; Urrutia, Jorge (2012), «On the page number of RNA secondary structures with pseudoknots», Journal of Mathematical Biology 65 (6–7): 1337-1357, PMID 22159642, S2CID 8700502, doi:10.1007/s00285-011-0493-6 ..

proquest.com

gateway.proquest.com

Atneosen, Gail Adele (1968), On the embeddability of compacta in $n$ -books: intrinsic and extrinsic properties, Ph.D. thesis, Universidad Estatal de Míchigan, p. 79, MR 2617705 .. See also Atneosen, Gail H. (1972), «One-dimensional n-leaved continua», Fundamenta Mathematicae 74 (1): 43-45, MR 0293592, doi:10.4064/fm-74-1-43-45 ..

semanticscholar.org

api.semanticscholar.org

Yannakakis, Mihalis (1986), «Four pages are necessary and sufficient for planar graphs», Proceedings of the 18th ACM Symposium on Theory of Computing (STOC '86), pp. 104-108, ISBN 0-89791-193-8, S2CID 5359519, doi:10.1145/12130.12141 ..
Ábrego, Bernardo M.; Aichholzer, Oswin; Fernández-Merchant, Silvia; Ramos, Pedro; Salazar, Gelasio (2012), «The 2-page crossing number of $K n$ (extended abstract)», Proceedings of the 28th Annual Symposium on Computational Geometry (SCG'12), ACM, New York, pp. 397-403, MR 3050657, S2CID 8344088, doi:10.1145/2261250.2261310 ..
Para obtener resultados adicionales sobre el grosor del libro de gráficos bipartitos completos, consúltese Enomoto, Hikoe; Nakamigawa, Tomoki; Ota, Katsuhiro (1997), «On the pagenumber of complete bipartite graphs», Journal of Combinatorial Theory, Series B 71 (1): 111-120, MR 1469870, doi:10.1006/jctb.1997.1773 .; de Klerk, Etienne; Pasechnik, Dmitrii V.; Salazar, Gelasio (2014), «Book drawings of complete bipartite graphs», Discrete Applied Mathematics 167: 80-93, MR 3166108, S2CID 40920263, arXiv:1210.2918, doi:10.1016/j.dam.2013.11.001 ..
Hasunuma, Toru; Shibata, Yukio (1997), «Embedding de Bruijn, Kautz and shuffle-exchange networks in books», Discrete Applied Mathematics 78 (1–3): 103-116, MR 1475820, doi:10.1016/S0166-218X(97)00009-7 .; Tanaka, Yuuki; Shibata, Yukio (2010), «On the pagenumber of the cube-connected cycles», Mathematics in Computer Science 3 (1): 109-117, MR 2596254, S2CID 11830437, doi:10.1007/s11786-009-0012-y .. See also Obrenić, Bojana (1993), «Embedding de Bruijn and shuffle-exchange graphs in five pages», SIAM Journal on Discrete Mathematics 6 (4): 642-654, MR 1241401, doi:10.1137/0406049 ..
Dujmović, Vida; Wood, David R. (2007), «Graph treewidth and geometric thickness parameters», Discrete and Computational Geometry 37 (4): 641-670, S2CID 9141367, arXiv:math/0503553, doi:10.1007/s00454-007-1318-7 ..
Dujmović, Vida; Sidiropoulos, Anastasios; Wood, David R. (2015), 3-Monotone Expanders, Bibcode:2015arXiv150105020D, arXiv:1501.05020 ., mejorando un resultado anterior que mostraba la existencia de expansores con número de página constante de Bourgain, Jean (2009), «Expanders and dimensional expansion», Comptes Rendus Mathématique 347 (7–8): 357-362, MR 2537230, doi:10.1016/j.crma.2009.02.009 .; Bourgain, Jean; Yehudayoff, Amir (2013), «Expansion in $\mathrm {SL} _{2}(\mathbb {R} )$ and monotone expanders», Geometric and Functional Analysis 23 (1): 1-41, MR 3037896, S2CID 121554827, doi:10.1007/s00039-012-0200-9 .. See also Galil, Zvi; Kannan, Ravi; Szemerédi, Endre (1989), «On 3-pushdown graphs with large separators», Combinatorica 9 (1): 9-19, MR 1010295, S2CID 37506294, doi:10.1007/BF02122679 .; Dvir, Zeev; Wigderson, Avi (2010), «Monotone expanders: constructions and applications», Theory of Computing 6: 291-308, MR 2770077, doi:10.4086/toc.2010.v006a012 ..
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, MR 3067219, S2CID 15360191, arXiv:1209.0598, doi:10.1007/978-3-642-36763-2_8 ..
Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2008), «Grad and classes with bounded expansion. II. Algorithmic aspects», European Journal of Combinatorics 29 (3): 777-791, MR 2397336, S2CID 1139740, arXiv:math/0508324, doi:10.1016/j.ejc.2006.07.014 ..
Wattenberg, M. (2002), «Arc diagrams: visualizing structure in strings», Proceedings of IEEE Symposium on Information Visualization (INFOVIS 2002), pp. 110-116, S2CID 881989, doi:10.1109/INFVIS.2002.1173155 ..
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, S2CID 10142319, arXiv:1308.5741, doi:10.1007/978-3-319-03841-4_30 ..
Clote, Peter; Dobrev, Stefan; Dotu, Ivan; Kranakis, Evangelos; Krizanc, Danny; Urrutia, Jorge (2012), «On the page number of RNA secondary structures with pseudoknots», Journal of Mathematical Biology 65 (6–7): 1337-1357, PMID 22159642, S2CID 8700502, doi:10.1007/s00285-011-0493-6 ..
Pavan, A.; Tewari, Raghunath; Vinodchandran, N. V. (2012), «On the power of unambiguity in log-space», Computational Complexity 21 (4): 643-670, MR 2988774, S2CID 8666071, arXiv:1001.2034, doi:10.1007/s00037-012-0047-3 ..
Dynnikov, I. A. (1999), «Three-page approach to knot theory. Coding and local motions», Rossiĭskaya Akademiya Nauk 33 (4): 25-37, 96, MR 1746427, S2CID 121089736, doi:10.1007/BF02467109 ..
Dynnikov, I. A. (2001), «A new way to represent links, one-dimensional formalism and untangling technology», Acta Applicandae Mathematicae 69 (3): 243-283, MR 1885279, S2CID 116488382, doi:10.1023/A:1014299416618 ..

ucsd.edu

math.ucsd.edu

Chung, Fan R. K.; Leighton, Frank Thompson; Rosenberg, Arnold L. (1987), «Embedding graphs in books: A layout problem with applications to VLSI design», SIAM Journal on Algebraic and Discrete Methods 8 (1): 33-58, doi:10.1137/0608002 ..

web.archive.org

Hong, Seok-Hee; Nagamochi, Hiroshi (2009), Two-page book embedding and clustered graph planarity, Technical report (2009-004 edición), Dept. of Applied Mathematics and Physics, University of Kyoto, Japan, archivado desde el original el 24 de septiembre de 2020, consultado el 2 de septiembre de 2022 ..

worldcat.org

Knuth, Donald E. (1968), The Art Of Computer Programming Vol. 1, Boston: Addison-Wesley, Section 2.2.1, Exercises 4 and 5, ISBN 0-201-89683-4, MR 0286317, OCLC 155842391 ..