{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:51Z","timestamp":1759063791283},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0166-218x(01)00246-3","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T11:06:34Z","timestamp":1034334394000},"page":"73-82","source":"Crossref","is-referenced-by-count":20,"title":["The graph sandwich problem for 1-join composition is NP-complete"],"prefix":"10.1016","volume":"121","author":[{"given":"Celina M.H.","family":"de Figueiredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00246-3_BIB1","first-page":"123","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publ. Inst. Statist. Univ. Paris"},{"key":"10.1016\/S0166-218X(01)00246-3_BIB2","unstructured":"C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973. Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6."},{"key":"10.1016\/S0166-218X(01)00246-3_BIB3","doi-asserted-by":"crossref","unstructured":"R.E. Bixby, A Composition for Perfect Graphs, Topics on perfect graphs, North-Holland, Amsterdam, 1984, pp. 221\u2013224.","DOI":"10.1016\/S0304-0208(08)72937-2"},{"issue":"1","key":"10.1016\/S0166-218X(01)00246-3_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":"Inf. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00246-3_BIB5","unstructured":"A. Cournier, Sur quelques Algorithmes de D\u00e9composition de Graphes, Th\u00e9se Universit\u00e9 Montpellier II, France, 1993."},{"key":"10.1016\/S0166-218X(01)00246-3_BIB6","unstructured":"W.H. Cunningham, A combinatorial decomposition theory, Thesis, University of Waterloo, Canada, 1973."},{"issue":"2","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"1\u20133","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"5","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"2","key":"10.1016\/S0166-218X(01)00246-3_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":"4","key":"10.1016\/S0166-218X(01)00246-3_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":"3","key":"10.1016\/S0166-218X(01)00246-3_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":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00246-3_BIB18","unstructured":"R.M. McConnell, 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, ACM, New York, 1994, pp. 536\u2013545."},{"issue":"1","key":"10.1016\/S0166-218X(01)00246-3_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","article-title":"Incremental modular decomposition","volume":"36","author":"Muller","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(01)00246-3_BIB20","unstructured":"B. Reed, A semi-strong perfect graph theorem, Ph.D. Thesis, School of Computer Science, McGill University, Canada, 1986."},{"issue":"3","key":"10.1016\/S0166-218X(01)00246-3_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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:29:26Z","timestamp":1555180166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0166218X01002463"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00246-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}