{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:36Z","timestamp":1725470736813},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_5","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"16-27","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Connectivity for Axis-Parallel Rectangles"],"prefix":"10.1007","author":[{"given":"Peyman","family":"Afshani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Advances in Discrete and Computational Geometry, pp. 1\u201356. AMS Press (1999)","key":"5_CR1","DOI":"10.1090\/conm\/223\/03131"},{"doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Dynamic subgraph connectivity with geometric applications. In: Proc. 34th ACM Sympos. on Theory of Comput., pp. 7\u201313 (2002)","key":"5_CR2","DOI":"10.1145\/509907.509911"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/S0097539702404389","volume":"32","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Semi-online maintenance of geometric optima and measures. SIAM J. Comput.\u00a032, 700\u2013716 (2003)","journal-title":"SIAM J. Comput."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom.\u00a04, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput.\u00a09, 251\u2013280 (1990)","journal-title":"J. Symbolic Comput."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(81)90053-3","volume":"13","author":"H. Edelsbrunner","year":"1981","unstructured":"Edelsbrunner, H., Maurer, H.A.: On the intersection of orthogonal objects. Inform. Process. Lett.\u00a013, 177\u2013181 (1981)","journal-title":"Inform. Process. Lett."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/PL00009228","volume":"22","author":"M. Fredman","year":"1998","unstructured":"Fredman, M., Henzinger, M.: Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica\u00a022, 351\u2013362 (1998)","journal-title":"Algorithmica"},{"key":"5_CR8","first-page":"64","volume-title":"Handbook of Data Structures and Applications","author":"P. Gupta","year":"2005","unstructured":"Gupta, P., Janardan, R., Smid, M.: Computational geometry: generalized intersection searching. In: Handbook of Data Structures and Applications, pp. 64\u20131\u201364\u201317. Chapman & Hall\/CRC, Boca Raton (2005)"},{"key":"5_CR9","first-page":"76","volume":"46","author":"M.R. Henzinger","year":"2000","unstructured":"Henzinger, M.R., King, V.: Randomized dynamic graph algorithms with polylogarithmic time per operation. J. ACM\u00a046, 76\u2013103 (2000)","journal-title":"J. ACM"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM\u00a048, 723\u2013760 (2001)","journal-title":"J. ACM"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms\u00a04(4), 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"5_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M. P\u01cetra\u015fcu","year":"2006","unstructured":"P\u01cetra\u015fcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput.\u00a035(4), 932\u2013963 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jagm.1999.1033","volume":"33","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Decremental dynamic connectivity. J. Algorithms\u00a033(2), 229\u2013243 (1999)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. 32nd ACM Sympos. on Theory of Comput., pp. 343\u2013350 (2000)","key":"5_CR15","DOI":"10.1145\/335305.335345"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:55Z","timestamp":1619507815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11841036_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}