{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:18Z","timestamp":1725880578774},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_8","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"93-105","source":"Crossref","is-referenced-by-count":0,"title":["A Width Parameter Useful for Chordal and Co-comparability Graphs"],"prefix":"10.1007","author":[{"given":"Dong Yeap","family":"Kang","sequence":"first","affiliation":[]},{"given":"O-joung","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Torstein J. F.","family":"Str\u00f8mme","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"20","key":"8_CR1","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1016\/j.disc.2011.07.003","volume":"311","author":"J Balogh","year":"2011","unstructured":"Balogh, J., Kostochka, A.: Large minors in graphs with given independence number. Discret. Math. 311(20), 2203\u20132215 (2011)","journal-title":"Discret. Math."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dam.2014.03.016","volume":"173","author":"R Belmonte","year":"2014","unstructured":"Belmonte, R., Heggernes, P., van\u2019t Hof, P., Rafiey, A., Saei, R.: Graph classes and Ramsey numbers. Discret. Appl. Math. 173, 16\u201327 (2014)","journal-title":"Discret. Appl. Math."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","volume":"511","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theor. Comput. Sci. 511, 54\u201365 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"BM Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B.M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511, 66\u201376 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","series-title":"North-Holland Mathematics Studies","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-0208(08)73549-7","volume-title":"Graph Theory Proceedings of the Conference on Graph Theory","author":"P Duchet","year":"1982","unstructured":"Duchet, P., Meyniel, H.: On Hadwiger\u2019s number and the stability number. In: Bollob\u00e1s, B. (ed.) Graph Theory Proceedings of the Conference on Graph Theory. North-Holland Mathematics Studies, vol. 62, pp. 71\u201373. North-Holland, Amsterdam (1982)"},{"issue":"5","key":"8_CR7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.jctb.2011.02.008","volume":"101","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction obstructions for treewidth. J. Comb. Theory Ser. B 101(5), 302\u2013314 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"7","key":"8_CR8","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ejc.2010.05.003","volume":"31","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Oum, S., Thilikos, D.M.: Rank-width and tree-width of $$H$$ -minor-free graphs. Eur. J. Comb. 31(7), 1617\u20131628 (2010)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"8_CR9","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/090766814","volume":"24","author":"J Fox","year":"2010","unstructured":"Fox, J.: Complete minors and independence number. SIAM J. Discret. Math. 24(4), 1313\u20131321 (2010)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74839-7_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Golovach","year":"2007","unstructured":"Golovach, P., Kratochv\u00edl, J.: Computational complexity of generalized domination: a complete dichotomy for chordal graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 1\u201311. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74839-7_1"},{"issue":"6","key":"8_CR11","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.dam.2010.11.012","volume":"160","author":"PA Golovach","year":"2012","unstructured":"Golovach, P.A., Kratochv\u00edl, J., Such\u00fd, O.: Parameterized complexity of generalized domination problems. Discret. Appl. Math. 160(6), 780\u2013792 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"8_CR12","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008)","journal-title":"Comput. J."},{"issue":"2","key":"8_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)80001-7","volume":"80","author":"C Maw-Shang","year":"1997","unstructured":"Maw-Shang, C.: Weighted domination of cocomparability graphs. Discret. Appl. Math. 80(2), 135\u2013148 (1997)","journal-title":"Discret. Appl. Math."},{"key":"8_CR14","unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1994, pp. 536\u2013545. Society for Industrial and Applied Mathematics, Philadelphia (1994)"},{"key":"8_CR15","unstructured":"Mengel, S.: Lower bounds on the mim-width of some perfect graph classes. Preprint arXiv.org\/abs\/1608.01542 (2016)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0218023","volume":"18","author":"J Naor","year":"1989","unstructured":"Naor, J., Naor, M., Sch\u00e4ffer, A.A.: Fast parallel algorithms for chordal graphs. SIAM J. Comput. 18(2), 327\u2013349 (1989)","journal-title":"SIAM J. Comput."},{"issue":"s2","key":"8_CR17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30(s2), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"8_CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory Ser. A 13(1), 145\u2013147 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"8_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41(1), 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"issue":"4","key":"8_CR20","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"JA Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial $$k$$ -trees. SIAM J. Discret. Math. 10(4), 529\u2013550 (1997)","journal-title":"SIAM J. Discret. Math."},{"key":"8_CR21","unstructured":"Vatshelle, M.: New width parameters of graphs. Ph.D. thesis, University of Bergen (2012)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:54:18Z","timestamp":1498373658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}