iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-031-52213-0_6
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T15:57:17Z","timestamp":1726243037619},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031522123"},{"type":"electronic","value":"9783031522130"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_6","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"77-87","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Growth Rate of\u00a0the\u00a0Number of\u00a0Empty Triangles in\u00a0the\u00a0Plane"],"prefix":"10.1007","author":[{"given":"Bhaswar B.","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sk. Samim","family":"Islam","sequence":"additional","affiliation":[]},{"given":"Saumya","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.4153\/CMB-1987-064-1","volume":"30","author":"I B\u00e1r\u00e1ny","year":"1987","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z.: Empty simplices in Euclidean space. Can. Math. Bull. 30(4), 436\u2013445 (1987)","journal-title":"Can. Math. Bull."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00454-013-9506-0","volume":"50","author":"I B\u00e1r\u00e1ny","year":"2013","unstructured":"B\u00e1r\u00e1ny, I., Marckert, J.-F., Reitzner, M.: Many empty triangles have a common edge. Discrete Comput. Geom. 50, 244\u2013252 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9506-0","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"6_CR3","first-page":"243","volume":"41","author":"I B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny, I., Valtr, P.: Planar point sets with a small number of empty convex polygons. Stud. Sci. Math. Hung. 41(2), 243\u2013269 (2004)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"12","key":"6_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1073\/pnas.32.12.331","volume":"32","author":"FA Behrend","year":"1946","unstructured":"Behrend, F.A.: On sets of integers which contain no three terms in arithmetical progression. Proc. Natl. Acad. Sci. 32(12), 331\u2013332 (1946)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29929-7","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry, vol. 18. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-29929-7"},{"issue":"2","key":"6_CR6","first-page":"1","volume":"2","author":"P Erdos","year":"1992","unstructured":"Erdos, P.: On some unsolved problems in elementary geometry. Mat. Lapok 2(2), 1\u201310 (1992)","journal-title":"Mat. Lapok"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.4007\/annals.2011.174.1.17","volume":"174","author":"J Fox","year":"2011","unstructured":"Fox, J.: A new proof of the graph removal lemma. Ann. Math. 174(1), 561\u2013579 (2011)","journal-title":"Ann. Math."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-34191-5_24","volume-title":"Computational Geometry","author":"A Garc\u00eda","year":"2012","unstructured":"Garc\u00eda, A.: A note on the number of empty triangles. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 249\u2013257. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34191-5_24"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"K\u0151v\u00e1ri, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of Zarankiewicz. In: Colloquium Mathematicum, vol. 3, pp. 50\u201357. Polska Akademia Nauk (1954)","DOI":"10.4064\/cm-3-1-50-57"},{"issue":"113","key":"6_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jcta.2005.03.007","volume":"3","author":"R Pinchasi","year":"2006","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R., Sharir, M.: On empty convex polygons in a planar point set. J. Comb. Theory Ser. A 3(113), 385\u2013419 (2006)","journal-title":"J. Comb. Theory Ser. A"},{"key":"6_CR11","unstructured":"Reitzner, M., Temesvari, D.: Stars of empty simplices. arXiv preprint arXiv:1808.08734 (2018)"},{"key":"6_CR12","unstructured":"Ruzsa, I.Z., Szemer\u00e9di, E.: Triple systems with no six points carrying three triangles. Combinatorics (Keszthely, 1976) Coll. Math. Soc. J. Bolyai 18(939\u2013945), 2 (1978)"},{"key":"6_CR13","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. Computer Science Department, Stanford University (1975)"},{"key":"6_CR14","first-page":"155","volume":"30","author":"P Valtr","year":"1995","unstructured":"Valtr, P.: On the minimum number of empty polygons in planar point sets. Stud. Sci. Math. Hung. 30, 155\u2013163 (1995)","journal-title":"Stud. Sci. Math. Hung."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:57Z","timestamp":1705140177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","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":"57","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":"22","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":"0","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":"39% - 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","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":"5","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)"}}]}}