{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:16:02Z","timestamp":1742980562874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_26","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"341-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for\u00a0Leaf Rank of\u00a0Leaf Powers"],"prefix":"10.1007","author":[{"given":"Svein","family":"H\u00f8gemo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"26_CR1","unstructured":"Bergougnoux, B.: Personal communication (2023)"},{"key":"26_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-031-15914-5_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Bergougnoux","year":"2022","unstructured":"Bergougnoux, B., H\u00f8gemo, S., Telle, J.A., Vatshelle, M.: Recognition of linear and star variants of leaf powers is in p. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 70\u201383. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_6"},{"issue":"1","key":"26_CR3","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). https:\/\/doi.org\/10.1016\/0166-218X(93)90165-K","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"26_CR4","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":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"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 (TALG) 5(1), 1\u201322 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"4","key":"26_CR6","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). https:\/\/doi.org\/10.1016\/j.ipl.2006.01.004","journal-title":"Inf. Process. Lett."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1016\/j.tcs.2010.04.027","volume":"411","author":"A Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Rautenbach, D.: Exact leaf powers. Theoret. Comput. Sci. 411, 2968\u20132977 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.04.027","journal-title":"Theoret. Comput. Sci."},{"key":"26_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":"26_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-005-1180-z","volume":"44","author":"M Dom","year":"2006","unstructured":"Dom, M., Guo, J., Huffner, F., Niedermeier, R.: Error compensation in leaf power problems. Algorithmica 44, 363\u2013381 (2006)","journal-title":"Algorithmica"},{"key":"26_CR10","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":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"MC Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter, W.T., Jr.: Tolerance graphs. Discret. Appl. Math. 9(2), 157\u2013170 (1984)","journal-title":"Discret. Appl. Math."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs, 3rd edn. Elsevier Science (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"26_CR14","unstructured":"Jaffke, L.: Bounded width graph classes in parameterized algorithms. Ph.D. thesis, University of Bergen (2020)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Jaffke, L., Kwon, O.J., Str\u00f8mme, T.J., Telle, J.A.: Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216\u2013236 (2019)","DOI":"10.1016\/j.tcs.2019.09.012"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-319-68705-6_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Lafond","year":"2017","unstructured":"Lafond, M.: On strongly chordal graphs that are not leaf powers. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 386\u2013398. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_29"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3614094","volume":"19","author":"M Lafond","year":"2023","unstructured":"Lafond, M.: Recognizing k-leaf powers in polynomial time, for constant k. ACM Trans. Algorithms 19(4), 1\u201335 (2023). https:\/\/doi.org\/10.1145\/3614094","journal-title":"ACM Trans. Algorithms"},{"key":"26_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-319-68705-6_29","volume-title":"Fundamentals of Computation Theory","author":"VB Le","year":"2023","unstructured":"Le, V.B., Rosenke, C.: Computing optimal leaf roots of chordal cographs in linear time. In: Bodlaender, H., Woeginger, G. (eds.) FCT 2023. LNCS, pp. 348\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_29"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G-H Lin","year":"2000","unstructured":"Lin, G.-H., Kearney, P.E., Jiang, T.: Phylogenetic k-root and steiner k-root. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 539\u2013551. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_46"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2017.04.043","volume":"248","author":"S Mengel","year":"2018","unstructured":"Mengel, S.: Lower bounds on the mim-width of some graph classes. Discret. Appl. Math. 248, 28\u201332 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"26_CR21","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., Trotter, W.T., Jr.: Threshold tolerance graphs. J. Graph Theory 12(3), 343\u2013362 (1988)","journal-title":"J. Graph Theory"},{"key":"26_CR22","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 Comb. 32, 2053\u20132077 (2016)","journal-title":"Graphs Comb."},{"issue":"1","key":"26_CR23","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":"13","key":"26_CR24","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2006.03.030","volume":"306","author":"D Rautenbach","year":"2006","unstructured":"Rautenbach, D.: Some remarks about leaf roots. Discret. Math. 306(13), 1456\u20131461 (2006). https:\/\/doi.org\/10.1016\/j.disc.2006.03.030","journal-title":"Discret. Math."},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Rosenke, C., Le, V.B., Brandst\u00e4dt, A.: Leaf powers. In: Beineke, L.W., Golumbic, M.C., Wilson, R.J. (eds.) Topics in Algorithmic Graph Theory, pp. 168\u2013188. Encyclopedia of Mathematics and its Applications, Cambridge University Press (2021)","DOI":"10.1017\/9781108592376.011"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:16:15Z","timestamp":1718975775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}