{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:55:49Z","timestamp":1725519349947},"reference-count":6,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1109\/icit.2008.36","type":"proceedings-article","created":{"date-parts":[[2009,1,14]],"date-time":"2009-01-14T13:55:54Z","timestamp":1231941354000},"page":"3-8","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Box Representation for a Graph in O(n