{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:46:05Z","timestamp":1743061565440,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-60440-0_23","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"286-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear-Time Recognition of\u00a0Double-Threshold Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9478-7307","authenticated-orcid":false,"given":"Yusuke","family":"Kobayashi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9826-7074","authenticated-orcid":false,"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Barrus, M.D.: Weakly threshold graphs. Discret. Math. Theor. Comput. Sci. 20(1), 22 p. (2018). https:\/\/doi.org\/10.23638\/DMTCS-20-1-15","DOI":"10.23638\/DMTCS-20-1-15"},{"issue":"8","key":"23_CR2","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1016\/j.disc.2018.04.023","volume":"341","author":"R Behr","year":"2018","unstructured":"Behr, R., Sivaraman, V., Zaslavsky, T.: Mock threshold graphs. Discret. Math. 341(8), 2159\u20132178 (2018). https:\/\/doi.org\/10.1016\/j.disc.2018.04.023","journal-title":"Discret. Math."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/jgt.3190090207","volume":"9","author":"C Benzaken","year":"1985","unstructured":"Benzaken, C., Hammer, P.L., de Werra, D.: Threshold characterization of graphs with Dilworth number two. J. Graph Theor. 9(2), 245\u2013267 (1985). https:\/\/doi.org\/10.1002\/jgt.3190090207","journal-title":"J. Graph Theor."},{"issue":"3","key":"23_CR4","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). https:\/\/doi.org\/10.1137\/140978053","journal-title":"SIAM Rev."},{"key":"23_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. North Holland, Amsterdam (2004)","edition":"2"},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Hamburger, P., McConnell, R.M., P\u00f3r, A., Spinrad, J.P., Xu, Z.: Double threshold digraphs. In: MFCS 2018. LIPIcs, vol. 117, pp. 69:1\u201369:12 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.69","DOI":"10.4230\/LIPIcs.MFCS.2018.69"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1137\/0606049","volume":"6","author":"PL Hammer","year":"1985","unstructured":"Hammer, P.L., Mahadev, N.V.R.: Bithreshold graphs. SIAM J. Algebraic Discret. Meth. 6(3), 497\u2013506 (1985). https:\/\/doi.org\/10.1137\/0606049","journal-title":"SIAM J. Algebraic Discret. Meth."},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Heggernes, P., van \u2019t Hof, P., Meister, D., Villanger, Y.: Induced subgraph isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562, 252\u2013269 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.10.002","DOI":"10.1016\/j.tcs.2014.10.002"},{"key":"23_CR9","unstructured":"Jamison, R.E., Sprague, A.P.: Bi-threshold permutation graphs (2019, in press)"},{"key":"23_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":"23_CR11","unstructured":"Ma, T.-H.: On the threshold dimension 2 graphs. Technical report, Institute of Information Science, Nankang, Taipei, Taiwan (1993)"},{"key":"23_CR12","volume-title":"Threshold Graphs and Related Topics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, 1st edn. North Holland, Amsterdam (1995)","edition":"1"},{"issue":"1\u20133","key":"23_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discret. Math. 201(1\u20133), 189\u2013241 (1999). https:\/\/doi.org\/10.1016\/S0012-365X(98)00319-7","journal-title":"Discret. Math."},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/jgt.3190120307","volume":"12","author":"CL Monma","year":"1988","unstructured":"Monma, C.L., Reed, B.A., Trotter, W.T.: Threshold tolerance graphs. J. Graph Theor. 12(3), 343\u2013362 (1988). https:\/\/doi.org\/10.1002\/jgt.3190120307","journal-title":"J. Graph Theor."},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Raschle, T., Simon, K.: Recognition of graphs with threshold dimension two. In: STOC 1995, pp. 650\u2013661. ACM (1995). https:\/\/doi.org\/10.1145\/225058.225283","DOI":"10.1145\/225058.225283"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.dam.2018.05.008","volume":"250","author":"V Ravanmehr","year":"2018","unstructured":"Ravanmehr, V., Puleo, G.J., Bolouki, S., Milenkovic, O.: Paired threshold graphs. Discret. Appl. Math. 250, 291\u2013308 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.05.008","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"23_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0020-0190(98)00112-4","volume":"67","author":"A Sterbini","year":"1998","unstructured":"Sterbini, A., Raschle, T.: An $$O(n^3)$$ time algorithm for recognizing threshold dimension 2 graphs. Inf. Process. Lett. 67(5), 255\u2013259 (1998). https:\/\/doi.org\/10.1016\/S0020-0190(98)00112-4","journal-title":"Inf. Process. Lett."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-020-00712-8","volume":"82","author":"M Xiao","year":"2020","unstructured":"Xiao, M., Nagamochi, H.: Characterizing Star-PCGs. Algorithmica 82, 1\u201325 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00712-8","journal-title":"Algorithmica"},{"issue":"3","key":"23_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","volume":"69","author":"J Yan","year":"1996","unstructured":"Yan, J., Chen, J., Chang, G.J.: Quasi-threshold graphs. Discret. Appl. Math. 69(3), 247\u2013255 (1996). https:\/\/doi.org\/10.1016\/0166-218X(96)00094-7","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:02:19Z","timestamp":1710266539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_23","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":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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":"3.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":"2.1","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":"Yes","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)"}}]}}