{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:07:01Z","timestamp":1743012421271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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-10564-8_15","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"188-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs"],"prefix":"10.1007","author":[{"given":"Y. B.","family":"Venkatakrishnan","sequence":"first","affiliation":[]},{"given":"H.","family":"Naresh Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00010-015-0354-2","volume":"90","author":"R Bourtig","year":"2016","unstructured":"Bourtig, R., Chellali, M., Haynes, T.W., Hedetniemi, S.: Vertex-edge domination in graphs. Aequationes Math. 90, 355\u2013366 (2016)","journal-title":"Aequationes Math."},{"key":"15_CR2","volume-title":"Fundamentals of Domination in Graphs","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","key":"15_CR3","unstructured":"Haynes, T., Hedetniemi, S., Slater, P. (eds.): Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"15_CR4","unstructured":"Jamison, R.E., Laskar, R.: Elimination orderings of chordal graphs. In: Proceedings of the Seminar on Combinatorics and Applications, Indian Statistical Institute, Calcutta, pp. 192\u2013200 (1982)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89, 75\u201383 (2004)","journal-title":"Inf. Process. Lett."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Krishnakumari, B., Chellali, M., Venkatakrishnan, Y.B.: Double Vertex-edge Domination. In: Discrete Mathematics, Algorithms and Applictions (2017). https:\/\/doi.org\/10.1142\/S1793830917500458","DOI":"10.1142\/S1793830917500458"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.crma.2014.03.017","volume":"352","author":"B Krishnakumari","year":"2014","unstructured":"Krishnakumari, B., Venkatakrishnan, Y.B., Krzywkowski, M.: Bounds on the vertex-edge domination number of a tree. Comptes Rendus Math. 352, 363\u2013366 (2014)","journal-title":"Comptes Rendus Math."},{"key":"15_CR8","unstructured":"Lewis, J.R.: Vertex-edge and edge-vertex parameters in graphs, Ph.D. Thesis, Clemson University (2007)"},{"key":"15_CR9","first-page":"193","volume":"81","author":"J Lewis","year":"2010","unstructured":"Lewis, J., Hedetniemi, S., Haynes, T., Fricke, G.: Vertex-edge domination. Util. Math. 81, 193\u2013213 (2010)","journal-title":"Util. Math."},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","volume":"87","author":"BS Panda","year":"2003","unstructured":"Panda, B.S., Das, S.K.: A linear time recognition algorithm for proper interval graphs. Inform. Process. Lett. 87(3), 153\u2013161 (2003)","journal-title":"Inform. Process. Lett."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CM Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.M., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci. 43, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"15_CR12","unstructured":"Peters, J., Theoretical and Algorithmic Results on Domination and Connectivity, Ph.D. Thesis, Clemson University (1986)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:12Z","timestamp":1709823072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","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":"100","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":"30% - 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":"9.8","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)"}}]}}