{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:02:19Z","timestamp":1743001339496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299709"},{"type":"electronic","value":"9783319299716"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29971-6_6","type":"book-chapter","created":{"date-parts":[[2016,2,11]],"date-time":"2016-02-11T15:31:37Z","timestamp":1455204697000},"page":"99-122","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book"],"prefix":"10.1007","author":[{"given":"Vitaliy","family":"Kurlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Smithers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.: The book thickness of a graph. J. Comb. Theory B 27, 320\u2013331 (1979)","journal-title":"J. Comb. Theory B"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2007.10.018","volume":"392","author":"S Biasotti","year":"2008","unstructured":"Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theoret. Comput. Sci. 392, 5\u201322 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR3","unstructured":"Boost C++ Libraries (version 1.59.0). \n                    http:\/\/www.boost.org"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00200-014-0244-1","volume":"26","author":"P Brendel","year":"2015","unstructured":"Brendel, P., Dlotko, P., Ellis, G., Juda, M., Mrozek, M.: Computing fundamental groups from point clouds. Appl. Algebra Eng. Commun. Comp. 26, 27\u201348 (2015)","journal-title":"Appl. Algebra Eng. Commun. Comp."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.: Curve-constrained drawings of planar graphs. Comput. Geom. 30, 1\u201323 (2005)","journal-title":"Comput. Geom."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/S0895480195280319","volume":"12","author":"H Enomoto","year":"1999","unstructured":"Enomoto, H., Miyauchi, M.: Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. SIAM J. Discrete Math. 12, 337\u2013341 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix De","year":"1990","unstructured":"De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1090\/S0002-9947-1989-0946218-0","volume":"311","author":"L Kauffman","year":"1989","unstructured":"Kauffman, L.: Invariants of graphs in three-space. Trans. AMS 311, 697\u2013710 (1989)","journal-title":"Trans. AMS"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.2140\/agt.2008.8.1223","volume":"8","author":"C Kearton","year":"2008","unstructured":"Kearton, C., Kurlin, V.: All 2-dimensional links live inside a universal 3-dimensional polyhedron. Algebraic Geom. Topology 8(3), 1223\u20131247 (2008)","journal-title":"Algebraic Geom. Topology"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1023\/A:1012339231182","volume":"35","author":"V Kurlin","year":"2001","unstructured":"Kurlin, V.: Dynnikov three-page diagrams of spatial 3-valent graphs. Funct. Anal. Appl. 35(3), 230\u2013233 (2001)","journal-title":"Funct. Anal. Appl."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S021821650700521X","volume":"16","author":"V Kurlin","year":"2007","unstructured":"Kurlin, V.: Three-page encoding and complexity theory for spatial graphs. J. Knot Theory Ramifications 16(1), 59\u2013102 (2007)","journal-title":"J. Knot Theory Ramifications"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S0305004108001151","volume":"145","author":"V Kurlin","year":"2008","unstructured":"Kurlin, V.: Gauss paragraphs of classical links and a characterization of virtual link groups. Math. Proc. Cambridge Philos. Soc. 145(1), 129\u2013140 (2008)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kurlin, V.: A linear time algorithm for visualizing knotted structures in 3 pages. In: Proceedings of Information Visualization Theory and Applications, IVAPP 2015, pp. 5\u201316 (2015)","DOI":"10.5220\/0005259900050016"},{"key":"6_CR14","unstructured":"Kurlin, V.: Computing invariants of knotted graphs given by sequences of points in 3-dimensional space. In: Proceedings of Topology-Based Methods in Visualization, TopoInVis 2015 (2015)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1023\/B:FAIA.0000024864.64045.de","volume":"38","author":"V Kurlin","year":"2004","unstructured":"Kurlin, V., Vershinin, V.: Three-page embeddings of singular knots. Funct. Anal. Appl. 38(1), 14\u201327 (2004)","journal-title":"Funct. Anal. Appl."},{"key":"6_CR16","volume-title":"Learning with Kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)"},{"key":"6_CR17","unstructured":"Smithers, C.: A linear time algorithm for embedding arbitrary knotted graphs into a 3-page book. MSc thesis, Durham University, UK (2015)"},{"issue":"6038","key":"6_CR18","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1126\/science.1205705","volume":"333","author":"U Tkalec","year":"2011","unstructured":"Tkalec, U., Ravnik, M., Copar, S., Zumer, S., Musevic, I.: Reconfigurable knots and links in chiral nematic colloids. Science 333(6038), 62\u201365 (2011)","journal-title":"Science"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932)","journal-title":"Am. J. Math."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comp. Syst. Sci. 38, 36\u201367 (1989)","journal-title":"J. Comp. Syst. Sci."}],"container-title":["Communications in Computer and Information Science","Computer Vision, Imaging and Computer Graphics Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29971-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:44:36Z","timestamp":1558392276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29971-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299709","9783319299716"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29971-6_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}