{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:35:57Z","timestamp":1777592157073,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T00:00:00Z","timestamp":1700179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T00:00:00Z","timestamp":1700179200000},"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":["12071194, 11571155"],"award-info":[{"award-number":["12071194, 11571155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10878-023-01090-x","type":"journal-article","created":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T16:03:24Z","timestamp":1700237004000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic and complexity aspects of problems related to total restrained domination for graphs"],"prefix":"10.1007","volume":"46","author":[{"given":"Yu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai-Xia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2046-3040","authenticated-orcid":false,"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,17]]},"reference":[{"issue":"3","key":"1090_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1111\/j.1467-8640.2012.00418.x","volume":"28","author":"FS Bao","year":"2012","unstructured":"Bao FS, Zhang Y (2012) A review of tree convex sets test. Comput Intell 28(3):358\u2013372","journal-title":"Comput Intell"},{"issue":"24","key":"1090_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.05.005","volume":"448","author":"L Chen","year":"2012","unstructured":"Chen L, Zeng W, Lu C (2012) NP-completeness and APX-completeness of restrained domination in graphs. Theor Comput Sci 448(24):1\u20138","journal-title":"Theor Comput Sci"},{"issue":"3","key":"1090_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10(3):211\u2013219","journal-title":"Networks"},{"issue":"4","key":"1090_CR4","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus E, Johnson DS, Papadimitriou CH, Seymour PD, Yannakakis M (1994) The complexity of multiterminal cuts. SIAM J Comput 23(4):864\u2013894","journal-title":"SIAM J Comput"},{"issue":"1\u20133","key":"1090_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0012-365X(99)00016-3","volume":"203","author":"GS Domke","year":"1999","unstructured":"Domke GS, Hattingh JH, Hedetniemi ST, Laskar RC, Markus LR (1999) Restrained domination in graphs. Discret Math 203(1\u20133):61\u201369","journal-title":"Discret Math"},{"issue":"1","key":"1090_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D Eppstein","year":"1992","unstructured":"Eppstein D (1992) Parallel recognition of series-parallel graphs. Inform Comput 98(1):41\u201355","journal-title":"Inform Comput"},{"issue":"4","key":"1090_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of $$\\ln n$$ for approximating set cover. JACM 45(4):634\u2013652","journal-title":"JACM"},{"key":"1090_CR8","doi-asserted-by":"crossref","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker Inc, New York","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"1090_CR9","volume-title":"Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Domination in Graphs. Marcel Dekker, New York"},{"issue":"1","key":"1090_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning MA (2009) A survey of selected recent results on total domination in graphs. Discret Math 309(1):32\u201363","journal-title":"Discret Math"},{"issue":"3","key":"1090_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft JE, Tarjan RE (1973) Dividing a graph into triconnected components. SIAM J Comput 2(3):135\u2013158","journal-title":"SIAM J Comput"},{"issue":"3","key":"1090_CR12","first-page":"407","volume":"15","author":"CW Ho","year":"1999","unstructured":"Ho CW, Hsieh SY, Chen GH (1999) Parallel decomposition of generalized series-parallel graphs. J Inf Sci Eng 15(3):407\u2013417","journal-title":"J Inf Sci Eng"},{"key":"1090_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems in complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems in complexity of computer computations. Springer, Boston, pp 85\u2013103"},{"issue":"1","key":"1090_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(93)90178-Q","volume":"42","author":"JM Keil","year":"1993","unstructured":"Keil JM (1993) The complexity of domination problems in circle graphs. Discret Appl Math 42(1):51\u201363","journal-title":"Discret Appl Math"},{"issue":"2\u20133","key":"1090_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(94)90022-1","volume":"54","author":"NM Korneyenko","year":"1994","unstructured":"Korneyenko NM (1994) Combinatorial algorithms on a class of graphs. Discret Appl Math 54(2\u20133):215\u2013217","journal-title":"Discret Appl Math"},{"issue":"3","key":"1090_CR16","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar R, Pfaff J, Hedetniemi SM, Hedetniemi ST (1984) On the algorithmic complexity of total domination. SIAM J Algeb Discret Methods 5(3):420\u2013425","journal-title":"SIAM J Algeb Discret Methods"},{"issue":"1","key":"1090_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10587-005-0012-2","volume":"55","author":"DX Ma","year":"2005","unstructured":"Ma DX, Chen XG, Sun L (2005) On total restrained domination in graphs. Czechoslov Math J 55(1):165\u2013173","journal-title":"Czechoslov Math J"},{"issue":"10","key":"1090_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2018.03.029","volume":"252","author":"A Pandey","year":"2019","unstructured":"Pandey A, Panda BS (2019) Domination in some subclasses of bipartite graphs. Discret Appl Math 252(10):51\u201366","journal-title":"Discret Appl Math"},{"key":"1090_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43:425\u2013440","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"1090_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.disc.2007.03.041","volume":"308","author":"J Raczek","year":"2008","unstructured":"Raczek J, Cyman J (2008) Total restrained domination numbers of trees. Discret Math 308(1):44\u201350","journal-title":"Discret Math"},{"key":"1090_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.7151\/dmgt.1346","volume":"27","author":"J Raczek","year":"2007","unstructured":"Raczek J (2007) Trees with equal restrained domination and total restrained domination numbers. Discuss Math Graph Theory 27:83\u201391","journal-title":"Discuss Math Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01090-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T14:06:32Z","timestamp":1701180392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01090-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,17]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1090"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01090-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,17]]},"assertion":[{"value":"19 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 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":"28"}}