{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:44:20Z","timestamp":1648701860432},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s00493-008-2305-1","type":"journal-article","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T06:45:36Z","timestamp":1209365136000},"page":"83-88","source":"Crossref","is-referenced-by-count":2,"title":["Finding coherent cyclic orders in strong digraphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[]},{"given":"Takuro","family":"Matsuda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,29]]},"reference":[{"key":"2305_CR1","doi-asserted-by":"crossref","unstructured":"S. Bessy and S. Thomass\u00e9: Three min-max theorems concerning cyclic orders of strong digraphs, in Integer Programming and Combinatorial Optimization, D. Bienstock and G. Nemhauser, eds., LNCS 3064, Springer-Verlag, 2004, pp. 132\u2013138.","DOI":"10.1007\/978-3-540-25960-2_10"},{"key":"2305_CR2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0095-8956(74)90093-8","volume":"16","author":"D. E. Knuth","year":"1974","unstructured":"D. E. Knuth: Wheels within wheels, J. Combinatorial Theory, Ser. B 16 (1974), 42\u201346.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"2305_CR3","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J. B. Orlin","year":"1993","unstructured":"J. B. Orlin: A faster strongly polynomial minimum cost flow algorithm, Oper. Res. 41 (1993), 338\u2013350.","journal-title":"Oper. Res."},{"key":"2305_CR4","unstructured":"A. Schrijver: Combinatorial Optimization \u2014 Polyhedra and Efficiency, Springer-Verlag, 2003."},{"issue":"4","key":"2305_CR5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.jctb.2006.09.005","volume":"97","author":"A. Seb\u0151","year":"2007","unstructured":"A. Seb\u0151: Minmax relations for cyclically ordered digraphs, J. Combinatorial Theory, Ser. B 97(4) (2007), 518\u2013552.","journal-title":"J. Combinatorial Theory, Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2305-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2305-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2305-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2305-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["2305"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2305-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}