{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:51:13Z","timestamp":1748321473318},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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":6499,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0167-6423(95)00005-d","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:12:04Z","timestamp":1036080724000},"page":"63-77","source":"Crossref","is-referenced-by-count":1,"title":["Systematic design of an algorithm for biconnected components"],"prefix":"10.1016","volume":"25","author":[{"given":"K.","family":"Madhukar","sequence":"first","affiliation":[]},{"given":"D.Pavan","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"R.","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(95)00005-D_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1984"},{"key":"10.1016\/0167-6423(95)00005-D_BIB2","series-title":"Program Derivation","author":"Dromey","year":"1989"},{"key":"10.1016\/0167-6423(95)00005-D_BIB3","article-title":"The Hopcroft Tarjan Planarity Algorithm \u2014 Presentations and Improvements","author":"Gries","year":"1988","journal-title":"Cornell University, Tech. Report, 88-906"},{"key":"10.1016\/0167-6423(95)00005-D_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239500005D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239500005D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:54:48Z","timestamp":1555458888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239500005D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["016764239500005D"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(95)00005-d","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}