{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:29:42Z","timestamp":1769905782511,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0166-218x(99)00217-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:56:52Z","timestamp":1027605412000},"page":"1-19","source":"Crossref","is-referenced-by-count":19,"title":["Biconvex graphs: ordering and algorithms"],"prefix":"10.1016","volume":"103","author":[{"given":"Nesrine","family":"Abbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorna K.","family":"Stewart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00217-6_BIB1","unstructured":"N. Abbas, Graph clustering: complexity, sequential and parallel algorithms, Ph.D. Thesis, Dept. of Computing Science, University of Alberta, 1995."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB2","unstructured":"S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB3","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. M\u00fcller, Zs. Tuza, Rankings of graphs, WG 94, Herrsching, 1994, Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 292\u2013304.","DOI":"10.1007\/3-540-59071-4_56"},{"key":"10.1016\/S0166-218X(99)00217-6_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/S0895480195282550","article-title":"Rankings of graphs","volume":"11","author":"Bodlaender","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB5","unstructured":"A. Brandst\u00e4dt, Classes of bipartite graphs related to chordal graphs and domination of one color class by the other, Technical Report N\/88\/10, Friedrich-Schiller-Universit\u00e4t, Jena, 1988."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB6","doi-asserted-by":"crossref","unstructured":"J.S. Deogun, T. Kloks, D. Kratsch, H. M\u00fcller, On vertex ranking for permutation and other graphs, in Proceedings of STACS 94, Caen, 1994, Springer, Berlin, 1994, Lecture Notes in Computer Science Vol. 775, pp. 747\u2013758.","DOI":"10.1007\/3-540-57785-8_187"},{"key":"10.1016\/S0166-218X(99)00217-6_BIB7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/jagm.1997.0883","article-title":"Polygon graph recognition","volume":"26","author":"Elmallah","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(99)00217-6_BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterization of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB10","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"10.1016\/S0166-218X(99)00217-6_BIB11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/S0097539789166880","article-title":"Efficient parallel algorithms for chordal graphs","volume":"25","author":"Klein","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","article-title":"Efficient Algorithms for finding maximum matchings in convex bipartite graphs and related problems","volume":"15","author":"Lipski","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","article-title":"A Structure theorem for the consecutive 1's property","volume":"B 12","author":"Tucker","year":"1972","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(99)00217-6_BIB15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(94)00220-D","article-title":"Efficient parallel algorithms for doubly convex-bipartite graphs","volume":"147","author":"Yu","year":"1995","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:18:24Z","timestamp":1578518304000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X99002176"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00217-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}