{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:06:52Z","timestamp":1750162012154,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_6","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"70-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recognition of\u00a0Linear and\u00a0Star Variants of\u00a0Leaf Powers is in\u00a0P"],"prefix":"10.1007","author":[{"given":"Bergougnoux","family":"Benjamin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svein","family":"H\u00f8gemo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(93)90165-K","volume":"43","author":"E Bibelnieks","year":"1993","unstructured":"Bibelnieks, E., Dearing, P.M.: Neighborhood subtree tolerance graphs. Discret. Appl. Math. 43(1), 13\u201326 (1993)","journal-title":"Discret. Appl. Math."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-78773-0_42","volume-title":"LATIN 2008: Theoretical Informatics","author":"A Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Hundt, C.: Ptolemaic graphs and interval graphs are leaf powers. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 479\u2013491. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_42"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.disc.2009.10.006","volume":"310","author":"A Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Hundt, C., Mancini, F., Wagner, P.: Rooted directed path graphs are leaf powers. Discret. Math. 310(4), 897\u2013910 (2010)","journal-title":"Discret. Math."},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98(4), 133\u2013138 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/1435375.1435386","volume":"5","author":"A Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Le, V.B., Sritharan, R.: Structure and linear-time recognition of 4-leaf powers. ACM Trans. Algorithms 5(1), 11:1-11:22 (2008). https:\/\/doi.org\/10.1145\/1435375.1435386","journal-title":"ACM Trans. Algorithms"},{"issue":"11","key":"6_CR6","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":"3","key":"6_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":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-74839-7_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M-S Chang","year":"2007","unstructured":"Chang, M.-S., Ko, M.-T.: The 3-Steiner root problem. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 109\u2013120. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74839-7_11"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Davis, A., Gao, R., Navin, N.: Tumor evolution: Linear, branching, neutral or punctuated? Biochim. Biophys. Acta (BBA) - Rev. Cancer 1867(2), 151\u2013161 (2017). https:\/\/doi.org\/10.1016\/j.bbcan.2017.01.003, evolutionary principles - heterogeneity in cancer?","DOI":"10.1016\/j.bbcan.2017.01.003"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn, Graduate Texts in Mathematics, vol. 173. Springer, London (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11604686_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Dom","year":"2005","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Extending the tractability border for closest leaf powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 397\u2013408. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_35"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-030-30786-8_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G Ducoffe","year":"2019","unstructured":"Ducoffe, G.: The 4-Steiner root problem. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 14\u201326. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_2"},{"issue":"8","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1007\/s00453-020-00720-8","volume":"82","author":"D Eppstein","year":"2020","unstructured":"Eppstein, D., Havvaei, E.: Parameterized leaf power recognition via embedding into graph products. Algorithmica 82(8), 2337\u20132359 (2020)","journal-title":"Algorithmica"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2015.01.034","volume":"216","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., et al.: On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216, 171\u2013180 (2017)","journal-title":"Discret. Appl. Math."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.dam.2012.11.014","volume":"165","author":"MC Golumbic","year":"2014","unstructured":"Golumbic, M.C., Weingarten, N.L., Limouzy, V.: Co-TT graphs and a characterization of split co-TT graphs. Discret. Appl. Math. 165, 168\u2013174 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20132","key":"6_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Jaffke, L., Kwon, O., Str\u00f8mme, T.J.F., Telle, J.A.: Mim-width III. graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216\u2013236 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.012","DOI":"10.1016\/j.tcs.2019.09.012"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Lafond, M.: On strongly chordal graphs that are not leaf powers. In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, 21\u201323 June 2017, Revised Selected Papers, pp. 386\u2013398 (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_29","DOI":"10.1007\/978-3-319-68705-6_29"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Lafond, M.: Recognizing k-leaf powers in polynomial time, for constant k. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1384\u20131410. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.58","DOI":"10.1137\/1.9781611977073.58"},{"issue":"3","key":"6_CR20","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)","journal-title":"Threshold tolerance graphs. J. Graph Theor."},{"issue":"5","key":"6_CR21","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1007\/s00373-016-1707-x","volume":"32","author":"R Nevries","year":"2016","unstructured":"Nevries, R., Rosenke, C.: Towards a characterization of leaf powers by clique arrangements. Graphs Combin. 32(5), 2053\u20132077 (2016). https:\/\/doi.org\/10.1007\/s00373-016-1707-x","journal-title":"Graphs Combin."},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers for leaf-labeled trees. J. Algorithms 42(1), 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.isci.2020.101655","volume":"23","author":"ES Azer","year":"2020","unstructured":"Azer, E.S., Ebrahimabadi, M.H., Maliki\u0107, S., Khardon, R., Sahinalp, S.C.: Tumor phylogeny topology inference via deep learning. iScience 23(11), 101655 (2020). https:\/\/doi.org\/10.1016\/j.isci.2020.101655","journal-title":"iScience"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0604036","volume":"4","author":"A Tamir","year":"1983","unstructured":"Tamir, A.: A class of balanced matrices arising from location problems. Siam J. Algebraic Discrete Methods 4, 363\u2013370 (1983)","journal-title":"Siam J. Algebraic Discrete Methods"}],"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-031-15914-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:15:39Z","timestamp":1664536539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"33% - 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","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":"12","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)"}}]}}