{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:52Z","timestamp":1725664372850},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615767"},{"type":"electronic","value":"9783540706274"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61576-8_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:58:06Z","timestamp":1330293486000},"page":"275-287","source":"Crossref","is-referenced-by-count":0,"title":["Contiguity orders"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Bouchitt\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelmajid","family":"Hilali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"J\u00e9gou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Xavier","family":"Rampon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"K.S. Booth, G.S. Lueker, Testing for the Consecutive Ones Property, Interval Graphs and Graph Planarity Using PQ-Tree Algorithms. Journal of Computer and System Science 13, 335\u2013379 (1976).","journal-title":"Journal of Computer and System Science"},{"key":"23_CR2","first-page":"1427","volume":"315","author":"V. Bouchitt\u00e9","year":"1992","unstructured":"V. Bouchitt\u00e9, R. J\u00e9gou, J.X. Rampon, Ordres repr\u00e9sentables par des translations de segments dans le plan. C.R. Acad. Sci. Paris, t. 315, S\u00e9rie I, p. 1427\u20131430, 1992.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01108705","volume":"10","author":"V. Bouchitt\u00e9","year":"1993","unstructured":"V. Bouchitt\u00e9, R. J\u00e9gou, J.X. Rampon, Line-Directionality of Orders. Order 10: 17\u201330, 1993.","journal-title":"Order"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. Lecture Notes in Computer Science N\u2218 380, pp. 68\u201377, Springer-Verlag 1990.","DOI":"10.1007\/3-540-51498-8_7"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G. Brightwell","year":"1991","unstructured":"G. Brightwell, P. Winkler Counting Linear Extensions. Order 8: 225\u2013242, 1991.","journal-title":"Order"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, The Computation of the Jump Number of Convex Graphs. Lecture Notes in Computer Science N\u2218 831, pp. 176\u2013185, Springer-Verlag 1994.","DOI":"10.1007\/BFb0019434"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00333133","volume":"2","author":"B. Dreesen","year":"1985","unstructured":"B. Dreesen, W. Poguntke, P. Winkler Comparability Invariance of the Fixed Point Property. Order 2: 269\u2013274, 1985.","journal-title":"Order"},{"key":"23_CR8","unstructured":"P. Duchet, Repr\u00e9sentations, noyaux en th\u00e9orie des graphes et hypergraphes. Doctorat d'\u00c9tat \u00e8s Science Paris VI, 1979."},{"key":"23_CR9","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","volume":"12","author":"M. Habib","year":"1985","unstructured":"M. Habib, R. J\u00e9gou, N-free Posets as Generalizations of Series-Parallel Posets. Discrete Applied Mathematics 12 (1985) 279\u2013291.","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"D. Kelly, Comparability Graphs. I. Rival (ed.), Graphs and Order, 3\u201340. 1985 by D.Reidel Publishing Company.","DOI":"10.1007\/978-94-009-5315-4_1"},{"issue":"N\u22183","key":"23_CR12","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"XXVII","author":"D. Kelly","year":"1975","unstructured":"D. Kelly, I. Rival, Planar Lattices. Canadian Journal of Mathematics, Vol. XXVII N\u2218 3, (1975), 636\u2013665.","journal-title":"Canadian Journal of Mathematics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00563529","volume":"6","author":"H.A. Kierstead","year":"1989","unstructured":"H.A. Kierstead, S.G. Penrice, Computing the Dimension of N-Free Ordered Sets is NP-complete. Order 6: 133\u2013136, 1989.","journal-title":"Order"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00383398","volume":"8","author":"J. Mitas","year":"1991","unstructured":"J. Mitas, Tackling the Jump Number of Interval Orders. Order 8: 115\u2013132. 1991.","journal-title":"Order"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, Computationally Tractable Classes of Ordered Sets. I. Rival (ed.), Algorithms and Order, 105\u2013193. 1989 by Kluwer Academic Publishers.","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0166-218X(94)90105-8","volume":"51","author":"A. Quilliot","year":"1994","unstructured":"A. Quilliot, S.X. Chao, Algorithmic Characterizations of Interval Ordered Hypergraphs and Applications. Discrete Applied Mathematics 51 (1994) 159\u2013170.","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00714475","volume":"4","author":"I. Rival","year":"1988","unstructured":"I. Rival et J. Urrutia, Representing Orders on the Plane by Translating Convex Figures. Order 4: 319\u2013339, 1988.","journal-title":"Order"},{"issue":"N\u22183","key":"23_CR18","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"J. Spinrad, On Comparability and Permutation Graphs. SIAM Journal of Computing Vol. 14, N\u2218 3, August 1985, 658\u2013670.","journal-title":"SIAM Journal of Computing"},{"key":"23_CR19","unstructured":"J. Spinrad, Private communication."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinrad","year":"1987","unstructured":"J. Spinrad, A. Brandst\u00e4dt, L. Stewart, Bipartite Permutation Graphs. Discrete Applied Mathematics 18 (1987) 279\u2013292.","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"W.T. Trotter, Combinatorics and Partially Ordered Sets, Dimension Theory. The Johns Hopkins University Press, 1992.","DOI":"10.56021\/9780801844256"}],"container-title":["Lecture Notes in Computer Science","Combinatorics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61576-8_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T19:13:34Z","timestamp":1687288414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61576-8_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615767","9783540706274"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61576-8_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}