{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:27:26Z","timestamp":1648747646208},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(01)00075-5","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"353-380","source":"Crossref","is-referenced-by-count":7,"title":["A shifting algorithm for continuous tree partitioning"],"prefix":"10.1016","volume":"282","author":[{"given":"Ronald","family":"Becker","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Simeone","sequence":"additional","affiliation":[]},{"given":"Yen-I","family":"Chiang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00075-5_BIB1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/322290.322294","article-title":"A shifting algorithm for min\u2013max tree partitioning","volume":"29","author":"Becker","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00075-5_BIB2","first-page":"26","article-title":"Structural rigidity","volume":"1","author":"Crapo","year":"1979","journal-title":"Struct. Topol."},{"key":"10.1016\/S0304-3975(01)00075-5_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230200305","article-title":"Fair dissections of spiders, worms and caterpillars","volume":"20","author":"De Simone","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(01)00075-5_BIB4","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0304-3975(01)00075-5_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","article-title":"Most uniform path partitioning and its use in image processing","volume":"42","author":"Lucertini","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00075-5_BIB6","series-title":"Discrete Location Theory","author":"Mirchandani","year":"1990"},{"key":"10.1016\/S0304-3975(01)00075-5_BIB7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/322234.322236","article-title":"Max\u2013min tree partitioning","volume":"28","author":"Perl","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00075-5_BIB8","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0166-218X(85)90041-1","article-title":"Efficient implementation of a shifting algorithm","volume":"12","author":"Perl","year":"1985","journal-title":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000755?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000755?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T10:52:44Z","timestamp":1554720764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397501000755"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00075-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}