{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:53:40Z","timestamp":1742979220842,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"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-61792-9_10","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"116-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Square Roots of Small Distance from Degree One Graphs"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paloma\u00a0T.","family":"Lima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charis","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"key":"10_CR2","unstructured":"Chandran, S., Issac, D., Karrenbauer, A.: On the parameterized complexity of biclique cover and partition. In: Proceedings of the 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. LIPIcs, vol. 63, pp. 11:1\u201311:13 (2017)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s00453-014-9967-4","volume":"74","author":"M Cochefert","year":"2016","unstructured":"Cochefert, M., Couturier, J., Golovach, P.A., Kratsch, D., Paulusma, D.: Parameterized algorithms for finding square roots. Algorithmica 74(2), 602\u2013629 (2016)","journal-title":"Algorithmica"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2017.04.041","volume":"248","author":"M Cochefert","year":"2018","unstructured":"Cochefert, M., Couturier, J., Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Computing square roots of graphs with low maximum degree. Discrete Appl. Math. 248, 93\u2013101 (2018)","journal-title":"Discrete Appl. Math."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Lower bounds for kernelization. Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.dam.2018.10.028","volume":"257","author":"G Ducoffe","year":"2019","unstructured":"Ducoffe, G.: Finding cut-vertices in the square roots of a graph. Discrete Appl. Math. 257, 158\u2013174 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"10_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00453-010-9442-9","volume":"62","author":"B Farzad","year":"2012","unstructured":"Farzad, B., Lau, L.C., Le, V.B., Tuy, N.N.: Complexity of finding graph roots with girth conditions. Algorithmica 62(1\u20132), 38\u201353 (2012)","journal-title":"Algorithmica"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, E.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7, 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1007\/s00453-019-00555-y","volume":"81","author":"PA Golovach","year":"2019","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Lima, P.T., Paulusma, D.: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Algorithmica 81, 2795\u20132828 (2019)","journal-title":"Algorithmica"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2017.05.008","volume":"689","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. 689, 36\u201347 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1007\/s00224-017-9825-2","volume":"62","author":"PA Golovach","year":"2018","unstructured":"Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Finding cactus roots in polynomial time. Theory Comput. Syst. 62, 1409\u20131426 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/1150334.1150337","volume":"2","author":"LC Lau","year":"2006","unstructured":"Lau, L.C.: Bipartite roots of graphs. ACM Trans. Algor. 2(2), 178\u2013208 (2006)","journal-title":"ACM Trans. Algor."},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/S0895480103425930","volume":"18","author":"LC Lau","year":"2004","unstructured":"Lau, L.C., Corneil, D.G.: Recognizing powers of proper interval, split, and chordal graph. SIAM J. Discrete Math. 18(1), 83\u2013102 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2015.07.060","volume":"602","author":"VB Le","year":"2015","unstructured":"Le, V.B., Oversberg, A., Schaudt, O.: Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sc. 602, 39\u201349 (2015)","journal-title":"Theor. Comput. Sc."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.07.037","volume":"648","author":"VB Le","year":"2016","unstructured":"Le, V.B., Oversberg, A., Schaudt, O.: A unified approach for recognizing squares of split graphs. Theor. Comput. Sc. 648, 26\u201333 (2016)","journal-title":"Theor. Comput. Sc."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.disc.2009.09.004","volume":"310","author":"VB Le","year":"2010","unstructured":"Le, V.B., Tuy, N.N.: The square of a block graph. Discr. Math. 310, 734\u2013741 (2010)","journal-title":"Discr. Math."},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ipl.2010.11.003","volume":"111","author":"VB Le","year":"2011","unstructured":"Le, V.B., Tuy, N.N.: A good characterization of squares of strongly chordal split graphs. Inf. Process. Lett. 111(3), 120\u2013123 (2011)","journal-title":"Inf. Process. Lett."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"YL Lin","year":"1995","unstructured":"Lin, Y.L., Skiena, S.: Algorithms for square roots of graphs. SIAM J. Discrete Math. 8(1), 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2014.03.021","volume":"173","author":"M Milanic","year":"2014","unstructured":"Milanic, M., Oversberg, A., Schaudt, O.: A characterization of line graphs that are squares of graphs. Discrete Appl. Math. 173, 83\u201391 (2014)","journal-title":"Discrete Appl. Math."},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1016\/j.dam.2012.12.027","volume":"161","author":"M Milanic","year":"2013","unstructured":"Milanic, M., Schaudt, O.: Computing square roots of trivially perfect and threshold graphs. Discrete Appl. Math. 161, 1538\u20131545 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(94)00023-9","volume":"54","author":"R Motwani","year":"1994","unstructured":"Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Appl. Math. 54(1), 81\u201388 (1994)","journal-title":"Discrete Appl. Math."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2013.05.026","volume":"168","author":"NV Nestoridis","year":"2014","unstructured":"Nestoridis, N.V., Thilikos, D.M.: Square roots of minor closed graph classes. Discrete Appl. Math. 168, 34\u201339 (2014)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:30:05Z","timestamp":1606944605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_10","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":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","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":"136","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":"50","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":"37% - 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,16","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","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)"}}]}}