{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:41Z","timestamp":1720640861227},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80133-7","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"89-92","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The graph sandwich problem for 1-join composition is NP-complete"],"prefix":"10.1016","volume":"5","author":[{"given":"Celina M.H.","family":"de Figueiredo","sequence":"first","affiliation":[]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80133-7_BIB1","first-page":"123","article-title":"Les problemes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publ. Inst. Statist. Univ. Paris"},{"key":"10.1016\/S1571-0653(05)80133-7_BIB2","unstructured":"C. Berge, Graphs and hypergraphs, North-Holland Publishing Co., Amsterdam, 1973, Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6."},{"key":"10.1016\/S1571-0653(05)80133-7_BIB3","series-title":"Topics on perfect graphs","first-page":"221","article-title":"A composition for perfect graphs","author":"Bixby","year":"1984"},{"issue":"no. 1","key":"10.1016\/S1571-0653(05)80133-7_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0020-0190(98)00076-3","article-title":"The homogeneous set sandwich problem","volume":"67","author":"Cerioli","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1571-0653(05)80133-7_BIB5","series-title":"Sur quelques Algorithmes de Decomposition de Graphes, Th\u00e9se","author":"Cournier","year":"1993"},{"key":"10.1016\/S1571-0653(05)80133-7_BIB6","series-title":"A Combinatorial Decomposition Theory, Thesis","author":"Cunningham","year":"1973"},{"issue":"no. 2","key":"10.1016\/S1571-0653(05)80133-7_BIB7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"32","author":"Cunningham","year":"1980","journal-title":"Canad. J. Math."},{"issue":"no. 1-3","key":"10.1016\/S1571-0653(05)80133-7_BIB9","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0024-3795(97)10075-1","article-title":"Matrix sandwich problems","volume":"277","author":"Golumbic","year":"1998","journal-title":"Linear Algebra Appl."},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/aama.1994.1009","article-title":"On the complexity of DNA physical mapping","volume":"15","author":"Golumbic","year":"1994","journal-title":"Adv. in Appl. Math."},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1006\/jagm.1995.1047","article-title":"Graph sandwich problems","volume":"19","author":"Golumbic","year":"1995","journal-title":"J. Algorithms"},{"issue":"no. 5","key":"10.1016\/S1571-0653(05)80133-7_BIB12","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1145\/174147.169675","article-title":"Complexity and algorithms for reasoning about time: a graph-theoretic approach","volume":"40","author":"Golumbic","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s003730050028","article-title":"Complexity and algorithms for graph and hypergraph sandwich problems","volume":"14","author":"Golumbic","year":"1998","journal-title":"Graphs Combin."},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB14","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/S0097539793258143","article-title":"Pathwidth bandwidth, and completion problems to proper interval graphs with small cliques","volume":"25","author":"Kaplan","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"no. 2","key":"10.1016\/S1571-0653(05)80133-7_BIB15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/PL00009277","article-title":"Bounded degree interval sandwich problems","volume":"24","author":"Kaplan","year":"1999","journal-title":"Algorithmica"},{"issue":"no. 4","key":"10.1016\/S1571-0653(05)80133-7_BIB16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0196-6774(81)90037-7","article-title":"The NP-Completeness column: an ongoing guide","volume":"2","author":"Johnson","year":"1981","journal-title":"J. Algorithms"},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lovasz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S1571-0653(05)80133-7_BIB18","unstructured":"R. M. McConnell and J. P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Arlington, VA, 1994) (New York), ACM (1994) 536-545."},{"key":"10.1016\/S1571-0653(05)80133-7_BIB19","unstructured":"J. H. Muller and J. Spinrad, Incremental modular decomposition, J. Assoc. Comput. Mach. 36(1989), no. 1, 1-19."},{"key":"10.1016\/S1571-0653(05)80133-7_BIB20","series-title":"A Semi-Strong Perfect Graph Theorem, Ph.D. Thesis, School of Computer Science","author":"Reed","year":"1986"},{"issue":"no. 3","key":"10.1016\/S1571-0653(05)80133-7_BIB21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","article-title":"P4-trees and substitution decomposition","volume":"39","author":"Spinrad","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:57:33Z","timestamp":1548514653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":21,"alternative-id":["S1571065305801337"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80133-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}