{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T11:40:04Z","timestamp":1724154004465},"reference-count":0,"publisher":"Journal of Graph Algorithms and Applications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JGAA","J. Graph Algorithms Appl."],"DOI":"10.7155\/jgaa.00231","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T08:24:53Z","timestamp":1342686293000},"page":"373-415","source":"Crossref","is-referenced-by-count":5,"title":["Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs"],"prefix":"10.7155","volume":"15","author":[{"given":"Tamara","family":"Mchedlidze","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"4175","published-online":{"date-parts":[[2011]]},"container-title":["Journal of Graph Algorithms and Applications"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T10:30:35Z","timestamp":1724149835000},"score":1,"resource":{"primary":{"URL":"https:\/\/jgaa.info\/index.php\/jgaa\/article\/view\/paper231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.7155\/jgaa.00231","relation":{},"ISSN":["1526-1719"],"issn-type":[{"type":"electronic","value":"1526-1719"}],"subject":[],"published":{"date-parts":[[2011]]}}}