{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:02:51Z","timestamp":1760061771001},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,16]],"date-time":"2008-07-16T00:00:00Z","timestamp":1216166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10707-008-0053-4","type":"journal-article","created":{"date-parts":[[2008,7,15]],"date-time":"2008-07-15T11:38:41Z","timestamp":1216121921000},"page":"453-481","source":"Crossref","is-referenced-by-count":7,"title":["A meeting scheduling problem respecting time and space"],"prefix":"10.1007","volume":"13","author":[{"given":"Florian","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Nussbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiehua","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,16]]},"reference":[{"key":"53_CR1","unstructured":"Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma L, Palop B, Sacristan V (2001) The farthest color Voronoi diagram and related problems. In: Proceedings of 17th European workshop comput. geom., Berlin, 26\u201328 March 2001, pp 113\u2013116"},{"key":"53_CR2","first-page":"862","volume-title":"Proc. 18th national conference on artificial intelligence","author":"JL Ambite","year":"2002","unstructured":"Ambite JL, Barish G, Knoblock CA, Muslea M, Oh J (2002) Getting from here to there: interactive planning and agent execution for optimized travel. In: Proc. 18th national conference on artificial intelligence. AAAI, MIT, Cambridge, pp 862\u2013869"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/B978-044482537-7\/50006-1","volume-title":"Handbook of computational geometry","author":"F Aurenhammer","year":"2000","unstructured":"Aurenhammer F, Klein R (2000) Voronoi-Diagrams. In: Sack J-R, Urrutia J (eds) Handbook of computational geometry. Elsevier Science, North-Holland, Amsterdam, pp 201\u2013290"},{"issue":"6","key":"53_CR4","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/j.engappai.2006.10.004","volume":"20","author":"A BenHassine","year":"2007","unstructured":"BenHassine A, Ho T (2007) An agent-based approach to solve dynamic meeting scheduling problems with preferences. Eng Appl Artif Intell 20(6):857\u2013873","journal-title":"Eng Appl Artif Intell"},{"key":"53_CR5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C28","author":"JL Bentley","year":"1979","unstructured":"Bentley JL, Ottmann T (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput C28:643\u2013647","journal-title":"IEEE Trans Comput"},{"key":"53_CR6","first-page":"281","volume-title":"Proc. 4th ACM-SIAM sympos. discrete algorithms","author":"B Chazelle","year":"1993","unstructured":"Chazelle B, Matou\u0161ek J (1993) On linear-time deterministic algorithms for optimization problems in fixed dimension. In: Proc. 4th ACM-SIAM sympos. discrete algorithms. ACM, SIAM, New York, pp 281\u2013290"},{"issue":"7\u20138","key":"53_CR7","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.engappai.2003.09.009","volume":"16","author":"A Chun","year":"2003","unstructured":"Chun A, Wai H, Wong RYM (2003) Optimizing agent-based meeting scheduling through preference estimation. Eng Appl Artif Intell 16(7\u20138):727\u2013743","journal-title":"Eng Appl Artif Intell"},{"issue":"5","key":"53_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.isprsjprs.2007.05.014","volume":"62","author":"E Gervais","year":"2007","unstructured":"Gervais E, Liu H, Nussbaum D, Roh Y-S, Sack J-R, Yi J (2007) Intelligent map agents\u2014a ubiquitous personalized GIS. ISPRS J Photogramm Remote Sens 62(5):347\u2013365 (special issue on Distributed Geoinformatics)","journal-title":"ISPRS J Photogramm Remote Sens"},{"issue":"1\u20132","key":"53_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1015812206586","volume":"36","author":"K Hornsby","year":"2002","unstructured":"Hornsby K, Egenhofer M (2002) Modeling moving objects over multiple granularities. Ann Math Artif Intell 36(1\u20132):177\u2013194","journal-title":"Ann Math Artif Intell"},{"issue":"3","key":"53_CR10","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1093\/ietisy\/e90-d.3.656","volume":"90-D","author":"MN Huda","year":"2007","unstructured":"Huda MN, Kamioka E, Yamada S (2007) An efficient and privacy-aware meeting scheduling scheme using common computational space. IEICE Trans 90-D(3):656\u2013667","journal-title":"IEICE Trans"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.comgeo.2003.07.003","volume":"27","author":"F Hurtado","year":"2004","unstructured":"Hurtado F, Klein R, Langetepe E, Sacrist\u00e1n V (2004) The weighted furthest color Voronoi diagram on trees and graphs. Comput Geom Theory Appl 27:13\u201326","journal-title":"Comput Geom Theory Appl"},{"key":"53_CR12","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1049\/el:19950245","volume":"31","author":"NR Jennings","year":"1995","unstructured":"Jennings NR, Jackson AJ (1995) Agent-based meeting scheduling: a design and implementation. IEEE Electron Lett 31:350\u2013352","journal-title":"IEEE Electron Lett"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Klein R, Yi J, Nussbaum D, Sack J-R (2006) How to fit in another meeting. IEEE 2nd international conference on collaborative computing (CollaborateCom 2006), Atlanta, November 2006. http:\/\/ieeexplore.ieee.org .","DOI":"10.1109\/COLCOM.2006.361843"},{"key":"53_CR14","unstructured":"Klein R, Yi J, Nussbaum D, Sack J-R (2008) A meeting scheduling problem respecting time and space. In: 4th international conference on algorithmic aspects in information and management, Shanghai, June 2008"},{"key":"53_CR15","first-page":"312","volume-title":"Symposium on computational geometry","author":"J Matou\u0161ek","year":"1994","unstructured":"Matou\u0161ek J (1994) On geometric optimization with few violated constraints. In: Symposium on computational geometry. ACM, New York, pp 312\u2013321"},{"key":"53_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.8.4.498","volume":"8","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) The weighted Euclidean 1-center problem. Math Oper Res 8:498\u2013504","journal-title":"Math Oper Res"},{"issue":"6","key":"53_CR17","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1142\/S0218195901000663","volume":"11","author":"K Mehlhorn","year":"2001","unstructured":"Mehlhorn K, Meiser S, Rasch R (2001) Furthest site abstract Voronoi diagrams. Int J Comput Geom Appl 11(6):583\u2013616","journal-title":"Int J Comput Geom Appl"},{"key":"53_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01464231","volume":"83","author":"J Radon","year":"1921","unstructured":"Radon J (1921) Mengen konvexer K\u00f6rper, die einen gemeinsamen Punkt enthalten. Math Ann 83:113\u2013115","journal-title":"Math Ann"},{"key":"53_CR19","first-page":"57","volume-title":"Algorithms and data structures, workshop WADS\u201989, Lecture notes in computer science, vol. 382","author":"D Rappaport","year":"1989","unstructured":"Rappaport D (1989) Computing the furthest site Voronoi diagram for a set of disks. In: Algorithms and data structures, workshop WADS\u201989, Lecture notes in computer science, vol. 382. Springer, Heidelberg, pp 57\u201366"},{"key":"53_CR20","doi-asserted-by":"crossref","unstructured":"Rasmussen RV, Trick MA (2006) The timetable constrained distance minimization problem. In: Lecture notes in computer science, vol. 3990. CPAIOR, Cork, 31 May\u20142 June 2006, pp 167\u2013181","DOI":"10.1007\/11757375_15"},{"key":"53_CR21","first-page":"280","volume-title":"PATAT, Brno, Czech Republic, Aug. 30\u2013Sept. 1, Lecture notes in computer science, vol. 3867","author":"F Rinaldi","year":"2006","unstructured":"Rinaldi F, Serafini P (2006) Scheduling school meetings. In: PATAT, Brno, Czech Republic, Aug. 30\u2013Sept. 1, Lecture notes in computer science, vol. 3867. Springer, Heideberg, pp 280\u2013293"},{"key":"53_CR22","unstructured":"Santos P, Vaughn H (2007) Where shall we meet? Proposing optimal locations for meetings. Presented at MapISNet\u201907, Rio de Janeiro, 10 September 2007"},{"issue":"4","key":"53_CR23","first-page":"41","volume":"12","author":"S Sen","year":"1997","unstructured":"Sen S (1997) Developing an automated distributed meeting scheduler. IEEE Expert Intell Syst Their Appl 12(4):41\u201345","journal-title":"IEEE Expert Intell Syst Their Appl"},{"issue":"2","key":"53_CR24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jcss.2007.04.019","volume":"74","author":"E Shakshuki","year":"2008","unstructured":"Shakshuki E, Koo H-H, Benoit D, Silver D (2008) A distributed multi-agent meeting scheduler. J Comput Syst Sci 74(2):279\u2013296","journal-title":"J Comput Syst Sci"},{"key":"53_CR25","first-page":"569","volume-title":"Proc. 1992 symposium on theoretical aspects of computer science. Lecture notes in computer science, vol. 577","author":"M Sharir","year":"1992","unstructured":"Sharir M, Welzl E (1992) A combinatorial bound for linear programming and related problems. In: Proc. 1992 symposium on theoretical aspects of computer science. Lecture notes in computer science, vol. 577. Springer, Heidelberg, pp 569\u2013579"},{"key":"53_CR26","first-page":"580","volume-title":"APPT, Guangzhou, China, November 22\u201323, Lecture notes in computer science, vol. 4847","author":"J Wang","year":"2007","unstructured":"Wang J, Niu C, Shen R (2007) Scheduling meetings in distance learning. In: APPT, Guangzhou, China, November 22\u201323, Lecture notes in computer science, vol. 4847. Springer, Heidelberg, pp 580\u2013589"},{"key":"53_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New results and new trends in computer science. Lecture notes in computer science, vol. 555","author":"E Welzl","year":"1991","unstructured":"Welzl E (1991) Smallest enclosing disks (balls and ellipsoids). In: Maurer H (ed) New results and new trends in computer science. Lecture notes in computer science, vol. 555. Springer, Heidelberg, pp 359\u2013370"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-008-0053-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-008-0053-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-008-0053-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:16:58Z","timestamp":1559240218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-008-0053-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,16]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s10707-008-0053-4","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,16]]}}}