{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:11Z","timestamp":1742912231800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_45","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"554-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Directed Intersection Representation of DAGs"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Caucchiolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1652-0599","authenticated-orcid":false,"given":"Ferdinando","family":"Cicalese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"3","key":"45_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(82)90147-9","volume":"39","author":"LW Beineke","year":"1982","unstructured":"Beineke, L.W., Zamfirescu, C.: Connection digraphs and second-order line digraphs. Discret. Math. 39(3), 237\u2013254 (1982)","journal-title":"Discret. Math."},{"issue":"2","key":"45_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190130206","volume":"13","author":"S Das","year":"1989","unstructured":"Das, S., Sen, M.K., Roy, A.B., West, D.B.: Interval digraphs: an analogue of interval graphs. J. Graph Theor. 13(2), 189\u2013202 (1989)","journal-title":"J. Graph Theor."},{"issue":"5","key":"45_CR3","doi-asserted-by":"publisher","first-page":"3219","DOI":"10.1109\/TNET.2017.2728638","volume":"25","author":"H Dau","year":"2017","unstructured":"Dau, H., Milenkovic, O.: Latent network features and overlapping community discovery via Boolean intersection representations. IEEE\/ACM Trans. Netw. 25(5), 3219\u20133234 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Can. J. Math. 18, 106\u2013112 (1966)","journal-title":"Can. J. Math."},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithm. 13 (2008)","DOI":"10.1145\/1412228.1412236"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Liu, X., Machado, R., Milenkovic, O.: Directed intersection representations and the information content of digraphs. In: IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7\u201312 July 2019, pp. 1477\u20131481. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849253"},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"LT Kou","year":"1978","unstructured":"Kou, L.T., Stockmeyer, L.J., Wong, C.K.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM 21(2), 135\u2013139 (1978)","journal-title":"Commun. ACM"},{"issue":"5","key":"45_CR8","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"45_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1002\/jgt.3190080312","volume":"8","author":"H Maehara","year":"1984","unstructured":"Maehara, H.: A digraph represented by a family of boxes or spheres. J. Graph Theor. 8(3), 431\u2013439 (1984)","journal-title":"J. Graph Theor."},{"issue":"5","key":"45_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationes Math. (Proc.) 80(5), 406\u2013424 (1977)","journal-title":"Indagationes Math. (Proc.)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: Provably fast inference of latent features from networks: with applications to learning social circles and multilabel classification. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1111\u20131121 (2015)","DOI":"10.1145\/2736277.2741128"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:43:08Z","timestamp":1619242988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}