{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:54:35Z","timestamp":1730213675266,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000964","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["18H05291"],"id":[{"id":"10.13039\/100000964","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000964","name":"Korea government (MSIT)","doi-asserted-by":"publisher","award":["NRF-2020R1 G1A1101477"],"id":[{"id":"10.13039\/100000964","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/dcc50243.2021.00020","type":"proceedings-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T01:18:17Z","timestamp":1620695897000},"page":"123-132","source":"Crossref","is-referenced-by-count":1,"title":["Succinct representations of Intersection Graphs on a Circle"],"prefix":"10.1109","author":[{"given":"Huseyin","family":"Acan","sequence":"first","affiliation":[{"name":"Drexel University,United States"}]},{"given":"Sankardeep","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"National Institute of Informatics,japan"}]},{"given":"Seungbum","family":"Jo","sequence":"additional","affiliation":[{"name":"Chungbuk National University,South Korea"}]},{"given":"Kei","family":"Nakashima","sequence":"additional","affiliation":[{"name":"The University of Tokyo,japan"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[{"name":"The University of Tokyo,Japan"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[{"name":"NTNU,Norway"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00013-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.016"},{"key":"ref16","first-page":"67:1","article-title":"Succinct data structures for chordal graphs","author":"munro","year":"2018","journal-title":"ISAAC"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9712-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24766-9_1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90039-1"},{"key":"ref3","first-page":"1607","article-title":"Über eine art von graphen","volume":"11","author":"haj\u00f3s","year":"1957","journal-title":"Int Math Nachr"},{"key":"ref6","article-title":"Characterizing and recognizing circle graphs","author":"bouchet","year":"1986","journal-title":"Graph theory Proc 6th Yugosl Semin"},{"journal-title":"Algorithmic Graph Theory and Perfect Graphs","year":"2004","author":"golumbic","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70618-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"journal-title":"Efficient graph representations vol 19 of Fields Institute monographs American Mathematical Society","year":"2003","author":"spinrad","key":"ref2"},{"key":"ref1","article-title":"Suc-cinct navigational oracles for families of intersection graphs on a circle","volume":"abs 2010 4333","author":"acan","year":"2020","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2019.02.001"},{"key":"ref20","first-page":"59","article-title":"Two results on intersection graphs of polygons","author":"kratochvil","year":"2003","journal-title":"GD"},{"key":"ref22","first-page":"13:1","article-title":"A framework for in-place graph algorithms","volume":"112","author":"chakraborty","year":"2018","journal-title":"26th ESA"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0270-1"},{"key":"ref23","article-title":"Improved space-efficient linear time algorithms for some classical graph problems","volume":"abs 1712 3349","author":"chakraborty","year":"2017","journal-title":"CoRR"}],"event":{"name":"2021 Data Compression Conference (DCC)","start":{"date-parts":[[2021,3,23]]},"location":"Snowbird, UT, USA","end":{"date-parts":[[2021,3,26]]}},"container-title":["2021 Data Compression Conference (DCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9418628\/9418635\/09418681.pdf?arnumber=9418681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:22:00Z","timestamp":1659486120000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9418681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/dcc50243.2021.00020","relation":{},"subject":[],"published":{"date-parts":[[2021,3]]}}}