{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:17:12Z","timestamp":1648808232565},"reference-count":0,"publisher":"Lavoisier","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Techniques et sciences informatiques"],"published-print":{"date-parts":[[2011,12,28]]},"DOI":"10.3166\/tsi.30.1191-1216","type":"journal-article","created":{"date-parts":[[2012,2,13]],"date-time":"2012-02-13T04:34:12Z","timestamp":1329107652000},"page":"1191-1216","source":"Crossref","is-referenced-by-count":0,"title":["Un algorithme autostabilisant pour le probl\u00e8me du K-partitionnement sur graphe pond\u00e9r\u00e9"],"prefix":"10.3166","volume":"30","author":[{"given":"Eddy","family":"Caron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajoy K","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Depardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence L","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1762","container-title":["Techniques et sciences informatiques"],"original-title":[],"deposited":{"date-parts":[[2012,2,13]],"date-time":"2012-02-13T04:35:26Z","timestamp":1329107726000},"score":1,"resource":{"primary":{"URL":"http:\/\/tsi.revuesonline.com\/article.jsp?articleId=16999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,28]]},"references-count":0,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2011,12,28]]}},"URL":"https:\/\/doi.org\/10.3166\/tsi.30.1191-1216","relation":{},"ISSN":["0752-4072"],"issn-type":[{"value":"0752-4072","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12,28]]}}}