{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:09:09Z","timestamp":1743037749131,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_37","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"482-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Edge-Vertex Ratio of\u00a0Maximal\u00a0Thrackles"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Linda","family":"Kleist","sequence":"additional","affiliation":[]},{"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"37_CR1","unstructured":"Aichholzer, O., Kleist, L., Klemz, B., Schr\u00f6der, F., Vogtenhuber, B.: On the edge-vertex ratio of maximal thrackles. https:\/\/arxiv.org\/abs\/1908.08857v2"},{"issue":"12","key":"37_CR2","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1016\/j.disc.2015.06.023","volume":"338","author":"G Cairns","year":"2015","unstructured":"Cairns, G., Koussas, T., Nikolayevsky, Y.: Great-circle spherical thrackles. Discrete Math. 338(12), 2507\u20132513 (2015)","journal-title":"Discrete Math."},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geometry 23(2), 191\u2013206 (2000)","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00454-008-9095-5","volume":"41","author":"G Cairns","year":"2009","unstructured":"Cairns, G., Nikolayevsky, Y.: Generalized thrackle drawings of non-bipartite graphs. Discrete Comput. Geometry 41(1), 119\u2013134 (2009)","journal-title":"Discrete Comput. Geometry"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00373-010-1010-1","volume":"28","author":"G Cairns","year":"2012","unstructured":"Cairns, G., Nikolayevsky, Y.: Outerplanar thrackles. Graphs Comb. 28(1), 85\u201396 (2012)","journal-title":"Graphs Comb."},{"key":"37_CR6","unstructured":"Cleve, J., Mulzer, W., Perz, D., Steiner, R., Welzl, E.: Personal communication, August 2019"},{"key":"37_CR7","unstructured":"Conway, J.H.: Unsolved problems in combinatorics, pp. 351\u2013363. Mathematical Institute, Oxford (1972)"},{"issue":"6\u20137","key":"37_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.comgeo.2011.02.001","volume":"44","author":"R Fulek","year":"2011","unstructured":"Fulek, R., Pach, J.: A computational approach to Conway\u2019s Thrackle Conjecture. Comput. Geom. Theor. Appl. 44(6\u20137), 345\u2013355 (2011)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.dam.2018.12.025","volume":"259","author":"R Fulek","year":"2019","unstructured":"Fulek, R., Pach, J.: Thrackles: an improved upper bound. Discrete Appl. Math. 259, 226\u2013231 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s00454-017-9877-8","volume":"58","author":"L Goddyn","year":"2017","unstructured":"Goddyn, L., Xu, Y.: On the bounds of Conway\u2019s thrackles. Discrete Comput. Geom. 58(2), 410\u2013416 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7155\/jgaa.00460","volume":"22","author":"P Hajnal","year":"2018","unstructured":"Hajnal, P., Igamberdiev, A., Rote, G., Schulz, A.: Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22(1), 117\u2013138 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-013-9535-8","volume":"50","author":"J Kyn\u010dl","year":"2013","unstructured":"Kyn\u010dl, J.: Improved enumeration of simple topological graphs. Discrete Comput. Geom. 50, 727 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9535-8","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"37_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.comgeo.2014.10.008","volume":"48","author":"J Kyn\u010dl","year":"2015","unstructured":"Kyn\u010dl, J., Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Saturated simple and k-simple topological graphs. Comput. Geom. 48(4), 295\u2013310 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.10.008","journal-title":"Comput. Geom."},{"issue":"4","key":"37_CR14","first-page":"1","volume":"2","author":"W Li","year":"2006","unstructured":"Li, W., Daniels, K., Rybnikov, K.: A study of Conway\u2019s Thrackle Conjecture. Vertex 2(4), 1 (2006)","journal-title":"Vertex"},{"issue":"4","key":"37_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L Lov\u00e1sz","year":"1997","unstructured":"Lov\u00e1sz, L., Pach, J., Szegedy, M.: On Conway\u2019s thrackle conjecture. Discrete Comput. Geom. 18(4), 369\u2013376 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"37_CR16","doi-asserted-by":"publisher","unstructured":"Misereh, G., Nikolayevsky, Y.: Annular and pants thrackles. Discrete Math. Theor. Comput. Sci. 20(1) (2018). https:\/\/doi.org\/10.23638\/DMTCS-20-1-16","DOI":"10.23638\/DMTCS-20-1-16"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-34191-5_4","volume-title":"Computational Geometry","author":"J Pach","year":"2012","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Tangled thrackles. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 45\u201353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34191-5_4"},{"issue":"6","key":"37_CR18","doi-asserted-by":"publisher","first-page":"544","DOI":"10.4169\/amer.math.monthly.118.06.544","volume":"118","author":"J Pach","year":"2011","unstructured":"Pach, J., Sterling, E.: Conway\u2019s conjecture for monotone thrackles. Am. Math. Mon. 118(6), 544\u2013548 (2011)","journal-title":"Am. Math. Mon."},{"key":"37_CR19","unstructured":"Pammer, J.: Rotation Systems and Good Drawings, pp. 1\u201383. TUGraz (2014)"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ejc.2015.07.004","volume":"51","author":"AJ Ruiz-Vargas","year":"2016","unstructured":"Ruiz-Vargas, A.J., Suk, A., T\u00f3th, C.D.: Disjoint edges in topological graphs and the tangled-thrackle conjecture. Eur. J. Comb. 51, 398\u2013406 (2016)","journal-title":"Eur. J. Comb."},{"key":"37_CR21","unstructured":"Wehner, S.: On the thrackle problem (2013). http:\/\/www.thrackle.org\/thrackle.html"},{"key":"37_CR22","first-page":"335","volume":"348","author":"D Woodall","year":"1969","unstructured":"Woodall, D.: Thrackles and deadlock. Comb. Math. Appl. 348, 335\u2013347 (1969)","journal-title":"Comb. Math. Appl."}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:41Z","timestamp":1701133541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_37","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"}]}}