{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:07:59Z","timestamp":1757311679130,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701059"],"award-info":[{"award-number":["11701059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2020jcyj-msxmX0272","cstc2021jcyj-msxmX0436"],"award-info":[{"award-number":["cstc2020jcyj-msxmX0272","cstc2021jcyj-msxmX0436"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00982-8","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T21:02:32Z","timestamp":1673038952000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Peng","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5784-7208","authenticated-orcid":false,"given":"Aifa","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,6]]},"reference":[{"issue":"2","key":"982_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00010-015-0354-2","volume":"90","author":"R Boutrig","year":"2016","unstructured":"Boutrig R, Chellali M, Haynes TW, Hedetniemi ST (2016) Vertex-edge domination in graphs. Aequ Math 90(2):355\u2013366","journal-title":"Aequ Math"},{"issue":"9","key":"982_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 (2018) Total vertex-edge domination. Int J Comput Math 95(9):1820\u20131828","journal-title":"Int J Comput Math"},{"key":"982_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90042-1","volume-title":"Interval orders and interval graphs: a study of partially ordered sets","author":"PC Fishburn","year":"1985","unstructured":"Fishburn PC (1985) Interval orders and interval graphs: a study of partially ordered sets. Wiley"},{"key":"982_CR4","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC (2004) Algorithmic graph theory and perfect graphs, vol 57, 2nd edn. Annals of Discrete Mathematics. Elsevier, Amsterdam","edition":"2"},{"key":"982_CR5","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998a) Domination in graphs: advanced topics. Marcel Dekker Inc, New York"},{"key":"982_CR6","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998b) Fundamentals of domination in graphs. Marcel Dekker Inc, New York"},{"issue":"5","key":"982_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 YB, Krzywkowski M (2014) Bounds on the vertex-edge domination number of a tree. C R Math 352(5):363\u2013366","journal-title":"C R Math"},{"issue":"04","key":"982_CR8","doi-asserted-by":"publisher","first-page":"1750045","DOI":"10.1142\/S1793830917500458","volume":"09","author":"B Krishnakumari","year":"2017","unstructured":"Krishnakumari B, Chellali M, Venkatakrishnan YB (2017) Double vertex-edge domination. Discrete Math Algorithms Appl 09(04):1750045","journal-title":"Discrete Math Algorithms Appl"},{"key":"982_CR9","unstructured":"Lewis JR (2007) Vertex-edge and edge-vertex parameters in graphs. Ph.D thesis, Clemson"},{"key":"982_CR10","first-page":"193","volume":"81","author":"JR Lewis","year":"2010","unstructured":"Lewis JR, Hedetniemi ST, Haynes TW, Fricke GH (2010) Vertex-edge domination. Util Math 81:193\u2013213","journal-title":"Util Math"},{"key":"982_CR11","doi-asserted-by":"crossref","unstructured":"Li P, Wang A (2022) Polynomial Time Algorithm for $$k$$-vertex-edge Dominating Problem in Interval Graphs. AAIM, LNCS 13513","DOI":"10.1007\/978-3-031-16081-3_25"},{"issue":"2","key":"982_CR12","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 (2015) Spanning connectedness and Hamiltonian thickness of graphs and interval graphs. Discrete Math Theor Comput Sci 16(2):125\u2013210","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"1","key":"982_CR13","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/140981265","volume":"31","author":"P Li","year":"2017","unstructured":"Li P, Wu Y (2017) A linear time algorithm for the 1-fixed-endpoint path cover problem on interval graphs. SIAM J Discrete Math 31(1):210\u2013239","journal-title":"SIAM J Discrete Math"},{"key":"982_CR14","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 RH (1985) Algorithmic aspects of comparability graphs and interval graphs. In: Rival I (ed) Graphs and orders. D. Reidel, Boston, pp 41\u2013101"},{"key":"982_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10878-021-00832-z","volume":"44","author":"S Paul","year":"2021","unstructured":"Paul S, Ranjan K (2021) Results on vertex-edge and independent vertex-edge domination. J Comb Optim 44:303","journal-title":"J Comb Optim"},{"key":"982_CR16","unstructured":"Peters JKW (1986) Theoretical and algorithmic results on domination and connectivity (Nordhaus-Gaddum, Gallai type results, max\u2013min relationships, linear time, series-parallel). Ph.D thesis, Clemson"},{"key":"982_CR17","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 CP (1988) A uniform approach to domination problems on interval graphs. Inf Process Lett 27:271\u2013274","journal-title":"Inf Process Lett"},{"key":"982_CR18","first-page":"235","volume":"59","author":"A Raychaudhuri","year":"1987","unstructured":"Raychaudhuri A (1987) On powers of interval and unit interval graphs. Congr Numer 59:235\u2013242","journal-title":"Congr Numer"},{"key":"982_CR19","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 (2021) The longest cycle problem is polynomial on interval graphs. Theor Comput Sci 859:37\u201347","journal-title":"Theor Comput Sci"},{"key":"982_CR20","series-title":"London Mathematical Society Lecture Note Series","first-page":"237","volume-title":"Surveys in combinatorics","author":"WT Trotter","year":"1997","unstructured":"Trotter WT (1997) New perspectives on interval orders and interval graphs. In: Bailey RA (ed) Surveys in combinatorics, vol 241. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, pp 237\u2013286"},{"issue":"4","key":"982_CR21","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00010-018-0609-9","volume":"93","author":"P Zylinski","year":"2019","unstructured":"Zylinski P (2019) Vertex-edge domination in graphs. Aequ Math 93(4):735\u2013742","journal-title":"Aequ Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00982-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00982-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00982-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T07:51:39Z","timestamp":1675497099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00982-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["982"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00982-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"30 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"45"}}