{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:39Z","timestamp":1750306599308,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T00:00:00Z","timestamp":1432080000000},"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":[[2015,5,20]]},"DOI":"10.1145\/2745754.2745764","type":"proceedings-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T14:36:25Z","timestamp":1432650985000},"page":"159-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Defining Relations on Graphs"],"prefix":"10.1145","author":[{"given":"M.","family":"Praveen","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Srivathsan","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043656"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989338"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448514"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465216"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448520"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.036"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938568"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2539032.2539035"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886008.1886049"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804683"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.221"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463674"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055560"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667055"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"e_1_3_2_1_17_1","first-page":"131","volume-title":"ICDT","author":"Kostylev E.V.","year":"2014","unstructured":"E.V. Kostylev , J.L. Reutter , and D. Vrgo\\vc. Containment of data graph queries . In ICDT , pages 131 -- 142 , 2014 . E.V. Kostylev, J.L. Reutter, and D. Vrgo\\vc. Containment of data graph queries. In ICDT, pages 131--142, 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1105"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28717-6_22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.172"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00105-X"},{"key":"e_1_3_2_1_25_1","first-page":"331","volume-title":"Complexity, Logic and Recursion Theory","author":"van Emde Boas P.","year":"1997","unstructured":"P. van Emde Boas . The convenience of tilings . In Complexity, Logic and Recursion Theory , pages 331 -- 363 . Marcel Dekker Inc ., 1997 . P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion Theory, pages 331--363. Marcel Dekker Inc., 1997."}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15"},"container-title":["Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2745754.2745764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:45Z","timestamp":1750227405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745764"}},"subtitle":["How Hard is it in the Presence of Node Partitions?"],"short-title":[],"issued":{"date-parts":[[2015,5,20]]},"references-count":25,"alternative-id":["10.1145\/2745754.2745764","10.1145\/2745754"],"URL":"https:\/\/doi.org\/10.1145\/2745754.2745764","relation":{},"subject":[],"published":{"date-parts":[[2015,5,20]]},"assertion":[{"value":"2015-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}