{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:59Z","timestamp":1760079359730,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1377676.1377693","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"94-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A (slightly) faster algorithm for klee's measure problem"],"prefix":"10.1145","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247121"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_36"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808735"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009366"},{"key":"e_1_3_2_1_5_1","first-page":"836","volume-title":"Proc. 19th ACM-SIAM Sympos. Discrete Algorithms","author":"Cabello S.","year":"2008"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009478"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702404389"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250877"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009420"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1048"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645928.672529"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234536"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-0729-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3116647.2830353"},{"key":"e_1_3_2_1_15_1","first-page":"827","volume-title":"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms","author":"Eppstein D.","year":"2001"},{"key":"e_1_3_2_1_16_1","unstructured":"J. Erickson. Klee's measure problem. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/open\/klee.html 1998.  J. Erickson. Klee's measure problem. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/open\/klee.html 1998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3046"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359553"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777803"},{"key":"e_1_3_2_1_20_1","first-page":"785","volume-title":"Proc. 18th ACM-SIAM Sympos. Discrete Algorithms","author":"Kaplan H.","year":"2007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1977.11994336"},{"key":"e_1_3_2_1_22_1","unstructured":"J. van Leeuwen and D. Wood. The measure problem for rectangular ranges in d-space. J. Algorithms  J. van Leeuwen and D. Wood. The measure problem for rectangular ranges in d-space. J. Algorithms"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293051"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90006-E"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573972"},{"key":"e_1_3_2_1_26_1","first-page":"415","article-title":"On the complexity of the subgraph problem.","volume":"26","author":"Nesetril J.","year":"1985","journal-title":"Commen. Math. Univ. Carol."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220065"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.0807"}],"event":{"name":"SoCG08: 24th Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"College Park MD USA","acronym":"SoCG08"},"container-title":["Proceedings of the twenty-fourth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1377676.1377693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:39Z","timestamp":1750254999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1377676.1377693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":28,"alternative-id":["10.1145\/1377676.1377693","10.1145\/1377676"],"URL":"https:\/\/doi.org\/10.1145\/1377676.1377693","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}