{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:46Z","timestamp":1742913286159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"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-49190-0_23","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"324-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The k Edge-Vertex Domination Problem"],"prefix":"10.1007","author":[{"given":"Peng","family":"Li","sequence":"first","affiliation":[]},{"given":"Xingli","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhiang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.dam.2018.02.009","volume":"243","author":"WJ Desormeaux","year":"2018","unstructured":"Desormeaux, W.J., Haynes, T.W., Hedetniemi, S.T., Moore, C.: Distribution centers in graphs. Discret. Appl. Math. 243, 286\u2013293 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.2174\/1573409915666190807145908","volume":"16","author":"S Ediz","year":"2020","unstructured":"Ediz, S., Cancan, M.: On molecular topological properties of alkylating agents based anticancer drug candidates via some VE-degree topological indices. Curr. Comput. Aided Drug Des. 16(2), 190\u2013195 (2020)","journal-title":"Curr. Comput. Aided Drug Des."},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR4","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)"},{"key":"23_CR5","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Knisley, D., Seier, E., Zou, Y.: A quantitive analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 7, Article ID 108 (2006)","DOI":"10.1186\/1471-2105-7-108"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2018.09.019","volume":"766","author":"MA Henning","year":"2019","unstructured":"Henning, M.A., Pandey, A.: Alghoritmic aspects of semitotal domination in graphs. Theoret. Comput. Sci. 766, 46\u201357 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR8","unstructured":"Lewis, J.R.: Vertex-edge and edge-vertex parameters in graphs. Ph.D. thesis, Clemson, SC, USA (2007)"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Li, P., Wang, A.: A polynomial time algorithm for $$k$$-vertex-edge dominating problem in interval graphs. J. Comb. Optim. 45, 45 (2023). https:\/\/doi.org\/10.1007\/s10878-022-00982-8","DOI":"10.1007\/s10878-022-00982-8"},{"key":"23_CR10","unstructured":"Peters, J.K.W.: Theoretical and algorithmic results on domination and connectivity (Nordhaus-Gaddum, Gallai type results, max-min relationships, linear time, series-parallel). Ph.D. thesis, Clemson, SC, USA (1986)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Rangan, C.P.: A uniform approach to domination problems on interval graphs. Inf. Process. Lett. 27, 271\u2013274 (1988)","journal-title":"Inf. Process. Lett."},{"key":"23_CR12","first-page":"235","volume":"59","author":"A Raychaudhuri","year":"1987","unstructured":"Raychaudhuri, A.: On powers of interval and unit interval graphs. Congr. Numer. 59, 235\u2013242 (1987)","journal-title":"Congr. Numer."},{"key":"23_CR13","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1007\/978-3-030-51156-2_182","volume-title":"Intelligent and Fuzzy Techniques: Smart and Innovative Solutions","author":"B \u015eahin","year":"2021","unstructured":"\u015eahin, B., \u015eahin, A.: Double edge\u2013vertex domination. In: Kahraman, C., Cevik Onar, S., Oztaysi, B., Sari, I.U., Cebi, S., Tolga, A.C. (eds.) INFUS 2020. AISC, vol. 1197, pp. 1564\u20131572. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-51156-2_182"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2018.01.012","volume":"134","author":"YB Venkatakrishnan","year":"2018","unstructured":"Venkatakrishnan, Y.B., Krishnakumari, B.: An improved upper bound of edge-vertex domination of a tree. Inf. Process. Lett. 134, 14\u201317 (2018)","journal-title":"Inf. Process. Lett."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-10564-8_15","volume-title":"WALCOM: Algorithms and Computation","author":"YB Venkatakrishnan","year":"2019","unstructured":"Venkatakrishnan, Y.B., Naresh Kumar, H.: On the algorithmic complexity of double vertex-edge domination in graphs. In: Das, G.K., Mandal, P.S., Mukhopadhyaya, K., Nakano, S. (eds.) WALCOM 2019. LNCS, vol. 11355, pp. 188\u2013198. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10564-8_15"}],"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-49190-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:11:34Z","timestamp":1702026694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_23","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)"}}]}}