{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:37Z","timestamp":1759063417725,"version":"3.37.3"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"israel science foundation","award":["308\/18"],"award-info":[{"award-number":["308\/18"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11590-022-01854-0","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T07:02:43Z","timestamp":1643785363000},"page":"1393-1401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matching orderable and separable hypergraphs"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4526-5534","authenticated-orcid":false,"given":"Shmuel","family":"Onn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"1854_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229168","volume":"8\u201324","author":"A Asadpour","year":"2012","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus meets hypergraph matchings. ACM Trans. Algorithms 8\u201324, 1\u20139 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"1854_CR2","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for $$3$$-dimensional matching via bounded pathwidth local search. 54th annual symposium on foundations of computer science, 509\u2013518 (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"1854_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman (1979)"},{"key":"1854_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"PE Haxell","year":"1995","unstructured":"Haxell, P.E.: A condition for matchability in hypergraphs. Graphs Combin. 11, 245\u2013248 (1995)","journal-title":"Graphs Combin."},{"key":"1854_CR5","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Annals of Discrete Mathematics 56, North-Holland (1995)"},{"key":"1854_CR6","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, New York (2003)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01854-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01854-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01854-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:19:16Z","timestamp":1652199556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01854-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,2]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1854"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01854-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,2,2]]},"assertion":[{"value":"11 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}