{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:59:01Z","timestamp":1774677541418,"version":"3.50.1"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1137\/s0097539798337716","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T15:12:06Z","timestamp":1055344326000},"page":"809-837","source":"Crossref","is-referenced-by-count":127,"title":["Formal-Language-Constrained Path Problems"],"prefix":"10.1137","volume":"30","author":[{"given":"Chris","family":"Barrett","sequence":"first","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1627"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/174147.169807"},{"key":"R6","unstructured":"A.Aho, D\u017e.Hopkroft, D\u017e.Ul\u2019man, Postroenie i analiz vychislitelnykh algoritmov, \u201cMir\u201d, 1979, 536\u20130, Translated by A. O. Slisenko; Edited by Ju. V. Matijasevi\u010d80g:68036"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"R10","first-page":"1","volume":"11","author":"Bodlaender H.","year":"1993","journal-title":"Acta Cybernet."},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90039-3"},{"key":"R17","volume-title":"Introduction to algorithms","author":"Manber Udi","year":"1989"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/48511.48514"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"R23","unstructured":"JohnHopcroft, JeffreyUllman, Wprowadzenie do teorii automat\u00f3w, j\u0119zyk\u00f3w i oblicze\u0144, Wydawnictwo Naukowe PWN, Warsaw, 1994, 480\u20130, Translated from the 1979 English original by Beata Konikowska99a:68001"},{"key":"R24","unstructured":"UlrichHuckenbeck, Extremal paths in graphs, Mathematical Topics, Vol. 10, Akademie Verlag, 1997, 480\u20130, Foundations, search strategies, and related topics98g:90036"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90002-3"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80038-4"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0930"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90198-6"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322272"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214078"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539798337716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T16:51:09Z","timestamp":1485708669000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/S0097539798337716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S0097539798337716"],"URL":"https:\/\/doi.org\/10.1137\/s0097539798337716","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}