{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:45:52Z","timestamp":1761918352452},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0166-218x(93)90090-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"175-179","source":"Crossref","is-referenced-by-count":29,"title":["Efficient labelling algorithms for the maximum noncrossing matching problem"],"prefix":"10.1016","volume":"47","author":[{"given":"Federico","family":"Malucelli","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Ottmann","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Pretolani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90090-B_BIB1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","article-title":"On computing the length of longest increasing subsequences","volume":"11","author":"Fredman","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90090-B_BIB2","first-page":"776","article-title":"The noncross matching and applications to the 3-side switch box routing in VLSI layout design","author":"Kajitami","year":"1986","journal-title":"Proceedings International Symposium on Circuits and Systems"},{"key":"10.1016\/0166-218X(93)90090-B_BIB3","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(93)90090-B_BIB4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90090-B_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","article-title":"Bounded ordered dictionaries in O(log log N) time and O(n) space","volume":"35","author":"Melhorn","year":"1990","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0166-218X(93)90090-B_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90090-B_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(85)90067-5","article-title":"An optimal algorithm for the maximum alignment of terminals","volume":"10","author":"Widmayer","year":"1985","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390090B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390090B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:24Z","timestamp":1555122384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390090B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0166218X9390090B"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90090-b","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}