{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T15:10:02Z","timestamp":1749827402134,"version":"3.41.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/uemcon.2016.7777894","type":"proceedings-article","created":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T01:35:39Z","timestamp":1481592939000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract)"],"prefix":"10.1109","author":[{"given":"Phillip G.","family":"Bradford","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Choppella","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.67"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328460"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80024-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2687357.2687366"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/100816481"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.3233\/FUN-2008-892-304","article-title":"Preferential regular path queries","volume":"89","author":"grahne","year":"2008","journal-title":"Fundam Inform"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940892"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505242"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1201"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","author":"greenlaw","year":"1995","journal-title":"Limits to Parallel Computation P-Completeness Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2009011"},{"journal-title":"Coppersmith-Winograd_algorithm","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798337716"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.10.013"},{"key":"ref9","first-page":"22","article-title":"Quickest path distances on context-free labeled graphs","author":"bradford","year":"2007","journal-title":"6th WSEAS Int Conf on Info Security and Privacy (ISP '07)"}],"event":{"name":"2016 IEEE 7th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","start":{"date-parts":[[2016,10,20]]},"location":"New York City, NY, USA","end":{"date-parts":[[2016,10,22]]}},"container-title":["2016 IEEE 7th Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7763653\/7777798\/07777894.pdf?arnumber=7777894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:31:03Z","timestamp":1749825063000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7777894\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/uemcon.2016.7777894","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}