{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:14:59Z","timestamp":1742912099789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_4","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"40-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Empty Triangles in\u00a0Generalized Twisted Drawings of\u00a0$$K_n$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6519-1472","authenticated-orcid":false,"given":"Alfredo","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9543-7170","authenticated-orcid":false,"given":"Javier","family":"Tejel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-6661","authenticated-orcid":false,"given":"Alexandra","family":"Weinberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"4_CR1","unstructured":"\u00c1brego, B., Fern\u00e1ndez-Merchant, S., Figueroa, A.P., Montellano-Ballesteros, J.J., Rivera-Campo, E.: Crossings in twisted graphs. In: Collection of Abstracts for the 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3), pp. 21\u201322 (2019). https:\/\/www.csun.edu\/~sf70713\/publications\/2019_JCDCG3_Twisted_Crossings.pdf"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Fabila-Monroy, R., Hackl, T., Huemer, C., Pilz, A., Birgit, V.: Lower bounds for the number of small convex $$k$$-holes. Comput. Geom. Theor. Appl. 47(5), 605\u2013613 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2013.12.002","DOI":"10.1016\/j.comgeo.2013.12.002"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Garc\u00eda, A., Tejel, J., Vogtenhuber, B., Weinberger, A.: Twisted ways to find plane structures in simple drawings of complete graphs. In: Proceedings of the 38th International Symposium on Computational Geometry (SoCG 2022), pp. 1\u201318 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2022.5","DOI":"10.4230\/LIPIcs.SoCG.2022.5"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00373-015-1550-5","volume":"31","author":"O Aichholzer","year":"2015","unstructured":"Aichholzer, O., Hackl, T., Pilz, A., Ramos, P., Sacrist\u00e1n, V., Vogtenhuber, B.: Empty triangles in good drawings of the complete graph. Graphs Comb. 31(2), 335\u2013345 (2015). https:\/\/doi.org\/10.1007\/s00373-015-1550-5","journal-title":"Graphs Comb."},{"key":"4_CR5","unstructured":"Arroyo, A., Richter, R.B., Salazar, G., Sullivan, M.: The unavoidable rotation systems. arXiv:1910.12834 (2019)"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"B\u00e1r\u00e1ny, I., Valtr, P.: Planar point sets with a small number of empty convex polygons. studia scientiarum mathematicarum hungarica. Q. Hung. Acad. Sci. 41, 243\u2013266 (2004). https:\/\/doi.org\/10.1556\/SScMath.41.2004.2.4","DOI":"10.1556\/SScMath.41.2004.2.4"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s40590-020-00287-y","volume":"26","author":"AP Figueroa","year":"2020","unstructured":"Figueroa, A.P., Fres\u00e1n-Figueroa, J.: The biplanar tree graph. Bol. Soc. Matem\u00e1tica Mex. 26(3), 795\u2013806 (2020). https:\/\/doi.org\/10.1007\/s40590-020-00287-y","journal-title":"Bol. Soc. Matem\u00e1tica Mex."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Fulek R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of the 29th Annual Symposium on Computational Geometry (SoCG2013), pp. 259\u2013266. New York, ACM (2013). https:\/\/doi.org\/10.1145\/2462356.2462394","DOI":"10.1145\/2462356.2462394"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0012-365X(98)00098-3","volume":"191","author":"H Harborth","year":"1998","unstructured":"Harborth, H.: Empty triangles in drawings of the complete graph. Discret. Math. 191, 109\u2013111 (1998)","journal-title":"Discret. Math."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11618058_25","volume-title":"Graph Drawing","author":"J Kyn\u010dl","year":"2006","unstructured":"Kyn\u010dl, J., Valtr, P.: On edges crossing few other edges in simple topological complete graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 274\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_25"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-34191-5_11","volume-title":"Computational Geometry","author":"E Oma\u00f1a-Pulido","year":"2012","unstructured":"Oma\u00f1a-Pulido, E., Rivera-Campo, E.: Notes on the twisted graph. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 119\u2013125. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34191-5_11"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discrete Comput. Geom. 30(2), 311\u2013320 (2003). https:\/\/doi.org\/10.1007\/s00454-003-0012-9","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00454-015-9671-4","volume":"53","author":"AJ Ruiz-Vargas","year":"2015","unstructured":"Ruiz-Vargas, A.J.: Empty triangles in complete topological graphs. Discrete Comput. Geom. 53(4), 703\u2013712 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9671-4","journal-title":"Discrete Comput. Geom."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Suk, A., Zeng, J.: Unavoidable patterns in complete simple topological graphs. arXiv:2204.04293 (2022)","DOI":"10.52843\/cassyni.gfmg6m"}],"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-031-22203-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:03:34Z","timestamp":1704351814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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":"7.03","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)"}}]}}