{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:43:10Z","timestamp":1648896190832},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00291-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"267-271","source":"Crossref","is-referenced-by-count":0,"title":["Edge search in hypergraphs"],"prefix":"10.1016","volume":"162","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]},{"given":"Matthias","family":"L\u00f6we","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00291-4_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(86)90026-0","article-title":"Search problems on graphs","volume":"14","author":"Aigner","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00291-4_BIB2","series-title":"Combinatorial Search","author":"Aigner","year":"1988"},{"key":"10.1016\/0012-365X(95)00291-4_BIB3","doi-asserted-by":"crossref","unstructured":"M. Aigner and E. Triesch, Realizability and uniqueness in graphs, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(94)00104-Q"},{"key":"10.1016\/0012-365X(95)00291-4_BIB4","series-title":"Search Problems","author":"Ahlswede","year":"1987"},{"key":"10.1016\/0012-365X(95)00291-4_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)90473-7","article-title":"Edge search in graphs and hypergraphs of bounded rank","volume":"115","author":"Alth\u00f6fer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00291-4_BIB6","series-title":"Graph Theory: An Introductory Course","author":"Bollobas","year":"1979"},{"key":"10.1016\/0012-365X(95)00291-4_BIB7","doi-asserted-by":"crossref","unstructured":"P. Damaschke, A tight upper bound for group testing in graphs. Discrete Math., to appear.","DOI":"10.1016\/0166-218X(92)00120-B"},{"key":"10.1016\/0012-365X(95)00291-4_BIB8","series-title":"Combinatorial Group testing and its Applications","author":"Du","year":"1993"},{"key":"10.1016\/0012-365X(95)00291-4_BIB9","unstructured":"E. Triesch, Suchprobleme in Graphen und Hypergraphen, Habilitation Thesis, RWTH Aachen, Department of Mathematics and Computer Science."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95002914?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95002914?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:26:20Z","timestamp":1556130380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95002914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X95002914"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00291-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}