Könyvbe ágyazás (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Könyvbe ágyazás" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

50doi.org

2^nd place

8^th place

1proquest.com

206^th place

9,716^th place

1icm.edu.pl

2,656^th place

8,986^th place

1psu.edu

207^th place

1,149^th place

1openproblemgarden.org

low place

1combinatorics.org

low place

1ucsd.edu

1,933^rd place

1,497^th place

1kyoto-u.ac.jp

2,913^th place

8,980^th place

1web.archive.org

1^st place

1worldcat.org

5^th place

22^nd place

1lboro.ac.uk

4,065^th place

7,699^th place

combinatorics.org

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, <http://www.combinatorics.org/Volume_13/Abstracts/v13i1r3.html>.

doi.org

dx.doi.org

Persinger, C. A. (1966), "Subsets of $n$ -books in $E 3$ ", Pacific Journal of Mathematics 18: 169–173, DOI 10.2140/pjm.1966.18.169.
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, 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, DOI 10.1006/bulm.1998.0085.
Hales, T. C. (1997), "Sphere packings. II", Discrete and Computational Geometry 18 (2): 135–149, 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, DOI 10.1016/0095-8956(79)90021-2.
Shahrokhi, Farhad; Székely, László A. & Sýkora, Ondrej et al. (1996), "The book crossing number of a graph", Journal of Graph Theory 21 (4): 413–424, 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, 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, DOI 10.1016/0890-5401(88)90036-3.
Stöhr, Elena (1991), "The pagewidth of trivalent planar graphs", Discrete Mathematics 89 (1): 43–49, 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, 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, DOI 10.1016/S0166-218X(99)00044-X.
Ábrego, Bernardo M.; Aichholzer, Oswin & Fernández-Merchant, Silvia et al. (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, DOI 10.1145/2261250.2261310.
A teljes páros gráfok könyvvastagságáról további eredményekhez lásd Enomoto, Hikoe; Nakamigawa, Tomoki & Ota, Katsuhiro (1997), "On the pagenumber of complete bipartite graphs", Journal of Combinatorial Theory, Series B 71 (1): 111–120, 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, 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, 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, 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, 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, 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, pp. 137–148, 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 & Wood, David R. (2007), "Graph treewidth and geometric thickness parameters", Discrete and Computational Geometry 37 (4): 641–670, 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, 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, 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, DOI 10.1006/jagm.1994.1028.
Nešetřil, Jaroslav & Ossona de Mendez, Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, vol. 28, Algorithms and Combinatorics, Springer, pp. 321–328, ISBN 978-3-642-27874-7, DOI 10.1007/978-3-642-27875-4.
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.
Dujmović, Vida; Sidiropoulos, Anastasios & Wood, David R. (2015), 3-Monotone Expanders, egy korábbi eredményt javítva, ami megmutatta a konstans lapszámú expanderek létezését: Bourgain, Jean (2009), "Expanders and dimensional expansion", Comptes Rendus Mathématique 347 (7-8): 357–362, DOI 10.1016/j.crma.2009.02.009; Bourgain, Jean & Yehudayoff, Amir (2013), "Expansion in $SL 2 (ℝ)$ and monotone expanders", Geometric and Functional Analysis 23 (1): 1–41, DOI 10.1007/s00039-012-0200-9. Lásd még Galil, Zvi; Kannan, Ravi & Szemerédi, Endre (1989), "On 3-pushdown graphs with large separators", Combinatorica 9 (1): 9–19, DOI 10.1007/BF02122679; Dvir, Zeev & Wigderson, Avi (2010), "Monotone expanders: constructions and applications", Theory of Computing 6: 291–308, 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, 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, <http://www.math.ucsd.edu/~fan/mypaps/fanpap/fc82embedding.pdf>.
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.
Unger, Walter (1988), "On the k-colouring of circle-graphs", Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science (STACS '88), vol. 294, Lecture Notes in Computer Science, Springer-Verlag, pp. 61–72, DOI 10.1007/BFb0035832.
Masuda, Sumio; Nakajima, Kazuo & Kashiwabara, Toshinobu et al. (1990), "Crossing minimization in linear embeddings of graphs", IEEE Transactions on Computers 39 (1): 124–127, DOI 10.1109/12.46286.
Garey, M. R.; Johnson, D. S. & Miller, G. L. et al. (1980), "The complexity of coloring circular arcs and chords", SIAM Journal on Algebraic and Discrete Methods 1 (2): 216–227, 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, vol. 7704, Lecture Notes in Computer Science, Springer, pp. 79–89, 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, 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, DOI 10.1109/INFVIS.2002.1173155.
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.
Angelini, Patrizio; Di Battista, Giuseppe & Frati, Fabrizio et al. (2012), "Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph", Journal of Discrete Algorithms 14: 150–172, 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, vol. 2265, Lecture Notes in Computer Science, Springer, Berlin, pp. 312–327, 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 of the United States of America 52: 688–690, 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, 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, DOI 10.1093/ietfec/e89-a.5.1223.
Giordano, Francesco; Liotta, Giuseppe & Mchedlidze, Tamara et al. (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, vol. 4835, Lecture Notes in Computer Science, Springer, pp. 172–183, DOI 10.1007/978-3-540-77120-3_17.
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.
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, Bordeaux, France, September 23–25, 2013, Revised Selected Papers, vol. 8242, Lecture Notes in Computer Science, pp. 340–351, 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), vol. 8871, Lecture Notes in Computer Science, Springer-Verlag, pp. 210–221, DOI 10.1007/10.1007/978-3-662-45803-7_18.
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.
Clote, Peter; Dobrev, Stefan & Dotu, Ivan et al. (2012), "On the page number of RNA secondary structures with pseudoknots", Journal of Mathematical Biology 65 (6–7): 1337–1357, 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, 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, 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, DOI 10.1023/A:1014299416618.

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, Michigan State University, p. 79, <http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:6905835>. Lásd még Atneosen, Gail H. (1972), "One-dimensional n-leaved continua", Fundamenta Mathematicae 74 (1): 43–45, <http://matwbn.icm.edu.pl/ksiazki/fm/fm74/fm7415.pdf>.

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 (2009-004 ed.), Technical report, Dept. of Applied Mathematics and Physics, University of Kyoto, Japan, <http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical_report/TR2009-004.pdf> Archiválva 2020. szeptember 24-i dátummal a Wayback Machine-ben.

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, <https://dspace.lboro.ac.uk/2134/2386>.

openproblemgarden.org

Wood, David (January 19, 2009), Book Thickness of Subdivisions, <http://www.openproblemgarden.org/op/book_thickness_of_subdivisions>. Hozzáférés ideje: 2013-02-05.

proquest.com

gateway.proquest.com

Atneosen, Gail Adele (1968), On the embeddability of compacta in $n$ -books: intrinsic and extrinsic properties, Ph.D. thesis, Michigan State University, p. 79, <http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:6905835>. Lásd még Atneosen, Gail H. (1972), "One-dimensional n-leaved continua", Fundamenta Mathematicae 74 (1): 43–45, <http://matwbn.icm.edu.pl/ksiazki/fm/fm74/fm7415.pdf>.

psu.edu

citeseerx.ist.psu.edu

Blankenship, Robin & Oporowski, Bogdan (1999), Drawing Subdivisions Of Complete And Complete Bipartite Graphs On Books, Technical Report 1999-4, Department of Mathematics, Louisiana State University, <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4358>.

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, <http://www.math.ucsd.edu/~fan/mypaps/fanpap/fc82embedding.pdf>.

web.archive.org

Hong, Seok-Hee & Nagamochi, Hiroshi (2009), Two-page book embedding and clustered graph planarity (2009-004 ed.), Technical report, Dept. of Applied Mathematics and Physics, University of Kyoto, Japan, <http://www-or.amp.i.kyoto-u.ac.jp/members/nag/Technical_report/TR2009-004.pdf> Archiválva 2020. szeptember 24-i dátummal a Wayback Machine-ben.

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, OCLC 155842391.