{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:13:27Z","timestamp":1791148407532,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463664.2467795","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"261-272","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["A trichotomy for regular simple path queries on graphs"],"prefix":"10.1145","author":[{"given":"Guillaume","family":"Bagan","sequence":"first","affiliation":[{"name":"Inria, Lille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angela","family":"Bonifati","sequence":"additional","affiliation":[{"name":"Lille 1 Univerity &amp; Inria, Lille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benoit","family":"Groz","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1627"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187922"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103516.103517"},{"key":"e_1_3_2_1_5_1","volume-title":"A trichotomy for regular simple path queries on graphs. CoRR, abs\/1212.6857","author":"Bagan G.","year":"2012","unstructured":"G. Bagan , A. Bonifati , and B. Groz . A trichotomy for regular simple path queries on graphs. CoRR, abs\/1212.6857 , 2012 . G. Bagan, A. Bonifati, and B. Groz. A trichotomy for regular simple path queries on graphs. CoRR, abs\/1212.6857, 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989307"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798337716"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.04.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847323"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1805"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/959060.959076"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03793-1_2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/114891.114896"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38749"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121738"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/578533"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.009"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672980"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.038"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217058"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2031"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"e_1_3_2_1_26_1","volume-title":"The even-path problem for graphs and digraphs. Networks}, 14(4):507--513","author":"Lapaugh A. S.","year":"1984","unstructured":"A. S. Lapaugh and C. H. Papadimitriou . The even-path problem for graphs and digraphs. Networks}, 14(4):507--513 , 1984 . A. S. Lapaugh and C. H. Papadimitriou. The even-path problem for graphs and digraphs. Networks}, 14(4):507--513, 1984."},{"key":"e_1_3_2_1_27_1","volume-title":"ECCB\/JBI, page 39","author":"Leser U.","year":"2005","unstructured":"U. Leser . A query language for biological networks. In ECCB\/JBI, page 39 , 2005 . U. Leser. A query language for biological networks. In ECCB\/JBI, page 39, 2005."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213573"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797330343"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1072"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1089\/153623103322006652"},{"key":"e_1_3_2_1_34_1","volume-title":"Computational complexity","author":"Papadimitriou C. H.","year":"1994","unstructured":"C. H. Papadimitriou . Computational complexity . Addison-Wesley , 1994 . C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.172"},{"key":"e_1_3_2_1_37_1","volume-title":"Space-bounded hierarchies and probabilistic computations. J. Comput. Syst. Sci.}, 28(2):216--230","author":"Ruzzo W. L.","year":"1984","unstructured":"W. L. Ruzzo , J. Simon , and M. Tompa . Space-bounded hierarchies and probabilistic computations. J. Comput. Syst. Sci.}, 28(2):216--230 , 1984 . W. L. Ruzzo, J. Simon, and M. Tompa. Space-bounded hierarchies and probabilistic computations. J. Comput. Syst. Sci.}, 28(2):216--230, 1984."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224061"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.04.012"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463664.2467795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463664.2467795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:01Z","timestamp":1750235941000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463664.2467795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":41,"alternative-id":["10.1145\/2463664.2467795","10.1145\/2463664"],"URL":"https:\/\/doi.org\/10.1145\/2463664.2467795","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}