{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:57Z","timestamp":1740122457975,"version":"3.37.3"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T00:00:00Z","timestamp":1498780800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0151-z","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T11:09:32Z","timestamp":1498820972000},"page":"21-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tight lower bound for the hardness of clutters"],"prefix":"10.1007","volume":"35","author":[{"given":"Vahan","family":"Mkrtchyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5912-7936","authenticated-orcid":false,"given":"Hovhannes","family":"Sargsyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"key":"151_CR1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.physa.2006.08.067","volume":"375","author":"JC Claussen","year":"2007","unstructured":"Claussen JC (2007) Offdiagonal complexity: a computationally quick complexity measure for graphs and networks. Phys A 375:365\u2013373","journal-title":"Phys A"},{"key":"151_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial optimization: packing and covering","author":"G Cornuejols","year":"2001","unstructured":"Cornuejols G (2001) Combinatorial optimization: packing and covering. SIAM, Philadelphia"},{"issue":"3","key":"151_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.7494\/OpMath.2016.36.3.375","volume":"36","author":"S Hambartsumyan","year":"2016","unstructured":"Hambartsumyan S, Mkrtchyan VV, Musoyan VL, Sargsyan H (2016) The hardness of the independence and matching clutter of a graph. Opusc Math 36(3):375\u2013397","journal-title":"Opusc Math"},{"key":"151_CR4","unstructured":"Jukna S (2004) On graph complexity. ECCC Report, vol 5"},{"key":"151_CR5","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory. Prentice-Hall, Englewood Cliffs"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0151-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0151-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0151-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T10:31:05Z","timestamp":1515407465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0151-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,30]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0151-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,6,30]]}}}