{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:18:07Z","timestamp":1761621487022,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_24","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"307-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exact Crossing Number Parameterized by Vertex Cover"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2125-1514","authenticated-orcid":false,"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"first","affiliation":[]},{"given":"Abhisekh","family":"Sankaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Biedl, T.C., Chimani, M., Derka, M., Mutzel, P.: Crossing number for graphs with bounded pathwidth. In: ISAAC 2017. LIPIcs, vol. 92, pp. 13:1\u201313:13. Schloss Dagstuhl (2017)","key":"24_CR2"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/s00454-012-9440-6","volume":"49","author":"S Cabello","year":"2013","unstructured":"Cabello, S.: Hardness of approximation for crossing number. Discrete Comput. Geom. 49(2), 348\u2013358 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-00219-9_5","volume-title":"Graph Drawing","author":"S Cabello","year":"2009","unstructured":"Cabello, S., Mohar, B.: Crossing and weighted crossing number of near-planar graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 38\u201349. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_5"},{"issue":"5","key":"24_CR5","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013)","journal-title":"SIAM J. Comput."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ejc.2011.09.009","volume":"33","author":"M Chimani","year":"2012","unstructured":"Chimani, M., Hlin\u011bn\u00fd, P., Mutzel, P.: Vertex insertion approximates the crossing number for apex graphs. Eur. J. Comb. 33, 326\u2013335 (2012)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s10878-016-0030-z","volume":"33","author":"M Chimani","year":"2017","unstructured":"Chimani, M., Hlin\u011bn\u00fd, P.: A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4), 1183\u20131225 (2017)","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Christian, R., Richter, R.B., Salazar, G.: Zarankiewicz\u2019s conjecture is finite for each fixed m. J. Comb. Theory, Ser. B 103(2), 237\u2013247 (2013)","key":"24_CR8","DOI":"10.1016\/j.jctb.2012.11.001"},{"doi-asserted-by":"crossref","unstructured":"Chuzhoy, J.: An algorithm for the graph crossing number problem. In: Proceedings of STOC 2011, pp. 303\u2013312. ACM (2011)","key":"24_CR9","DOI":"10.1145\/1993636.1993678"},{"key":"24_CR10","first-page":"161","volume":"87","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congr. Numer. 87, 161\u2013178 (1992)","journal-title":"Congr. Numer."},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/S0097539700373520","volume":"32","author":"G Even","year":"2002","unstructured":"Even, G., Guha, S., Schieber, B.: Improved approximations of crossings in graph drawings and VLSI layout areas. SIAM J. Comput. 32(1), 231\u2013252 (2002)","journal-title":"SIAM J. Comput."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comgeo.2019.04.003","volume":"81","author":"J Fox","year":"2019","unstructured":"Fox, J., Pach, J., Suk, A.: Approximating the rectilinear crossing number. Comput. Geom. 81, 45\u201353 (2019)","journal-title":"Comput. Geom."},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-04414-5_16","volume-title":"Graph Drawing and Network Visualization","author":"R Fulek","year":"2018","unstructured":"Fulek, R., T\u00f3th, C.D.: Crossing minimization in perturbed drawings. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 229\u2013241. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_16"},{"key":"24_CR14","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. Alg. Discr. Meth. 4, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.endm.2007.07.037","volume":"29","author":"I Gitler","year":"2007","unstructured":"Gitler, I., Hlin\u011bn\u00fd, P., Leanos, J., Salazar, G.: The crossing number of a projective graph is quadratic in the face-width. Electron. Notes Discrete Math. 29, 219\u2013223 (2007)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.jcss.2003.07.008","volume":"68","author":"M Grohe","year":"2004","unstructured":"Grohe, M.: Computing crossing numbers in quadratic time. J. Comput. Syst. Sci. 68(2), 285\u2013302 (2004)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P., Chimani, M.: Approximating the crossing number of graphs embeddable in any orientable surface. In: Proceedings of SODA 2010, pp. 918\u2013927. ACM (2010)","key":"24_CR17","DOI":"10.1137\/1.9781611973075.74"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-70904-6_17","volume-title":"Graph Drawing","author":"P Hlin\u011bn\u00fd","year":"2007","unstructured":"Hlin\u011bn\u00fd, P., Salazar, G.: On the crossing number of almost planar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 162\u2013173. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_17"},{"doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.A.: Computing crossing number in linear time. In: Proceedings of STOC 2007, pp. 382\u2013390. ACM (2007)","key":"24_CR19","DOI":"10.1145\/1250790.1250848"},{"unstructured":"Lokshtanov, D.: Parameterized integer quadratic programming: Variables and coefficients. CoRR abs\/1511.00310 (2015)","key":"24_CR20"}],"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-35802-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:36Z","timestamp":1701133476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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"}]}}