{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:30Z","timestamp":1725879690948},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_8","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"83-95","source":"Crossref","is-referenced-by-count":2,"title":["Querying Relational Event Graphs Using Colored Range Searching Data Structures"],"prefix":"10.1007","author":[{"given":"Farah","family":"Chanchary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bannister, M.J., DuBois, C., Eppstein, D., Smyth, P.: Windows into relational events: data structures for contiguous subsequences of edges. In: Proceedings of the 24th ACM-SIAM SODA, pp. 856\u2013864. SIAM (2013)","DOI":"10.1137\/1.9781611973105.61"},{"issue":"3","key":"8_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jocs.2011.05.009","volume":"2","author":"M Berlingerio","year":"2011","unstructured":"Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: The pursuit of hubbiness: analysis of hubs in large multidimensional networks. J. Comput. Sci. 2(3), 223\u2013237 (2011)","journal-title":"J. Comput. Sci."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.physa.2005.08.083","volume":"364","author":"LM Bettencourt","year":"2006","unstructured":"Bettencourt, L.M., Cintr\u00f3n-Arias, A., Kaiser, D.I., Castillo-Ch\u00e1vez, C.: The power of a good idea: quantitative modeling of the spread of ideas from epidemiological models. Phys. A: Stat. Mech. Appl. 364, 513\u2013536 (2006)","journal-title":"Phys. A: Stat. Mech. Appl."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-60084-1_97","volume-title":"Automata, Languages and Programming","author":"P Bozanis","year":"1995","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New upper bounds for generalized intersection searching problems. In: F\u00fcl\u00f6p, Z., G\u00e9cseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 464\u2013474. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60084-1_97"},{"issue":"3","key":"8_CR5","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1086\/521848","volume":"113","author":"D Centola","year":"2007","unstructured":"Centola, D., Macy, M.: Complex contagions and the weakness of long ties. Am. J. Sociol. 113(3), 702\u2013734 (2007)","journal-title":"Am. J. Sociol."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-30139-6_16","volume-title":"WALCOM: Algorithms and Computation","author":"F Chanchary","year":"2016","unstructured":"Chanchary, F., Maheshwari, A.: Counting subgraphs in relational event graphs. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 194\u2013206. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30139-6_16"},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"M Berg De","year":"2000","unstructured":"De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational Geometry. Springer, Heidelberg (2000)"},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2015.02.015","volume":"584","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Hell, P., Peters, J.G., Vaccaro, U.: Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584, 53\u201366 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR11","unstructured":"Gupta, P., Janardan, R., Rahul, S., Smid, M.: Computational geometry: generalized (or colored) intersection searching. In: Handbook of Data Structures and Applications, 2nd edn. (in press)"},{"issue":"2","key":"8_CR12","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms 19(2), 282\u2013317 (1995)","journal-title":"J. Algorithms"},{"key":"8_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"issue":"01","key":"8_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. Int. J. Comput. Geom. Appl. 3(01), 39\u201369 (1993)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"8_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"EM McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257\u2013276 (1985)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR16","doi-asserted-by":"crossref","first-page":"8","DOI":"10.3390\/a9010008","volume":"9","author":"N Meghanathan","year":"2016","unstructured":"Meghanathan, N.: A greedy algorithm for neighborhood overlap-based community detection. Algorithms 9(1), 8 (2016)","journal-title":"Algorithms"},{"key":"8_CR17","unstructured":"Santoro, N., Quattrociocchi, W., Flocchini, P., Casteigts, A., Amblard, F.: Time-varying graphs and social network analysis: temporal indicators and metrics. In: 3rd AISB SNAMAS, pp. 32\u201338 (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:38:38Z","timestamp":1568770718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}