{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:12:25Z","timestamp":1781089945172,"version":"3.54.1"},"reference-count":8,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1051\/ro\/2009009","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T12:57:54Z","timestamp":1240837074000},"page":"145-156","source":"Crossref","is-referenced-by-count":5,"title":["A polynomial algorithm for minDSC on a subclass of series Parallel graphs"],"prefix":"10.1051","volume":"43","author":[{"given":"Salim","family":"Achouri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timoth\u00e9e","family":"Bossart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alix","family":"Munier-Kordon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2009,4,28]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1016\/j.dam.2007.03.019","volume":"155","author":"Bossart","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"R2","unstructured":"T. Bossart,Optimisation de la m\u00e9moire cache pour la simulation de circuits. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie (2006)."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"P. Brucker,Scheduling Algorithms. Springer-Verlag New York, Inc., Secaucus, NJ, USA (1995).","DOI":"10.1007\/978-3-662-03088-2"},{"key":"R4","unstructured":"P. Chr\u00e9tienne and C. Picouleau, Scheduling with communication delays: a survey, inScheduling Theory and its Applications, edited by P. Chretienne, E.G. Jr Coffman, J.K. Lenstra and Z. Liu, Chap. 4. John Wiley & Sons (1995) 65\u201390."},{"key":"R5","unstructured":"L.A.M. Schoenmakers,A new algorithm for the recognition of series parallel graphs, Technical Report CS-R9504 Centrum voor Wiskunde en Informatica (1995)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"Sethi","year":"1975","journal-title":"SIAM J. Computing"},{"key":"R7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"J. Valdes, R.E. Tarjan and E.L. Lawler, The recognition of series parallel digraphs, inProceedings of the eleventh annual ACM symposium on Theory of computing.ACM Press (1979) 1\u201312.","DOI":"10.1145\/800135.804393"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2009009\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:21:45Z","timestamp":1558290105000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2009009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":8,"journal-issue":{"issue":"2"},"alternative-id":["ro0543"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2009009","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4]]}}}