{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:34:33Z","timestamp":1783578873191,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030307851","type":"print"},{"value":"9783030307868","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_2","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"14-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The 4-Steiner Root Problem"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Ducoffe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"2_CR1","unstructured":"Arumugam, S., Brandst\u00e4dt, A., Nishizeki, T., Thulasiraman, K.: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms (2016)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J Blair","year":"1993","unstructured":"Blair, J., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer, New York (1993). \n                    https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"4","key":"2_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.: Structure and linear time recognition of 3-leaf powers. Inf. Process. Letters 98(4), 133\u2013138 (2006)","journal-title":"Inf. Process. Letters"},{"issue":"31\u201333","key":"2_CR5","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., Le, V., Rautenbach, D.: Exact leaf powers. Theor. Comput. Sci. 411(31\u201333), 2968\u20132977 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR6","first-page":"11","volume":"5","author":"A Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Le, V., Sritharan, R.: Structure and linear-time recognition of 4-leaf powers. ACM Transact. Algorithms (TALG) 5(1), 11 (2008)","journal-title":"ACM Transact. Algorithms (TALG)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2009.09.008","volume":"158","author":"A Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Wagner, P.: Characterising \n                    \n                      \n                    \n                    $$(k,\\ell )$$\n                  -leaf powers. Discrete Appl. Math. 158(2), 110\u2013122 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2_CR8","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":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chang, M., Ko, M.: The 3-Steiner root problem. In: WG, pp. 109\u2013120 (2007)","DOI":"10.1007\/978-3-540-74839-7_11"},{"key":"2_CR10","unstructured":"Ducoffe, G.: Polynomial-time Recognition of \n                    \n                      \n                    \n                    $$4$$\n                  -Steiner Powers. Technical Report \n                    arXiv:1810.02304\n                    \n                  , ArXiv (2018)"},{"key":"2_CR11","unstructured":"Eppstein, D., Havvaei, E.: Parameterized leaf power recognition via embedding into graph products. In: IPEC 2018, pp. 16:1\u201316:14 (2019)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-92182-0_37","volume-title":"Algorithms and Computation","author":"Michael R. Fellows","year":"2008","unstructured":"Fellows, M., Meister, D., Rosamond, F., Sritharan, R., Telle, J.: Leaf powers and their properties: using the trees. In: ISAAC, pp. 402\u2013413 (2008)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Jiang, T., Kearney, P., Lin, G.: Phylogenetic k-root and steiner k-root. In: ISAAC, pp. 539\u2013551 (2000)","DOI":"10.1007\/3-540-40996-3_46"},{"issue":"185","key":"2_CR14","first-page":"81","volume":"70","author":"C Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math 70(185), 81 (1869)","journal-title":"J. Reine Angew. Math"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.dam.2014.09.003","volume":"181","author":"R Nevries","year":"2015","unstructured":"Nevries, R., Rosenke, C.: Characterizing and computing the structure of clique intersections in strongly chordal graphs. Discr. Appl. Math. 181, 221\u2013234 (2015)","journal-title":"Discr. Appl. Math."},{"issue":"5","key":"2_CR16","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 and Combinatorics 32(5), 2053\u20132077 (2016)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"2_CR17","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.: On graph powers for leaf-labeled trees. J. Algorithms 42(1), 69\u2013108 (2002)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:23:19Z","timestamp":1568236999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","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":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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.4","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":"1-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)"}}]}}