{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:22:36Z","timestamp":1761805356025,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 15K04979","KAKENHI 16K05260"],"award-info":[{"award-number":["KAKENHI 15K04979","KAKENHI 16K05260"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 26400185","KAKENHI 26540005"],"award-info":[{"award-number":["KAKENHI 26400185","KAKENHI 26540005"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["KAKENHI 24106004"],"award-info":[{"award-number":["KAKENHI 24106004"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["KAKENHI 24220003"],"award-info":[{"award-number":["KAKENHI 24220003"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011019","name":"NKFIH","doi-asserted-by":"crossref","award":["116095"],"award-info":[{"award-number":["116095"]}],"id":[{"id":"10.13039\/501100011019","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":[[2018,11]]},"DOI":"10.1007\/s10878-017-0205-2","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T15:51:36Z","timestamp":1510933896000},"page":"1221-1242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Safe sets in graphs: Graph classes and structural parameters"],"prefix":"10.1007","volume":"36","author":[{"given":"Raquel","family":"\u00c1gueda","sequence":"first","affiliation":[]},{"given":"Nathann","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Shinya","family":"Fujita","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Legay","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Manoussakis","sequence":"additional","affiliation":[]},{"given":"Yasuko","family":"Matsui","sequence":"additional","affiliation":[]},{"given":"Leandro","family":"Montero","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Naserasr","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Tadashi","family":"Sakuma","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]},{"given":"Renyu","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"key":"205_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs. J Algorithms 12:308\u2013340","journal-title":"J Algorithms"},{"key":"205_CR2","doi-asserted-by":"crossref","unstructured":"Bapat RB, Fujita S, Legay S, Manoussakis Y, Matsui Y, Sakuma T, Tuza Z (2016) Safe sets, network majority on weighted trees. Networks (To appear).","DOI":"10.1016\/j.endm.2016.09.015"},{"key":"205_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender HL (1993) On linear time minor tests with depth-first search. J Algorithms 14:1\u201323","journal-title":"J Algorithms"},{"key":"205_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25:1305\u20131317","journal-title":"SIAM J Comput"},{"key":"205_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender HL, Deogun JS, Jansen K, Kloks T, Kratsch D, M\u00fcller Haiko, Tuza Z (1998) Rankings of graphs. SIAM J Discrete Math. 11:168\u2013181","journal-title":"SIAM J Discrete Math."},{"key":"205_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth KS, Lueker GS (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13:335\u2013379","journal-title":"J Comput Syst Sci"},{"key":"205_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle B (1992) The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Theor Inform Appl 26:257\u2013286","journal-title":"Theor Inform Appl"},{"key":"205_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Berlin"},{"key":"205_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162:439\u2013485","journal-title":"Ann Math"},{"key":"205_CR10","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"Michael R. Fellows","year":"2008","unstructured":"Fellows MR, Lokshtanov D, Misra N, Rosamond FA, Saurabh S (2008). Graph layout problems parameterized by vertex cover. In: ISAAC 2008, volume 5369 of Lecture notes in computer science, pp 294\u2013305"},{"key":"205_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2016.07.020","volume":"215","author":"S Fujita","year":"2016","unstructured":"Fujita S, MacGillivray G, Sakuma T (2016) Safe set problem on graphs. Discrete Appl Math 215:106\u2013111","journal-title":"Discrete Appl Math"},{"key":"205_CR12","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Johnson DS (1977) The rectilinear Steiner tree problem is NP-complete. SIAM J Appl Math 32:826\u2013834","journal-title":"SIAM J Appl Math"},{"key":"205_CR13","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-662-48350-3_56","volume-title":"Algorithms - ESA 2015","author":"Gregory Gutin","year":"2015","unstructured":"Gutin G, Jones M, Wahlstr\u00f6m M (2015) Structural parameterizations of the mixed chinese postman problem. In: ESA 2015, volume 9294 of Lecture notes in computer science, pp 668\u2013679"},{"key":"205_CR14","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Proceedings of a symposium on the complexity of computer computations. The IBM research symposia series, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"205_CR15","doi-asserted-by":"crossref","unstructured":"Kloks T (1994) Treewidth, computations and approximations, volume 842 of Lecture notes in computer science. Springer","DOI":"10.1007\/BFb0045375"},{"key":"205_CR16","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"Jaroslav Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il J, de\u00a0Mendez PO (2012) Sparsity: graphs, structures, and algorithms, volume\u00a028 of Algorithms and combinatorics. Springer, Berlin"},{"key":"205_CR17","unstructured":"Pothen A (1988) The complexity of optimal elimination trees. Technical Report CS-88-13, Pennsylvania State University"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0205-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0205-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0205-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T12:48:12Z","timestamp":1589719692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0205-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["205"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0205-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}