{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:43:13Z","timestamp":1648579393583},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T00:00:00Z","timestamp":1412380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1482-5","type":"journal-article","created":{"date-parts":[[2014,10,3]],"date-time":"2014-10-03T08:02:33Z","timestamp":1412323353000},"page":"1437-1452","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Locally Gabriel Geometric Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Sathish","family":"Govindarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhijeet","family":"Khopkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,4]]},"reference":[{"issue":"4","key":"1482_CR1","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s00454-002-2882-5","volume":"28","author":"BM \u00c1brego","year":"2002","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S.: The unit distance problem for centrally symmetric convex polygons. Discrete Comput. Geom. 28(4), 467\u2013473 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"1482_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/(SICI)1098-2418(199610)9:3<271::AID-RSA1>3.0.CO;2-U","volume":"9","author":"N Alon","year":"1996","unstructured":"Alon, N.: Independence numbers of locally sparse graphs and a ramsey type problem. Random Struct. Algorithms 9(3), 271\u2013278 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"1482_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., et al.: Routing with guaranteed delivery in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48\u201355. ACM, New York, USA (1999)","DOI":"10.1145\/313239.313282"},{"key":"1482_CR4","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"issue":"1","key":"1482_CR5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1006\/jcta.2000.3133","volume":"94","author":"P Bra\u00df","year":"2001","unstructured":"Bra\u00df, P., Pach, J.: The maximum number of times the same distance can occur among the vertices of a convex n-gon is n log n. J. Comb. Theory, Ser. A 94(1), 178\u2013179 (2001)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"2","key":"1482_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0097-3165(91)90042-F","volume":"56","author":"H Edelsbrunner","year":"1991","unstructured":"Edelsbrunner, H., Hajnal, P.: A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory, Ser. A 56(2), 312\u2013316 (1991)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"1482_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","volume":"53","author":"P Erdos","year":"1946","unstructured":"Erdos, P.: On sets of distances of n points. Am. Math. Mon. 53, 248\u2013250 (1946)","journal-title":"Am. Math. Mon."},{"key":"1482_CR8","doi-asserted-by":"crossref","unstructured":"J. Comb. Theory Ser. A The maximum number of unit distances in a convex n-gon. 55(2), 316\u2013320 (1990)","DOI":"10.1016\/0097-3165(90)90074-7"},{"issue":"3","key":"1482_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"RK Gabriel","year":"1969","unstructured":"Gabriel, R.K., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Zool. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Zool."},{"key":"1482_CR10","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20, 350\u2013353 (1977)","journal-title":"Commun. ACM"},{"key":"1482_CR11","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J Jaromczyk","year":"1992","unstructured":"Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. P-IEEE 80, 1502\u20131517 (1992)","journal-title":"P-IEEE"},{"key":"1482_CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1142\/S0218195910003360","volume":"20","author":"S Kapoor","year":"2010","unstructured":"Kapoor, S., Li, X.-Y.: Proximity structures for geometric graphs. Int. J. Comp. Geom. Appl. 20, 415\u2013429 (2010)","journal-title":"Int. J. Comp. Geom. Appl."},{"key":"1482_CR13","unstructured":"Li, X.-Y., et al.: Distributed construction of a planar spanner and routing for ad hoc wireless networks. IEEE INFOCOM, 1268\u20131277 (2002)"},{"key":"1482_CR14","doi-asserted-by":"crossref","unstructured":"Pinchasi, R., Smorodinsky, S.: On locally delaunay geometric graphs. In: Symposium on Computational Geometry, pp. 378\u2013382 (2004)","DOI":"10.1145\/997817.997874"},{"issue":"3","key":"1482_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"LA Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard erdos problems in discrete geometry. Comb. Probab. Comput. 6(3), 353\u2013358 (1997)","journal-title":"Comb. Probab. Comput."},{"key":"1482_CR16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter, W.: Extremal problems in discrete geometry. Combinatorica 3, 381\u2013392 (1983)","journal-title":"Combinatorica"},{"key":"1482_CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.jda.2006.05.004","volume":"5","author":"J Urrutia","year":"2007","unstructured":"Urrutia, J.: Local solutions for global problems in wireless networks. Journal of Discrete Algorithms 5, 395\u2013407 (2007)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1482-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1482-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1482-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T20:03:57Z","timestamp":1565899437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1482-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,4]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1482"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1482-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,4]]}}}