{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:25:46Z","timestamp":1743099946965,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"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-662-53536-3_16","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"183-194","source":"Crossref","is-referenced-by-count":7,"title":["On Distance-d Independent Set and Other Problems in Graphs with \u201cfew\u201d Minimal Separators"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Montealegre","sequence":"first","affiliation":[]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A Berry","year":"2000","unstructured":"Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11(3), 397\u2013403 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"16_CR2","first-page":"164","volume":"7","author":"A Berry","year":"2000","unstructured":"Berry, A., Bordat, J.P., Heggernes, P.: Recognizing weakly triangulated graphs by edge separability. Nord. J. Comput. 7(3), 164\u2013177 (2000)","journal-title":"Nord. J. Comput."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-56939-1_66","volume-title":"Automata Languages and Programming","author":"H Bodlaender","year":"1993","unstructured":"Bodlaender, H., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) Automata Languages and Programming. LNCS, vol. 700, pp. 114\u2013125. Springer, Heidelberg (1993)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"16_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","volume":"276","author":"V Bouchitt\u00e9","year":"2002","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1\u20132), 17\u201332 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00224-013-9478-8","volume":"54","author":"N Bousquet","year":"2014","unstructured":"Bousquet, N., Gon\u00e7alves, D., Mertzios, G.B., Paul, C., Sau, I., Thomass\u00e9, S.: Parameterized domination in circle graphs. Theor. Comput. Syst. 54(1), 45\u201372 (2014)","journal-title":"Theor. Comput. Syst."},{"issue":"6","key":"16_CR7","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"M-S Chang","year":"1998","unstructured":"Chang, M.-S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"16_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36(5), 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"16_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H Fraysseix de","year":"1981","unstructured":"de Fraysseix, H.: Local complementation and interlacement graphs. Discrete Math. 33(1), 29\u201335 (1981)","journal-title":"Discrete Math."},{"issue":"2","key":"16_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2650261","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and IDs. ACM Trans. Algorithms 11(2), 1\u201320 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"16_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.jda.2009.01.005","volume":"8","author":"B Escoffier","year":"2010","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1), 36\u201349 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"16_CR12","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10878-012-9594-4","volume":"27","author":"H Eto","year":"2014","unstructured":"Eto, H., Guo, F., Miyano, E.: Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27(1), 88\u201399 (2014)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"16_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015)","journal-title":"SIAM J. Comput."},{"unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Marion, J.-Y., Schwentick, T. (eds.) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, LIPIcs, March 4\u20136, 2010, Nancy, France, vol. 5, pp. 383\u2013394. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)","key":"16_CR14"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.dam.2014.04.016","volume":"174","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Rafiey, A.: Finding clubs in graph classes. Discrete Appl. Math. 174, 57\u201365 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"16_CR16","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/jagm.1998.0936","volume":"28","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., Wong, C.K.: Minimum fill-in on circle and circular-arc graphs. J. Algorithms 28(2), 272\u2013289 (1998)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Montealegre, P., Todinca, I.: On distance- $$d$$ independent set and other problems in graphs with few minimal separators. ArXiv e-prints, July 2016","key":"16_CR17","DOI":"10.1007\/978-3-662-53536-3_16"},{"issue":"2","key":"16_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jagm.1999.1005","volume":"32","author":"J Scott Provan","year":"1999","unstructured":"Scott Provan, J., Burk, R.C.: Two-connected augmentation problems in planar graphs. J. Algorithms 32(2), 87\u2013107 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"16_CR19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"J Donald Rose","year":"1976","unstructured":"Donald Rose, J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"unstructured":"Vatshelle, M.: New width parameters of graphs. Ph.D. thesis, University of Bergen, Norway (2012)","key":"16_CR20"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T22:01:44Z","timestamp":1568412104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}