{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:49:38Z","timestamp":1743018578855,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_30","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"372-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Enumeration of Minimal Non-pairwise Compatibility Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7941-3419","authenticated-orcid":false,"given":"Naveed Ahmed","family":"Azam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9224-6929","authenticated-orcid":false,"given":"Aleksandar","family":"Shurbevski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"30_CR1","unstructured":"Azam, N.A., Ito, M., Shurbevski, A., Nagamochi, H.: Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming. In: 2nd International Workshop on Enumeration Problems and Applications (WEPA), paper 6c (2018)"},{"key":"30_CR2","unstructured":"Azam, N.A., Shurbevski, A., Nagamochi, H.: A method for enumerating all pairwise compatibility graphs with a given number of vertices. Discrete Appl. Math. (To appear)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2019.05.017","volume":"791","author":"P Baiocchi","year":"2019","unstructured":"Baiocchi, P., Calamoneri, T., Monti, A., Petreschi, R.: Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791, 62\u201375 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.05.017","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1093\/comjnl\/bxt068","volume":"57","author":"T Calamoneri","year":"2014","unstructured":"Calamoneri, T., Frangioni, A., Sinaimeri, B.: Pairwise compatibility graphs of caterpillars. Comput. J. 57(11), 1616\u20131623 (2014)","journal-title":"Comput. J."},{"issue":"7","key":"30_CR5","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1093\/comjnl\/bxs087","volume":"56","author":"T Calamoneri","year":"2013","unstructured":"Calamoneri, T., Frascaria, D., Sinaimeri, B.: All graphs with at most seven vertices are pairwise compatibility graphs. Comput. J. 56(7), 882\u2013886 (2013)","journal-title":"Comput. J."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2012.11.015","volume":"468","author":"T Calamoneri","year":"2013","unstructured":"Calamoneri, T., Montefusco, E., Petreschi, R., Sinaimeri, B.: Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468, 23\u201336 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/140978053","volume":"58","author":"T Calamoneri","year":"2016","unstructured":"Calamoneri, T., Sinaimeri, B.: Pairwise compatibility graphs: a survey. SIAM Rev. 58(3), 445\u2013460 (2016)","journal-title":"SIAM Rev."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2015.01.011","volume":"571","author":"S Durocher","year":"2015","unstructured":"Durocher, S., Mondal, D., Rahman, M.S.: On graphs that are not PCGs. Theor. Comput. Sci. 571, 78\u201387 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR9","volume-title":"The Theory of Linear Economic Models","author":"D Gale","year":"1989","unstructured":"Gale, D.: The Theory of Linear Economic Models. University of Chicago Press, Chicago (1989)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-39763-2_14","volume-title":"Algorithms in Bioinformatics","author":"P Kearney","year":"2003","unstructured":"Kearney, P., Munro, J.I., Phillips, D.: Efficient generation of uniform samples from phylogenetic trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS, vol. 2812, pp. 177\u2013189. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39763-2_14"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symbolic Comput."},{"key":"30_CR12","unstructured":"http:\/\/users.cecs.anu.edu.au\/~bdm\/data\/graphs.html. Accessed June 2019"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"105875","DOI":"10.1016\/j.ipl.2019.105875","volume":"153","author":"M Xiao","year":"2020","unstructured":"Xiao, M., Nagamochi, H.: Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153, 105875 (2020). https:\/\/doi.org\/10.1016\/j.ipl.2019.105875","journal-title":"Inf. Process. Lett."},{"issue":"04","key":"30_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1142\/S1793830910000917","volume":"2","author":"MN Yanhaona","year":"2010","unstructured":"Yanhaona, M.N., Bayzid, M.S., Rahman, M.S.: Discovering pairwise compatibility graphs. Discrete Math. Algorithms Appl. 2(04), 607\u2013623 (2010)","journal-title":"Discrete Math. Algorithms Appl."}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:44:25Z","timestamp":1619207065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_30","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)"}}]}}