{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T15:26:55Z","timestamp":1658935615554},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0166-218x(99)00022-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"205-225","source":"Crossref","is-referenced-by-count":6,"title":["On lower bounds for numbered complete graphs"],"prefix":"10.1016","volume":"94","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Brigitte","family":"Jaumard","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00022-0_BIB1","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/TCOM.1986.1096587","article-title":"Integer sets with distinct sums and differences and carrier frequency assignment for nonlinear repeaters","author":"Atkinson","year":"1986","journal-title":"IEEE Trans. Commun. COM-34"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB2","series-title":"Graph Theory and Combinatorics","first-page":"12","article-title":"Graceful Graphs radio antennae and french windmills","author":"Bermond","year":"1979"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB3","series-title":"Theory and Applications of Graphs","first-page":"53","article-title":"Numbered complete graphs, unusual rulers, and assorted applications","volume":"vol. 642","author":"Bloom","year":"1978"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(91)90408-T","article-title":"Lower bounds on multiple difference sets","volume":"98","author":"Chen","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00022-0_BIB5","first-page":"191","article-title":"T-colorings of graphs and the channel assignment problem","volume":"35","author":"Cozzens","year":"1982"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1038\/scientificamerican0885-16","article-title":"The search for an invisible ruler that will help radio astronomers to measure the earth","author":"Dewdney","year":"1985","journal-title":"Scientific Amer."},{"issue":"4","key":"10.1016\/S0166-218X(99)00022-0_BIB7","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1002\/jgt.3190130410","article-title":"A survey: recent results, conjectures, and open problems in labeling graphs","volume":"13","author":"Gallian","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB8","series-title":"Graph Theory and Computing","first-page":"23","article-title":"How to number a graph","author":"Golomb","year":"1972"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB9","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1979"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(99)00022-0","article-title":"On lower bounds for numbered complete graphs","author":"Hansen","year":"1997"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB11","article-title":"A faster algorithm for determining an optimal Golomb ruler","author":"Jaumard","year":"1999"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/18.2652","article-title":"Bounds on the size of optimal difference triangle sets","author":"KlVove","year":"1988","journal-title":"IEEE Trans. Inform. Theory IT-34"},{"issue":"4","key":"10.1016\/S0166-218X(99)00022-0_BIB13","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/18.32165","article-title":"Bounds and construction for difference triangle sets","volume":"35","author":"KlVove","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0166-218X(99)00022-0_BIB14","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/18.212309","article-title":"Difference bases and sparse sensor arrays","volume":"39","author":"Linebarger","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0166-218X(99)00022-0_BIB15","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1109\/18.133274","article-title":"Application of linear programming to the optimal difference triangle set problem","volume":"37","author":"Lorentzen","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB16","series-title":"Computers in Number Theory","first-page":"299","article-title":"Difference bases: three problems in additive number theory","author":"Miller","year":"1971"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB17","article-title":"Optimal Golomb rulers: an exhaustive parallel search implementation","author":"Rankin","year":"1993"},{"issue":"12","key":"10.1016\/S0166-218X(99)00022-0_BIB18","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/TC.1979.1675287","article-title":"Optimum Golomb Rulers","volume":"C-28","author":"Robinson","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(99)00022-0_BIB19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/18.50388","article-title":"Some new optimum golomb rulers","volume":"36","author":"Shearer","year":"1990","journal-title":"Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(99)00022-0_BIB20","series-title":"Proceedings of the 5th Conference on Combinatorics, Graph Theory, and Computing","first-page":"625","article-title":"Synch-sets: a variant of difference sets","author":"Simmons","year":"1974"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:30:24Z","timestamp":1556397024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0166218X99000220"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00022-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}