{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T02:19:57Z","timestamp":1775355597940,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":9360,"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":[[1987,12]]},"DOI":"10.1016\/s0166-218x(87)80003-3","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T16:06:18Z","timestamp":1121184378000},"page":"279-292","source":"Crossref","is-referenced-by-count":192,"title":["Bipartite permutation graphs"],"prefix":"10.1016","volume":"18","author":[{"given":"Jeremy","family":"Spinrad","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"additional","affiliation":[]},{"given":"Lorna","family":"Stewart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(87)80003-3_bib1","first-page":"73","article-title":"NP-completeness of the Hamilton cycle problem for bipartite graphs","volume":"3","author":"Akiyama","year":"1980","journal-title":"J. Inform. Process."},{"key":"10.1016\/S0166-218X(87)80003-3_bib2","article-title":"On the restriction of some NP-complete graph problems to permutation graphs","author":"Brandst\u00e4dt","year":"1984","journal-title":"Forschungsergebnisse Friedrich-Schiller-Universit\u00e4t Jena N\/84\/80"},{"key":"10.1016\/S0166-218X(87)80003-3_bib3","article-title":"On domination problems for permutation and other graphs","author":"Brandst\u00e4dt","year":"1985","journal-title":"Forschungsergebnisse Friedrich-Schiller-Universit\u00e4t Jena N\/85\/41"},{"key":"10.1016\/S0166-218X(87)80003-3_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":"1976","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0166-218X(87)80003-3_bib5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(87)80003-3_bib6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","article-title":"Finding minimum dominating cycles in permutation graphs","volume":"4","author":"Colbourn","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(87)80003-3_bib7","article-title":"Permutation graphs: connected domination and Steiner trees","author":"Colbourn","year":"1985","journal-title":"Univ. of Waterloo Research Report CS-85-02"},{"key":"10.1016\/S0166-218X(87)80003-3_bib8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/net.3230110103","article-title":"On testing isomorphism of permutation graphs","volume":"11","author":"Colbourn","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(87)80003-3_bib9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","article-title":"Permutation graphs and transitive graphs","volume":"19","author":"Even","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(87)80003-3_bib10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","article-title":"Domination in permutation graphs","volume":"6","author":"Farber","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(87)80003-3_bib11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare Graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungary"},{"key":"10.1016\/S0166-218X(87)80003-3_bib12","series-title":"Computers and Intractability, A Guide to the Theory of NP- Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(87)80003-3_bib13","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(87)80003-3_bib14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02253207","article-title":"The complexity of comparability graph recognition and coloring","volume":"18","author":"Golumbic","year":"1977","journal-title":"Comput."},{"key":"10.1016\/S0166-218X(87)80003-3_bib15","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(87)80003-3_bib16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"A n5\/2 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(87)80003-3_bib17","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(87)80003-3_bib18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"The NP-completeness column: an ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithm"},{"key":"10.1016\/S0166-218X(87)80003-3_bib19","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: an ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithm"},{"key":"10.1016\/S0166-218X(87)80003-3_bib20","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithm"},{"key":"10.1016\/S0166-218X(87)80003-3_bib21","first-page":"116","article-title":"Graphen und Matrizen","volume":"38","author":"Konig","year":"1931","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/S0166-218X(87)80003-3_bib22","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/990518.990521","article-title":"An NP-hard problem in bipartite graphs","volume":"7","author":"Krishnamoorthy","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/S0166-218X(87)80003-3_bib23","series-title":"The Many Facets of Graph Theory","first-page":"237","article-title":"Hamilton circuits in graphs and digraphs","author":"Nash-Williams","year":"1969"},{"key":"10.1016\/S0166-218X(87)80003-3_bib24","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permuta-tion graphs","volume":"23","author":"Pneuli","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0166-218X(87)80003-3_bib25","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0166-218X(87)80003-3_bib26","article-title":"Two dimensional partial orders","author":"Spinrad","year":"1982"},{"key":"10.1016\/S0166-218X(87)80003-3_bib27","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(87)80003-3_bib28","unstructured":"G. Steiner and L.K. Stewart, A linear time algorithm to find the jump number of two dimensional bipartite partial orders, submitted for publication."},{"key":"10.1016\/S0166-218X(87)80003-3_bib29","article-title":"Permutation graph structure and algorithms","author":"Stewart","year":"1985"},{"key":"10.1016\/S0166-218X(87)80003-3_bib30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T10:54:08Z","timestamp":1548327248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X87800033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["S0166218X87800033"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(87)80003-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}