{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:56Z","timestamp":1725664076453},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:36:30Z","timestamp":1330252590000},"page":"143-154","source":"Crossref","is-referenced-by-count":3,"title":["Trapezoid graphs and generalizations, geometry and algorithms"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"Rudolf","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Lorenz","family":"Wernisch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","volume":"37","author":"H. Alt","year":"1991","unstructured":"H. Alt, N. Blum, K. Mehlhorn and M. Paul, Computing a maximum cardinality matching in a bipartite graph in time O(n\n1.5(m\/logn).5), Inf. Proc. Letters\n37 (1991), 237\u2013240.","journal-title":"Inf. Proc. Letters"},{"key":"13_CR2","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1989."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Dagan","year":"1988","unstructured":"I. Dagan, M.C. Golumbic and R.Y. Pinter, Trapezoid Graphs and their Coloring, Discr. Appl. Math.\n21 (1988), 35\u201346.","journal-title":"Discr. Appl. Math."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M. L. Fredman","year":"1975","unstructured":"M.L. Fredman, On Computing the Length of Longest Increasing Subsequences, Discr. Math.\n11 (1975), 29\u201335.","journal-title":"Discr. Math."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"F. Gavril, Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph, Networks\n3 (1973), 361\u2013273.","journal-title":"Networks"},{"key":"13_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"13_CR7","unstructured":"E. Helly, \u00dcber die Menge konvexer K\u00f6rper mit gemeinsamen Punkten, Jahresb. d. Dt. Mathem. Ver.\n32 (1923)."},{"key":"13_CR8","unstructured":"R. McConnel and J. Spinrad, Linear-Time Modular Decomposition and Efficient Transitive Orientation of Undirected Graphs., Proc. 5. Annual Symp. on Discr. Alg. (1994)."},{"key":"13_CR9","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1983."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Embde Boas van","year":"1977","unstructured":"P. van Embde Boas, Preserving order in a forest in less than logarithmic time and linear space\u201e Inf. Proc. Letters\n6 (1977), 80\u201382.","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:12:58Z","timestamp":1619557978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}