{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T20:51:24Z","timestamp":1726174284660},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160806"},{"type":"electronic","value":"9783031160813"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_25","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:24Z","timestamp":1663452144000},"page":"293-302","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Time Algorithm for\u00a0k-vertex-edge Dominating Problem in\u00a0Interval Graphs"],"prefix":"10.1007","author":[{"given":"Peng","family":"Li","sequence":"first","affiliation":[]},{"given":"Aifa","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00010-018-0609-9","volume":"93","author":"P \u017byli\u0144ski","year":"2018","unstructured":"\u017byli\u0144ski, P.: Vertex-edge domination in graphs. Aequationes Math. 93(4), 735\u2013742 (2018). https:\/\/doi.org\/10.1007\/s00010-018-0609-9","journal-title":"Aequationes Math."},{"issue":"9","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1820","DOI":"10.1080\/00207160.2017.1343469","volume":"95","author":"R Boutrig","year":"2018","unstructured":"Boutrig, R., Chellali, M.: Total vertex-edge domination. Int. J. Comput. Math. 95(9), 1820\u20131828 (2018)","journal-title":"Int. J. Comput. Math."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs: A Study of Partially Ordered Sets, John Wiley & Sons Inc., (1985)","DOI":"10.1016\/0012-365X(85)90042-1"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd ed., Annals of Discrete Mathematics, 57, Elsevier, Amsterdam, The Netherlands (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"25_CR5","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":"25_CR6","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)"},{"issue":"04","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1750045","DOI":"10.1142\/S1793830917500458","volume":"09","author":"B Krishnakumari","year":"2017","unstructured":"Krishnakumari, B., Chellali, M., Venkatakrishnan, Y.B.: Double vertex-edge domination. Discrete Math Algorithms Appl. 09(04), 1750045 (2017)","journal-title":"Discrete Math Algorithms Appl."},{"issue":"5","key":"25_CR8","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. C R Math 352(5), 363\u2013366 (2014)","journal-title":"C R Math"},{"key":"25_CR9","unstructured":"Lewis, J.R.: Vertex-edge and edge-vertex parameters in graphs, Ph.D. thesis, Clemson, SC, USA, (2007)"},{"key":"25_CR10","first-page":"193","volume":"81","author":"JR Lewis","year":"2010","unstructured":"Lewis, J.R., Hedetniemi, S.T., Haynes, T.W., Fricke, G.H.: Vertex-edge domination. Util Math 81, 193\u2013213 (2010)","journal-title":"Util Math"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2015.03.012","volume":"16","author":"P Li","year":"2015","unstructured":"Li, P., Wu, Y.: Spanning connectedness and Hamiltonian thickness of graphs and interval graphs. Discrete Math. Theor. Comput. Sci. 16(2), 125\u2013210 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/140981265","volume":"31","author":"P Li","year":"2017","unstructured":"Li, P., Wu, Y.: A linear time algorithm for the 1-fixed-endpoint path cover problem on interval graphs. SIAM J. Discret. Math. 31(1), 210\u2013239 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-94-009-5315-4_2","volume-title":"Graphs and Orders","author":"RH M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 41\u2013101. D. Reidel, Boston (1985)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-021-00832-z","volume":"4","author":"S Paul","year":"2021","unstructured":"Paul, S., Ranjan, K.: Results on vertex-edge and independent vertex-edge domination. J. Comb. Optim. 4, 1\u201328 (2021). https:\/\/doi.org\/10.1007\/s10878-021-00832-z","journal-title":"J. Comb. Optim."},{"key":"25_CR15","unstructured":"Peters, J.K.W.: Theoretical and algorithmic results on domination and connectivity (NordhausCGaddum, Gallai type results, maxCmin relationships, linear time, seriesCparallel), Ph.D. thesis, Clemson, SC, USA (1986)"},{"key":"25_CR16","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":"25_CR17","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":"25_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2021.01.005","volume":"859","author":"J Shang","year":"2021","unstructured":"Shang, J., Li, P., Shi, Y.: The longest cycle problem is polynomial on interval graphs. Theoret. Comput. Sci. 859, 37\u201347 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR19","first-page":"237","volume-title":"Surveys in Combinatorics","author":"WT Trotter","year":"1997","unstructured":"Trotter, W.T.: New perspectives on interval orders and interval graphs. In: Bailey, R.A. (ed.) London Mathematical Society Lecture Note Series 241, pp. 237\u2013286. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"25_CR20","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00010-018-0609-9","volume":"93","author":"P \u017byli\u0144ski","year":"2018","unstructured":"\u017byli\u0144ski, P.: Vertex-edge domination in graphs. Aequationes Math. 93(4), 735\u2013742 (2018). https:\/\/doi.org\/10.1007\/s00010-018-0609-9","journal-title":"Aequationes Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16081-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:04:47Z","timestamp":1663452287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","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":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"41","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":"69% - 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":"2","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)"}}]}}