{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:14Z","timestamp":1725550034635},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_4","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"23-35","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Detecting Regular Point Configurations"],"prefix":"10.1007","author":[{"given":"Luzi","family":"Anderegg","sequence":"first","affiliation":[]},{"given":"Mark","family":"Cieliebak","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Anderegg, L., Cieliebak, M., Prencipe, G., Widmayer, P.: When is Weber Point Invariant? (Manuscript)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C. Bajaj","year":"1988","unstructured":"Bajaj, C.: The Algebraic Degree of Geometric Optimization Problem. Discrete and Computational Geometry\u00a03, 177\u2013191 (1988)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01585739","volume":"46","author":"R. Chandrasekaran","year":"1990","unstructured":"Chandrasekaran, R., Tamir, A.: Algebraic optimization: The Fermat-Weber location problem. Mathematical Programming\u00a046, 219\u2013224 (1990)","journal-title":"Mathematical Programming"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Proceedings of ICALP 2003","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"206","DOI":"10.2307\/2688541","volume":"42","author":"E.J. Cockayne","year":"1969","unstructured":"Cockayne, E.J., Melzak, Z.A.: Euclidean constructibility in graph-minimization problems. Math. Magazine\u00a042, 206\u2013208 (1969)","journal-title":"Math. Magazine"},{"key":"4_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"4_CR7","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.E. Goodman","year":"1997","unstructured":"Goodman, J.E., O\u2019Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press LLC, Boca Raton (1997)"},{"key":"4_CR8","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1936","unstructured":"Weiszfeld, E.: Sur le Point Pour Lequel la Somme Des Distances de n Points Donn\u00e9s Est Minimum. Tohoku Mathematical\u00a043, 355\u2013386 (1936)","journal-title":"Tohoku Mathematical"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:21Z","timestamp":1619507601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11560586_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}