{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T17:50:11Z","timestamp":1779126611098,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1982,11,1]],"date-time":"1982-11-01T00:00:00Z","timestamp":404956800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1982,11]]},"DOI":"10.1016\/0167-6377(82)90038-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:41:01Z","timestamp":1056984061000},"page":"190-193","source":"Crossref","is-referenced-by-count":36,"title":["A good submatrix is hard to find"],"prefix":"10.1016","volume":"1","author":[{"suffix":"III","given":"John J.","family":"Bartholdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90038-4_BIB1","series-title":"Technical Report","article-title":"A field guide to recognizing network flow and matching problems","author":"Bartholdi","year":"1977"},{"key":"10.1016\/0167-6377(82)90038-4_BIB2","unstructured":"J.J. Bartholdi and J.B. Orlin, \u201cRecognition of matching problems\u201d, work in progress."},{"issue":"3","key":"10.1016\/0167-6377(82)90038-4_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Math. Operations Res."},{"key":"10.1016\/0167-6377(82)90038-4_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6377(82)90038-4_BIB5","first-page":"382","article-title":"On matrices with non-positive off-diagonal elements and positive principal minor","volume":"11","author":"Fielder","year":"1962","journal-title":"Czech. Math. J."},{"key":"10.1016\/0167-6377(82)90038-4_BIB6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0167-6377(82)90038-4_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(82)90038-4_BIB8","series-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","first-page":"265","article-title":"On the complexity of the maximum subgraph problem","author":"Lewis","year":"1978"},{"key":"10.1016\/0167-6377(82)90038-4_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6377(82)90038-4_BIB10","series-title":"Linear and Combinatorial Programming","author":"Murty","year":"1976"},{"key":"10.1016\/0167-6377(82)90038-4_BIB11","series-title":"Combinatorial Programming: Methods and Applications","first-page":"278","article-title":"Characterization of totally unimodular, balanced, and perfect matrices","author":"Padberg","year":"1975"},{"issue":"3","key":"10.1016\/0167-6377(82)90038-4_BIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","volume":"28","author":"Seymour","year":"1980","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0167-6377(82)90038-4_BIB13","series-title":"Linear Algebra and Its Applications","author":"Strang","year":"1980"},{"key":"10.1016\/0167-6377(82)90038-4_BIB14","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","article-title":"Matrix characterizations of circular arc graphs","volume":"39","author":"Tucker","year":"1971","journal-title":"Pacific J. Math."},{"issue":"2","key":"10.1016\/0167-6377(82)90038-4_BIB15","doi-asserted-by":"crossref","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"Siam J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T07:52:35Z","timestamp":1552895555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,11]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,11]]}},"alternative-id":["0167637782900384"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90038-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,11]]}}}