{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T11:03:59Z","timestamp":1775387039284,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100008394","name":"DFF Natur og Univers","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.ic.2026.105440","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:50:17Z","timestamp":1773273017000},"page":"105440","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the online weighted non-crossing matching problem"],"prefix":"10.1016","volume":"310","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0725-8341","authenticated-orcid":false,"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1404-2212","authenticated-orcid":false,"given":"Shahin","family":"Kamali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0560-3794","authenticated-orcid":false,"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1564-6360","authenticated-orcid":false,"given":"Ali Mohammad","family":"Lavasani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9043-0375","authenticated-orcid":false,"given":"Yaqiao","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6183-8363","authenticated-orcid":false,"given":"Denis","family":"Pankratov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2026.105440_bib0001","series-title":"Finding Color and Shape Patterns in Images","author":"Cohen","year":"1999"},{"key":"10.1016\/j.ic.2026.105440_bib0002","series-title":"5th International Workshop on Algorithms and Data Structures (WADS)","first-page":"462","article-title":"Efficient breakout routing in printed circuit boards","volume":"1272","author":"Hershberger","year":"1997"},{"issue":"1","key":"10.1016\/j.ic.2026.105440_bib0003","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(85)90065-0","article-title":"A matching problem in the plane","volume":"31","author":"Atallah","year":"1985","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105440_bib0004","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01994880","article-title":"Applications of a semi-dynamic convex hull algorithm","volume":"32","author":"Hershberger","year":"1992","journal-title":"BIT Numer. Math."},{"key":"10.1016\/j.ic.2026.105440_bib0005","series-title":"32nd Canadian Conference on Computational Geometry (CCCG)","first-page":"233","article-title":"Non-crossing matching of online points","author":"Bose","year":"2020"},{"key":"10.1016\/j.ic.2026.105440_bib0006","series-title":"Non-crossing matching of online points","author":"Sajadpour","year":"2021"},{"key":"10.1016\/j.ic.2026.105440_bib0007","series-title":"34th Canadian Conference on Computational Geometry (CCCG)","first-page":"198","article-title":"A randomized algorithm for non-crossing matching of online points","author":"Kamali","year":"2022"},{"key":"10.1016\/j.ic.2026.105440_bib0008","article-title":"Advice complexity of online non-crossing matching","volume":"110","author":"Mohammad Lavasani","year":"2023","journal-title":"Computat. Geom."},{"issue":"1\u20133","key":"10.1016\/j.ic.2026.105440_bib0009","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(99)00201-0","article-title":"On a matching problem in the plane","volume":"211","author":"Dumitrescu","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.ic.2026.105440_bib0010","series-title":"International Workshop on Combinatorial Algorithms (IWOCA)","first-page":"405","article-title":"Stable noncrossing matchings","volume":"11638","author":"Ruangwises","year":"2019"},{"issue":"9","key":"10.1016\/j.ic.2026.105440_bib0011","doi-asserted-by":"crossref","first-page":"2678","DOI":"10.1007\/s00453-021-00832-9","article-title":"Strongly stable and maximum weakly stable noncrossing matchings","volume":"83","author":"Hamada","year":"2021","journal-title":"Algorithmica"},{"issue":"6-7","key":"10.1016\/j.ic.2026.105440_bib0012","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","article-title":"Compatible geometric matchings","volume":"42","author":"Aichholzer","year":"2009","journal-title":"Comput. Geom."},{"key":"10.1016\/j.ic.2026.105440_bib0013","series-title":"34th Canadian Conference on Computational Geometry (CCCG)","first-page":"249","article-title":"Diverse non crossing matchings","author":"Misra","year":"2022"},{"key":"10.1016\/j.ic.2026.105440_bib0014","series-title":"9th Annual Symposium on Computational Geometry (SoCG)","first-page":"257","article-title":"Long non-crossing configurations in the plane","author":"Alon","year":"1993"},{"issue":"3","key":"10.1016\/j.ic.2026.105440_bib0015","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.comgeo.2013.10.005","article-title":"Bottleneck non-crossing matching in the plane","volume":"47","author":"Abu-Affash","year":"2014","journal-title":"Comput. Geom."},{"key":"10.1016\/j.ic.2026.105440_bib0016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2023.09.016","article-title":"New variants of perfect non-crossing matchings","volume":"343","author":"Mantas","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ic.2026.105440_bib0017","series-title":"51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)","first-page":"1158","article-title":"Planar point sets determine many pairwise crossing segments","author":"Pach","year":"2019"},{"key":"10.1016\/j.ic.2026.105440_bib0018","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s00453-023-01147-7","article-title":"Perfect matchings with crossings","volume":"86","author":"Aichholzer","year":"2024","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2026.105440_bib0019","first-page":"17","article-title":"Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle","volume":"AD","author":"Balogh","year":"2005","journal-title":"Discrete Math. Theor. Comput. Sci. Proc."},{"key":"10.1016\/j.ic.2026.105440_bib0020","series-title":"XIV Spanish Meeting on Computational Geometry","first-page":"209","article-title":"Heavy non-crossing increasing paths and matchings on point sets","author":"Sakai","year":"2011"},{"issue":"8","key":"10.1016\/j.ic.2026.105440_bib0021","doi-asserted-by":"crossref","first-page":"4121","DOI":"10.1090\/S0002-9947-2013-05729-7","article-title":"A uniform bijection between nonnesting and noncrossing partitions","volume":"365","author":"Armstrong","year":"2013","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.ic.2026.105440_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.aim.2022.108603","article-title":"A web basis of invariant polynomials from noncrossing partitions","volume":"408","author":"Patrias","year":"2022","journal-title":"Adv. Math."},{"issue":"6","key":"10.1016\/j.ic.2026.105440_bib0023","doi-asserted-by":"crossref","first-page":"3083","DOI":"10.1090\/S0002-9947-08-04579-0","article-title":"Polynomials, meanders, and paths in the lattice of noncrossing partitions","volume":"361","author":"Savitt","year":"2009","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"10.1016\/j.ic.2026.105440_bib0024","first-page":"75","article-title":"Edge-removal and non-crossing configurations in geometric graphs","volume":"12","author":"Aichholzer","year":"2010","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105440_bib0025","series-title":"Annales Univ. Sci. Budapest","first-page":"47","article-title":"Ramsey and Tur\u00e1n-type problems for non-crossing subgraphs of bipartite geometric graphs","volume":"54","author":"Gy\u00e1rf\u00e1s","year":"2011"},{"key":"10.1016\/j.ic.2026.105440_bib0026","series-title":"6th Annual Symposium on Combinatorial Pattern Matching (CPM)","first-page":"1","article-title":"Computing similarity between RNA strings","volume":"937","author":"Bafna","year":"1995"},{"issue":"52","key":"10.1016\/j.ic.2026.105440_bib0027","doi-asserted-by":"crossref","first-page":"22061","DOI":"10.1073\/pnas.0907269106","article-title":"Random k-noncrossing RNA structures","volume":"106","author":"Chen","year":"2009","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"10.1016\/j.ic.2026.105440_bib0028","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1134\/S0032946013010055","article-title":"Non-crossing matchings","volume":"49","author":"Vladimirov","year":"2013","journal-title":"Prob. Inf. Transm."},{"key":"10.1016\/j.ic.2026.105440_bib0029","series-title":"Japanese Conference on Discrete and Computational Geometry","first-page":"246","article-title":"Tight bounds for visibility matching of f-equal width objects","author":"Rappaport","year":"2002"},{"key":"10.1016\/j.ic.2026.105440_bib0030","series-title":"XVI Spanish Meeting on Computational Geometry","article-title":"Matching regions in the plane using non-crossing segments","author":"Aloupis","year":"2015"},{"key":"10.1016\/j.ic.2026.105440_bib0031","series-title":"18th Annual Symposium on Foundations of Computer Science","first-page":"222","article-title":"Probabilistic computations: toward a unified measure of complexity","author":"Yao","year":"1977"},{"issue":"32","key":"10.1016\/j.ic.2026.105440_bib0032","first-page":"1","article-title":"Online algorithms with advice: a survey","volume":"50","author":"Boyar","year":"2017","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/j.ic.2026.105440_bib0033","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of the integers","volume":"21","author":"Elias","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ic.2026.105440_bib0034","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-22144-1","article-title":"An Introduction to Catalan Numbers","author":"Roman","year":"2015"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000386?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000386?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T10:26:23Z","timestamp":1775384783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":34,"alternative-id":["S0890540126000386"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105440","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the online weighted non-crossing matching problem","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105440","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"105440"}}