{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:20:22Z","timestamp":1769584822430,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_19","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"224-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Experimental Evaluation of Book Drawing Algorithms"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Klawitter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"19_CR1","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs. CoRR, abs\/1510.05891, October 2015. http:\/\/arxiv.org\/abs\/1510.05891"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-45803-7_18","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 210\u2013221. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_18"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, R., Srivastava, K., Varshney, K., Sharma, N., et al.: An evolutionary algorithm for the 2-page crossing number problem. In: Evolutionary Computation (CEC 2008), pp. 1095\u20131102. IEEE, June 2008. https:\/\/doi.org\/10.1109\/CEC.2008.4630933","DOI":"10.1109\/CEC.2008.4630933"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 332\u2013343. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_28"},{"issue":"3","key":"19_CR5","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.C.: The book thickness of a graph. J. Comb. Theor. Ser. B 27(3), 320\u2013331 (1979). http:\/\/dx.doi.org\/10.1016\/0095-8956(79)90021-2","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to vlsi design. SIAM J. Algebraic Discrete Methods 8(1), 33\u201358 (1987). http:\/\/dx.doi.org\/10.1137\/0608002","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"19_CR7","unstructured":"Cibulka, J.: Simulated annealing book embedder (2015). https:\/\/github.com\/josefcibulka\/book-embedder"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0166-218X(01)00314-6","volume":"122","author":"R Cimikowski","year":"2002","unstructured":"Cimikowski, R.: Algorithms for the fixed linear crossing number problem. Discrete Appl. Math. 122(1), 93\u2013115 (2002). http:\/\/dx.doi.org\/10.1016\/S0166-218X(01)00314-6","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10732-006-4294-9","volume":"12","author":"R Cimikowski","year":"2006","unstructured":"Cimikowski, R.: An analysis of some linear graph layout heuristics. J. Heuristics 12(3), 143\u2013153 (2006). http:\/\/dx.doi.org\/10.1007\/s10732-006-4294-9","journal-title":"J. Heuristics"},{"issue":"17","key":"19_CR10","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1016\/j.dam.2007.05.009","volume":"155","author":"R Cimikowski","year":"2007","unstructured":"Cimikowski, R., Mumey, B.: Approximating the fixed linear crossing number. Discrete Appl. Math. 155(17), 2202\u20132210 (2007). http:\/\/dx.doi.org\/10.1016\/j.dam.2007.05.009","journal-title":"Discrete Appl. Math."},{"issue":"6\u20137","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00285-011-0493-6","volume":"65","author":"P Clote","year":"2012","unstructured":"Clote, P., Dobrev, S., Dotu, I., Kranakis, E., Krizanc, D., Urrutia, J.: On the page number of RNA secondary structures with pseudoknots. J. Math. Biol. 65(6\u20137), 1337\u20131357 (2012). http:\/\/dx.doi.org\/10.1007\/s00285-011-0493-6","journal-title":"J. Math. Biol."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/120886777","volume":"27","author":"E de Klerk","year":"2013","unstructured":"de Klerk, E., Pasechnik, D.V., Salazar, G.: Improved lower bounds on book crossing numbers of complete graphs. SIAM J. Discrete Math. 27(2), 619\u2013633 (2013). http:\/\/dx.doi.org\/10.1137\/120886777","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discrete Comput. Geom. 37(4), 641\u2013670 (2007). http:\/\/dx.doi.org\/10.1007\/s00454-007-1318-7","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF02467109","volume":"33","author":"IA Dynnikov","year":"1999","unstructured":"Dynnikov, I.A.: Three-page approach to knot theory. Encoding and local moves. Funct. Anal. Appl. 33(4), 260\u2013269 (1999). http:\/\/dx.doi.org\/10.1007\/BF02467109","journal-title":"Funct. Anal. Appl."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"JL Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of $$k$$-trees is $${O}(k)$$. Discrete Appl. Math. 109(3), 215\u2013221 (2001). http:\/\/dx.doi.org\/10.1016\/S0166-218X(00)00178-5","journal-title":"Discrete Appl. Math."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"ER Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386\u2013398. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_37"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"ED Giacomo","year":"2006","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531\u2013547 (2006). http:\/\/dx.doi.org\/10.1007\/s00453-005-1185-7","journal-title":"Algorithmica"},{"key":"19_CR18","unstructured":"He, H., S\u00fdkora, O.: New circular drawing algorithms. In: Workshop on Information Technologies - Applications and Theory (ITAT 2004) (2004). https:\/\/dspace.lboro.ac.uk\/2134\/2386"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10732-006-9000-4","volume":"13","author":"H He","year":"2007","unstructured":"He, H., S\u00fdkora, O., M\u00e4kinen, E.: Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13(1), 77\u201393 (2007). http:\/\/dx.doi.org\/10.1007\/s10732-006-9000-4","journal-title":"J. Heuristics"},{"issue":"6","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1109\/TNN.2006.881486","volume":"17","author":"H He","year":"2006","unstructured":"He, H., S\u00fdkora, O., M\u00e4kinen, E.: An improved neural network model for the two-page crossing number problem. IEEE Trans. Neural Netw. 17(6), 1642\u20131646 (2006). http:\/\/dx.doi.org\/10.1109\/TNN.2006.881486","journal-title":"IEEE Trans. Neural Netw."},{"key":"19_CR21","unstructured":"He, H., S\u00fdkora, O., Salagean, A., Vrt\u2019o, I.: Heuristic crossing minimisation algorithms for the two-page drawing problem. Technical report, Loughborough University (2006). https:\/\/dspace.lboro.ac.uk\/2134\/2377"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.endm.2005.06.088","volume":"22","author":"H He","year":"2005","unstructured":"He, H., S\u00fdkora, O., Vrt\u2019o, I.: Crossing minimisation heuristics for 2-page drawings. Electron. Notes Discrete Math. 22, 527\u2013534 (2005). http:\/\/dx.doi.org\/10.1016\/j.endm.2005.06.088","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1515\/comp-2015-0004","volume":"5","author":"H He","year":"2015","unstructured":"He, H., S\u0103l\u0103gean, A., M\u00e4kinen, E., Vrt\u2019o, I.: Various heuristic algorithms to minimise the two-page crossing numbers of graphs. Open Comput. Sci. 5(1), 22\u201340 (2015). https:\/\/doi.org\/10.1515\/comp-2015-0004","journal-title":"Open Comput. Sci."},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jpdc.2001.1789","volume":"62","author":"N Kapoor","year":"2002","unstructured":"Kapoor, N., Russell, M., Stojmenovic, I., Zomaya, A.Y.: A genetic algorithm for finding the pagenumber of interconnection networks. J. Parallel Distrib. Comput. 62(2), 267\u2013283 (2002). http:\/\/dx.doi.org\/10.1006\/jpdc.2001.1789","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-27261-0_43","volume-title":"Graph Drawing and Network Visualization","author":"P Kindermann","year":"2015","unstructured":"Kindermann, P., L\u00f6ffler, M., Nachmanson, L., Rutter, I.: Graph drawing contest report. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 531\u2013537. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_43"},{"key":"19_CR26","unstructured":"Klawitter, J.: Algorithms for crossing minimisation in book drawings. Master\u2019s thesis, Karlsruhe Institute of Technology (2016)"},{"key":"19_CR27","unstructured":"Klawitter, J., Mchedlidze, T., N\u00f6llenburg, M.: Experimental evaluation of book drawing algorithms. CoRR, abs\/1708.09221, August 2017. http:\/\/arxiv.org\/abs\/1708.09221"},{"issue":"4","key":"19_CR28","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/scj.4690200404","volume":"20","author":"M Konoe","year":"1989","unstructured":"Konoe, M., Hagihara, K., Tokura, N.: Page-number of hypercubes and cube-connected cycles. Syst. Comput. Jpn. 20(4), 34\u201347 (1989). http:\/\/dx.doi.org\/10.1002\/scj.4690200404","journal-title":"Syst. Comput. Jpn."},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/978-3-540-74695-9_84","volume-title":"Artificial Neural Networks \u2013 ICANN 2007","author":"D L\u00f3pez-Rodr\u00edguez","year":"2007","unstructured":"L\u00f3pez-Rodr\u00edguez, D., M\u00e9rida-Casermeiro, E., Ort\u00edz-de-Lazcano-Lobato, J.M., Gal\u00e1n-Mar\u00edn, G.: K-Pages graph drawing with multivalued neural networks. In: de S\u00e1, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds.) ICANN 2007. LNCS, vol. 4669, pp. 816\u2013825. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74695-9_84"},{"issue":"1","key":"19_CR30","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput. 39(1), 124\u2013127 (1990). http:\/\/dx.doi.org\/10.1109\/12.46286","journal-title":"IEEE Trans. Comput."},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1090\/dimacs\/043\/09","volume":"43","author":"L McShine","year":"1999","unstructured":"McShine, L., Tetali, P.: On the mixing time of the triangulation walk and other catalan structures. Randomization Methods Algorithm Des. 43, 147\u2013160 (1999)","journal-title":"Randomization Methods Algorithm Des."},{"key":"19_CR32","unstructured":"Poranen, T., M\u00e4kinen, E., He, H.: A simulated annealing algorithm for the 2-page crossing number problem. In: Proceedings of International Network Optimization Conference (INOC) (2007)"},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Satsangi, D., Srivastava K., Gursaran: A hybrid evolutionary algorithm for the page number minimization problem. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds.) Trends in Computer Science, Engineering and Information Technology. Communications in Computer and Information Science, vol. 204. pp. 463\u2013475. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24043-0_47","DOI":"10.1007\/978-3-642-24043-0_47"},{"issue":"4","key":"19_CR34","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s12293-013-0115-5","volume":"5","author":"D Satsangi","year":"2013","unstructured":"Satsangi, D., Srivastava, K., Srivastava, G.: K-page crossing number minimization problem: an evaluation of heuristics and its solution using gesakp. Memetic Comput. 5(4), 255\u2013274 (2013). http:\/\/dx.doi.org\/10.1007\/s12293-013-0115-5","journal-title":"Memetic Comput."},{"issue":"4","key":"19_CR35","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., Sz\u00e9kely, L.A., S\u00fdkora, O., Vrt\u2019o, I.: The book crossing number of a graph. J. Graph Theor. 21(4), 413\u2013424 (1996). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199604)21:4%3c413::AID-JGT7%3e3.0.CO;2-S","journal-title":"J. Graph Theor."},{"issue":"1","key":"19_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jda.2005.01.009","volume":"4","author":"JM Six","year":"2006","unstructured":"Six, J.M., Tollis, I.G.: A framework and algorithms for circular drawings of graphs. J. Discrete Algorithms 4(1), 25\u201350 (2006). http:\/\/dx.doi.org\/10.1016\/j.jda.2005.01.009","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"19_CR37","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11786-009-0012-y","volume":"3","author":"Y Tanaka","year":"2010","unstructured":"Tanaka, Y., Shibata, Y.: On the pagenumber of the cube-connected cycles. Math. Comput. Sci. 3(1), 109\u2013117 (2010). http:\/\/dx.doi.org\/10.1007\/s11786-009-0012-y","journal-title":"Math. Comput. Sci."},{"issue":"8","key":"19_CR38","first-page":"797","volume":"55","author":"J Wang","year":"2008","unstructured":"Wang, J.: Hopfield neural network based on estimation of distribution for two-page crossing number problem. IEEE Trans. Circ. Syst. II Express Briefs 55(8), 797\u2013801 (2008). http:\/\/dx.doi.org\/10.1109\/TCSII.2008.922373","journal-title":"IEEE Trans. Circ. Syst. II Express Briefs"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Wattenberg, M.: Arc diagrams: visualizing structure in strings. In: Information Visualization (INFOVIS 2002), pp. 110\u2013116. IEEE (2002)","DOI":"10.1109\/INFVIS.2002.1173155"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-16766-8_20","volume-title":"VLSI Algorithms and Architectures","author":"M Yannakakis","year":"1986","unstructured":"Yannakakis, M.: Linear and book embeddings of graphs. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds.) AWOC 1986. LNCS, vol. 227, pp. 226\u2013235. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16766-8_20"},{"issue":"1","key":"19_CR41","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. Comput. Syst. Sci. 38(1), 36\u201367 (1989). http:\/\/dx.doi.org\/10.1016\/0022-0000(89)90032-9","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T23:09:14Z","timestamp":1751238554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}