{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:57:11Z","timestamp":1743051431805,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_10","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"112-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$k$$-cuts on a Path"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3768-8078","authenticated-orcid":false,"given":"Xing Shi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Devroye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0717-4671","authenticated-orcid":false,"given":"Cecilia","family":"Holmgren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4141-7059","authenticated-orcid":false,"given":"Fiona","family":"Skerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1214\/13-AAP978","volume":"24","author":"L Addario-Berry","year":"2014","unstructured":"Addario-Berry, L., Broutin, N., Holmgren, C.: Cutting down trees with a Markov chainsaw. Ann. Appl. Probab. 24(6), 2297\u20132339 (2014)","journal-title":"Ann. Appl. Probab."},{"key":"10_CR2","volume-title":"Record Values-Theory and Applications","author":"M Ahsanullah","year":"2004","unstructured":"Ahsanullah, M.: Record Values-Theory and Applications. University Press of America Inc., Lanham (2004)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Cai, X.S., Devroye, L., Holmgren, C., Skerman, F.: $$k$$-cut on paths and some trees. ArXiv e-prints, January 2019","DOI":"10.1214\/19-EJP318"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Cai, X.S., Holmgren, C.: Cutting resilient networks - complete binary trees. arXiv e-prints, November 2018","DOI":"10.37236\/8350"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1111\/j.2517-6161.1952.tb00115.x","volume":"14","author":"KN Chandler","year":"1952","unstructured":"Chandler, K.N.: The distribution and frequency of record values. J. R. Stat. Soc. Ser. B. 14, 220\u2013228 (1952)","journal-title":"J. R. Stat. Soc. Ser. B."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Dagon, D., Gu, G., Lee, C.P., Lee, W.: A taxonomy of botnet structures. In: Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007), pp. 325\u2013339 (2007)","DOI":"10.1109\/ACSAC.2007.44"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/rsa.20233","volume":"34","author":"M Drmota","year":"2009","unstructured":"Drmota, M., Iksanov, A., Moehle, M., Roesler, U.: A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Algorithms 34(3), 319\u2013336 (2009)","journal-title":"Random Struct. Algorithms"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples, Cambridge Series in Statistical and Probabilistic Mathematics","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 31, 4th edn. Cambridge University Press, Cambridge (2010)","edition":"4"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1017\/S096354830999068X","volume":"19","author":"C Holmgren","year":"2010","unstructured":"Holmgren, C.: Random records and cuttings in binary search trees. Combin. Probab. Comput. 19(3), 391\u2013424 (2010)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1239\/aap\/1300198517","volume":"43","author":"C Holmgren","year":"2011","unstructured":"Holmgren, C.: A weakly 1-stable distribution for the number of random records and cuttings in split trees. Adv. Appl. Probab. 43(1), 151\u2013177 (2011)","journal-title":"Adv. Appl. Probab."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1214\/ECP.v12-1253","volume":"12","author":"A Iksanov","year":"2007","unstructured":"Iksanov, A., M\u00f6hle, M.: A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree. Electron. Comm. Probab. 12, 28\u201335 (2007)","journal-title":"Electron. Comm. Probab."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Janson, S.: Random records and cuttings in complete binary trees. In: Mathematics and Computer Science III, Trends Math, pp. 241\u2013253. Birkh\u00e4user, Basel (2004)","DOI":"10.1007\/978-3-0348-7915-6_24"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/rsa.20086","volume":"29","author":"S Janson","year":"2006","unstructured":"Janson, S.: Random cutting and records in deterministic and random trees. Random Struct. Algorithms 29(2), 139\u2013179 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S1446788700006698","volume":"11","author":"A Meir","year":"1970","unstructured":"Meir, A., Moon, J.W.: Cutting down random trees. J. Austral. Math. Soc. 11, 313\u2013324 (1970)","journal-title":"J. Austral. Math. Soc."},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0025-5564(74)90013-3","volume":"21","author":"A Meir","year":"1974","unstructured":"Meir, A., Moon, J.: Cutting down recursive trees. Math. Biosci. 21(3), 173\u2013181 (1974)","journal-title":"Math. Biosci."},{"key":"10_CR16","first-page":"7","volume":"8","author":"A R\u00e9nyi","year":"1962","unstructured":"R\u00e9nyi, A.: Th\u00e9orie des \u00e9l\u00e9ments saillants d\u2019une suite d\u2019observations. Ann. Fac. Sci. Univ. Clermont-Ferrand No. 8, 7\u201313 (1962)","journal-title":"Ann. Fac. Sci. Univ. Clermont-Ferrand No."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T08:27:00Z","timestamp":1721291220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_10","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":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"30","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":"32% - 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":"14","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)"}}]}}