{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:44Z","timestamp":1725869504742},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_18","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"241-253","source":"Crossref","is-referenced-by-count":0,"title":["Safe Sets in Graphs: Graph Classes and Structural Parameters"],"prefix":"10.1007","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":"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":[[2016,10,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","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.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"18_CR2","unstructured":"Bapat, R.B., Fujita, S., Legay, S., Manoussakis, Y., Matsui, Y., Sakuma, T., Tuza, Z.: Network majority on tree topological network (2016). http:\/\/www2u.biglobe.ne.jp\/~sfujita\/fullpaper.pdf"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14, 1\u201323 (1993)","journal-title":"J. Algorithms"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., M\u00fcller, H., Tuza, Z.: Rankings of graphs. SIAM J. Discrete Math. 11, 168\u2013181 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Theor. Inform. Appl. 26, 257\u2013286 (1992)","journal-title":"Theor. Inform. Appl."},{"key":"18_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"18_CR10","doi-asserted-by":"crossref","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.: Safe set problem on graphs. Discrete Appl. Math. 215, 106\u2013111 (2016)","journal-title":"Discrete Appl. Math."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/978-3-662-48350-3_56","volume-title":"Algorithms - ESA 2015","author":"G Gutin","year":"2015","unstructured":"Gutin, G., Jones, M., Wahlstr\u00f6m, M.: Structural parameterizations of the mixed chinese postman problem. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 668\u2013679. Springer, Heidelberg (2015)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth: Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)"},{"key":"18_CR13","series-title":"Algorithms and combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms. Algorithms and combinatorics, vol. 28. Springer, Heidelberg (2012)"},{"key":"18_CR14","unstructured":"Pothen, A.: The complexity of optimal elimination trees. Technical report CS-88-13. Pennsylvania State University (1988)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:24:36Z","timestamp":1498343076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}