乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T15:06:10Z","timestamp":1726239970573},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49193-1_13","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T04:02:36Z","timestamp":1702008156000},"page":"171-183","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Discharging Method: Improved Kernels for\u00a0Edge Triangle Packing and\u00a0Covering"],"prefix":"10.1007","author":[{"given":"Zimo","family":"Sheng","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, S. Saurabh, Parameterized Algorithms, Springer, 2015","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM J. Comput. 10(4), 713\u2013717 (1981)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V Kann","year":"1994","unstructured":"Kann, V.: Maximum bounded h-matching is MAX snp-complete. Inf. Process. Lett. 49(6), 309\u2013318 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discret. Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"L. Mathieson, E. Prieto-Rodriguez, P. Shaw, Packing edge disjoint triangles: A parameterized view, in: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14\u201317, 2004, Proceedings, Vol. 3162 of Lecture Notes in Computer Science, Springer, 2004, pp. 127\u2013137","DOI":"10.1007\/978-3-540-28639-4_12"},{"issue":"7","key":"13_CR7","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ipl.2014.02.003","volume":"114","author":"Y Yang","year":"2014","unstructured":"Yang, Y.: Towards optimal kernel for edge-disjoint triangle packing. Inf. Process. Lett. 114(7), 344\u2013348 (2014)","journal-title":"Inf. Process. Lett."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ipl.2018.10.006","volume":"142","author":"W Lin","year":"2019","unstructured":"Lin, W., Xiao, M.: A (3+$$\\epsilon $$)$${k}$$-vertex kernel for edge-disjoint triangle packing. Inf. Process. Lett. 142, 20\u201326 (2019)","journal-title":"Inf. Process. Lett."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"H. Yuan, Q. Feng, J. Wang, Improved kernels for triangle packing in tournaments, Sci. China Inf. Sci. 66 (5) (2023)","DOI":"10.1007\/s11432-021-3551-2"},{"key":"13_CR10","first-page":"51","volume":"32","author":"D Br\u00fcgmann","year":"2009","unstructured":"Br\u00fcgmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs, Electron. Notes. Discret. Math. 32, 51\u201358 (2009)","journal-title":"Discret. Math."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"F. K. H. A. Dehne, M. R. Fellows, F. A. Rosamond, P. Shaw, Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover, in: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14\u201317, 2004, Proceedings, Vol. 3162 of Lecture Notes in Computer Science, Springer, 2004, pp. 271\u2013280","DOI":"10.1007\/978-3-540-28639-4_24"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2020.09.026","volume":"846","author":"M Xiao","year":"2020","unstructured":"Xiao, M., Kou, S.: Parameterized algorithms and kernels for almost induced matching. Theor. Comput. Sci. 846, 103\u2013113 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"M. Xiao, S. Kou, Kernelization and parameterized algorithms for 3-path vertex cover, in: Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20\u201322, 2017, Proceedings, Vol. 10185 of Lecture Notes in Computer Science, 2017, pp. 654\u2013668","DOI":"10.1007\/978-3-319-55911-7_47"},{"key":"13_CR14","unstructured":"R. Cerven\u00fd, P. Choudhary, O. Such\u00fd, On kernels for d-path vertex cover, in: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22\u201326, 2022, Vienna, Austria, Vol. 241 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2022, pp. 29:1\u201329:14"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T04:04:54Z","timestamp":1702008294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}