{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T13:10:35Z","timestamp":1783257035028,"version":"3.54.6"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030929305","type":"print"},{"value":"9783030929312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_3","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"41-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-5550","authenticated-orcid":false,"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3829","authenticated-orcid":false,"given":"Max","family":"Ilsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5923-4114","authenticated-orcid":false,"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"2\u20133","key":"3_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. J. Syst. Softw. 4(2\u20133), 163\u2013173 (1984). https:\/\/doi.org\/10.1016\/0164-1212(84)90006-2","journal-title":"J. Syst. Softw."},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0218195900000358","volume":"10","author":"GD Battista","year":"2000","unstructured":"Battista, G.D., et al.: Drawing directed acyclic graphs: an experimental study. Int. J. Comput. Geom. Appl. 10(6), 623\u2013648 (2000). https:\/\/doi.org\/10.1142\/S0218195900000358","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"GD Battista","year":"1997","unstructured":"Battista, G.D., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. 7, 303\u2013325 (1997). https:\/\/doi.org\/10.1016\/S0925-7721(96)00005-3","journal-title":"Comput. Geom."},{"key":"3_CR4","unstructured":"Brglez, F., Bryan, D., Kozminski, K.: Notes on the ISCAS 1989 benchmark circuits. North-Carolina State University, Technical report, October 1989"},{"key":"3_CR5","unstructured":"Brglez, F., Fujiwara, H.: A neutral netlist of 10 combinational circuits and a targeted translator in FORTRAN. In: Proceedings of the ISCAS; Special Session on ATPG and Fault Simulation, pp. 151\u2013158, June 1985"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.disopt.2007.05.006","volume":"5","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., et al.: A branch-and-cut approach to the crossing number problem. Discrete Optim. 5(2), 373\u2013388 (2008). https:\/\/doi.org\/10.1016\/j.disopt.2007.05.006","journal-title":"Discrete Optim."},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00453-009-9357-5","volume":"60","author":"S Cabello","year":"2011","unstructured":"Cabello, S., Mohar, B.: Crossing number and weighted crossing number of near-planar graphs. Algorithmica 60(3), 484\u2013504 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9357-5","journal-title":"Algorithmica"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-53925-6_29","volume-title":"WALCOM: Algorithms and Computation","author":"P Chalermsook","year":"2017","unstructured":"Chalermsook, P., Schmid, A.: Finding triangles for maximum planar subgraphs. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 373\u2013384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_29"},{"issue":"7","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1016\/j.disc.2007.12.078","volume":"309","author":"M Chimani","year":"2009","unstructured":"Chimani, M., Gutwenger, C.: Non-planar core reduction of graphs. Discrete Math. 309(7), 1838\u20131855 (2009). https:\/\/doi.org\/10.1016\/j.disc.2007.12.078","journal-title":"Discrete Math."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"729","DOI":"10.7155\/jgaa.00264","volume":"16","author":"M Chimani","year":"2012","unstructured":"Chimani, M., Gutwenger, C.: Advances in the planarization method: effective multiple edge insertions. J. Graph Algorithms Appl. 16(3), 729\u2013757 (2012). https:\/\/doi.org\/10.7155\/jgaa.00264","journal-title":"J. Graph Algorithms Appl."},{"key":"3_CR11","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The Open Graph Drawing Framework (OGDF). In: Handbook on Graph Drawing and Visualization, pp. 543\u2013569. Chapman and Hall\/CRC (2013)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1498698.1564504","volume":"14","author":"M Chimani","year":"2009","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P.: Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithmics 14, 3\u20134 (2009). https:\/\/doi.org\/10.1145\/1498698.1564504","journal-title":"ACM J. Exp. Algorithmics"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Chimani, M., Gutwenger, C., Mutzel, P., Wolf, C.: Inserting a vertex into a planar graph. In: Proceedings of the SODA 2009, pp. 375\u2013383. SIAM (2009). http:\/\/dl.acm.org\/citation.cfm?id=1496770.1496812","DOI":"10.1137\/1.9781611973068.42"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s10878-016-0030-z","volume":"33","author":"M Chimani","year":"2016","unstructured":"Chimani, M., Hlin\u011bn\u00fd, P.: A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4), 1183\u20131225 (2016). https:\/\/doi.org\/10.1007\/s10878-016-0030-z","journal-title":"J. Comb. Optim."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Chimani, M., Ilsen, M., Wiedera, T.: Star-struck by fixed embeddings: Modern crossing number heuristics (2021). https:\/\/arxiv.org\/abs\/2108.11443, extended version of this paper including appendix: arXiv:2108.11443 [cs.DM]","DOI":"10.1007\/978-3-030-92931-2_3"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-87744-8_24","volume-title":"Algorithms - ESA 2008","author":"M Chimani","year":"2008","unstructured":"Chimani, M., Mutzel, P., Bomze, I.: A new approach to exact crossing minimization. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 284\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_24"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Chimani, M., Wiedera, T.: An ILP-based proof system for the crossing number problem. In: Proceedings of the ESA 2016. LIPIcs, vol. 57, pp. 29:1\u201329:13 (2016), https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2016.29","DOI":"10.4230\/LIPIcs.ESA.2016.29"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00487","volume":"23","author":"K Clancy","year":"2019","unstructured":"Clancy, K., Haythorpe, M., Newcombe, A.: An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. 23(2), 135\u2013166 (2019). https:\/\/doi.org\/10.7155\/jgaa.00487","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/54.867894","volume":"17","author":"F Corno","year":"2000","unstructured":"Corno, F., Reorda, M.S., Squillero, G.: RT-level ITC\u201999 benchmarks and first ATPG results. IEEE Des. Test Comput. 17(3), 44\u201353 (2000). https:\/\/doi.org\/10.1109\/54.867894","journal-title":"IEEE Des. Test Comput."},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"3_CR21","unstructured":"Gutwenger, C.: Application of SPQR-Trees in the Planarization Approach for Drawing Graphs. Ph.D. thesis, TU Dortmund, Dortmund, Germany (2010). http:\/\/hdl.handle.net\/2003\/27430"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-24595-7_2","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13\u201324. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_2"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-004-1128-8","volume":"41","author":"C Gutwenger","year":"2005","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. Algorithmica 41(4), 289\u2013308 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1128-8","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P Hlinen\u00fd","year":"2006","unstructured":"Hlinen\u00fd, P.: Crossing number is hard for cubic graphs. J. Comb. Theory Ser. B 96(4), 455\u2013471 (2006). https:\/\/doi.org\/10.1016\/j.jctb.2005.09.009","journal-title":"J. Comb. Theory Ser. B"},{"issue":"6","key":"3_CR25","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation [H] (algorithm 447). Commun. ACM 16(6), 372\u2013378 (1973). https:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"3_CR27","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A Steger","year":"1999","unstructured":"Steger, A., Wormald, N.C.: Generating random regular graphs quickly. Comb. Probab. Comput. 8(4), 377\u2013396 (1999). https:\/\/doi.org\/10.1017\/S0963548399003867","journal-title":"Comb. Probab. Comput."},{"key":"3_CR28","unstructured":"Ziegler, T.: Crossing minimization in automatic graph drawing. Ph.D. thesis, Saarland University, Saarbr\u00fccken, Germany (2001). http:\/\/d-nb.info\/961610808"}],"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-030-92931-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:54Z","timestamp":1766365314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.02","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}