{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T04:10:52Z","timestamp":1658549452969},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T00:00:00Z","timestamp":1651276800000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00224-022-10079-8","type":"journal-article","created":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T05:22:23Z","timestamp":1651296143000},"page":"821-846","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Square Roots of Small Distance from Degree One Graphs"],"prefix":"10.1007","volume":"66","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paloma T.","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":[[2022,4,30]]},"reference":[{"key":"10079_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":"10079_CR2","unstructured":"Chandran, S., Issac, D., Karrenbauer, A.: On the parameterized complexity of biclique cover and partition. In: Proceedings of IPEC 2016. LIPIcs, vol. 63, pp 11\u201311113 (2017)"},{"issue":"2","key":"10079_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). https:\/\/doi.org\/10.1007\/s00453-014-9967-4","journal-title":"Algorithmica"},{"key":"10079_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. Discret. Appl. Math. 248, 93\u2013101 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.04.041","journal-title":"Discret. Appl. Math."},{"key":"10079_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F. V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"key":"10079_CR6","doi-asserted-by":"crossref","unstructured":"Ducoffe, G.: Finding cut-vertices in the square roots of a graph, vol. 257 (2019)","DOI":"10.1016\/j.dam.2018.10.028"},{"key":"10079_CR7","unstructured":"Farzad, B., Karimi, M.: Square-root finding problem in graphs, a complete dichotomy theorem. CoRR arXiv:1210.7684 (2012)"},{"key":"10079_CR8","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s00453-010-9442-9"},{"key":"10079_CR9","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":"10079_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). https:\/\/doi.org\/10.1016\/j.tcs.2017.05.008","journal-title":"Theor. Comput. Sci."},{"key":"10079_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."},{"key":"10079_CR12","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":"10079_CR13","doi-asserted-by":"crossref","unstructured":"Golovach, P. A., Lima, P. T., Papadopoulos, C.: Graph square roots of small distance from degree one graphs. In: Proceedings of LATIN 2020. Lecture Notes in Computer Science, vol. 12118, pp 116\u2013128 (2020)","DOI":"10.1007\/978-3-030-61792-9_10"},{"issue":"2","key":"10079_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10079_CR15","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). https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"key":"10079_CR16","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":"10079_CR17","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. Algorithm. 2 (2), 178\u2013208 (2006)","journal-title":"ACM Trans. Algorithm."},{"issue":"1","key":"10079_CR18","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. Discret. Math. 18(1), 83\u2013102 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"10079_CR19","doi-asserted-by":"crossref","unstructured":"Le, V. B., Tuy, N. N.: The square of a block graph. Discret. Math. 310(4), 734\u2013741 (2010)","DOI":"10.1016\/j.disc.2009.09.004"},{"key":"10079_CR20","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.ipl.2010.11.003"},{"key":"10079_CR21","doi-asserted-by":"crossref","unstructured":"Le, V. B., Oversberg, A., Schaudt, O.: Polynomial time recognition of squares of ptolemaic graphs and 3-sun-free split graphs. Theor. Comput. Sci. 602, 39\u201349 (2015)","DOI":"10.1016\/j.tcs.2015.07.060"},{"key":"10079_CR22","doi-asserted-by":"crossref","unstructured":"Le, V. B., Oversberg, A., Schaudt, O.: A unified approach for recognizing squares of split graphs. Theor. Comput. Sci. 648, 26\u201333 (2016)","DOI":"10.1016\/j.tcs.2016.07.037"},{"key":"10079_CR23","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":"10079_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y-L Lin","year":"1995","unstructured":"Lin, Y. -L., Skiena, S.: Algorithms for square roots of graphs. SIAM J. Discret. Math. 8(1), 99\u2013118 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"10079_CR25","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."},{"key":"10079_CR26","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. Discret. Appl. Math. 173, 83\u201391 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10079_CR27","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. Discret. Appl. Math. 54(1), 81\u201388 (1994)","journal-title":"Discret. Appl. Math."},{"key":"10079_CR28","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."},{"key":"10079_CR29","doi-asserted-by":"crossref","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Proceedings of ICALP 2008, pp 634\u2013645 (2008)","DOI":"10.1007\/978-3-540-70575-8_52"},{"key":"10079_CR30","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10, 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10079-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-022-10079-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-022-10079-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T03:34:04Z","timestamp":1658547244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-022-10079-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,30]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10079"],"URL":"https:\/\/doi.org\/10.1007\/s00224-022-10079-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,30]]},"assertion":[{"value":"2 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}