{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:19Z","timestamp":1740109279633,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T00:00:00Z","timestamp":1551484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["249994","249994"],"award-info":[{"award-number":["249994","249994"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["249994"],"award-info":[{"award-number":["249994"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2016-258"],"award-info":[{"award-number":["RPG-2016-258"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00453-019-00555-y","type":"journal-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T22:01:05Z","timestamp":1551477665000},"page":"2795-2828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most\u00a02"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2619-2990","authenticated-orcid":false,"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paloma T.","family":"Lima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,2]]},"reference":[{"key":"555_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1017\/S0963548301004709","volume":"10","author":"J Bar\u00e1t","year":"2001","unstructured":"Bar\u00e1t, J., Hajnal, P.: Operations which preserve path-width at most two. Comb. Probab. Comput. 10, 277\u2013291 (2001)","journal-title":"Comb. Probab. Comput."},{"key":"555_CR2","first-page":"211","volume":"49","author":"J Bar\u00e1t","year":"2012","unstructured":"Bar\u00e1t, J., Hajnal, P., Lin, Y., Yang, A.: On the structure of graphs with path-width at most two. Stud. Sci. Math. Hung. 49, 211\u2013222 (2012)","journal-title":"Stud. Sci. Math. Hung."},{"key":"555_CR3","unstructured":"Bodlaender, H.L.: Classes of graphs with bounded treewidth. Technical report RUU-CS-86-22. Utrecht University, Utrecht, the Netherlands, Dept. of. Computer Sciences (1986)"},{"key":"555_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"555_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21, 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"555_CR6","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2973749","volume":"63","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, V., Penninkx, E., Thilikos, D.M., Saurabh, S.: (Meta) Kernelization. J. ACM 63, 44:1\u201344:69 (2016)","journal-title":"J. ACM"},{"key":"555_CR7","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":"555_CR8","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, 602\u2013629 (2016)","journal-title":"Algorithmica"},{"key":"555_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Inf. Th\u00e9or. Appl. 26, 257\u2013286 (1992)","journal-title":"Inf. Th\u00e9or. Appl."},{"key":"555_CR10","volume-title":"Graph Structure and Monadic Second-Order Logic\u2014A Language-Theoretic Approach, Encyclopedia of mathematics and its applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic\u2014A Language-Theoretic Approach, Encyclopedia of mathematics and its applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"key":"555_CR11","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Berlin (2012)","edition":"4"},{"key":"555_CR12","doi-asserted-by":"crossref","unstructured":"Ducoffe G.: Finding cut-vertices in the square roots of a graph. In: Proceedings of WG 2017. Lecture Notes in Computer Science, vol. 10520, pp. 234\u2013248 (2017)","DOI":"10.1007\/978-3-319-68705-6_18"},{"key":"555_CR13","unstructured":"Farzad, B., Karimi, M.: Square-root finding problem in graphs, a complete dichotomy theorem. CoRR \n                    arXiv:1210.7684"},{"key":"555_CR14","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, 38\u201353 (2012)","journal-title":"Algorithmica"},{"key":"555_CR15","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/S0021-9800(68)80079-1","volume":"5","author":"DP Geller","year":"1968","unstructured":"Geller, D.P.: The square root of a digraph. J. Comb. Theory 5, 320\u2013321 (1968)","journal-title":"J. Comb. Theory"},{"key":"555_CR16","doi-asserted-by":"crossref","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\u00a02. In: Proceedings of WG 2017. Lecture Notes in Computer Science, vol. 10520, pp. 275\u2013288 (2017)","DOI":"10.1007\/978-3-319-68705-6_21"},{"key":"555_CR17","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., Heggernes, P., Lindzey, N., McConnell, R.M., dos Santos, V.F., Spinrad, J.P., Szwarcfiter, J.L.: On recognition of threshold tolerance graphs and their complements. Discrete Appl. Math. 216, 171\u2013180 (2017)","journal-title":"Discrete Appl. Math."},{"key":"555_CR18","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":"555_CR19","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":"555_CR20","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. SIAM J. Comput. 25, 540\u2013561 (1996)","journal-title":"SIAM J. Comput."},{"key":"555_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(94)90021-3","volume":"54","author":"NG Kinnersley","year":"1994","unstructured":"Kinnersley, N.G., Langston, M.A.: Obstruction set isolation for the gate matrix layout problem. Discrete Appl. Math. 54, 169\u2013213 (1994)","journal-title":"Discrete Appl. Math."},{"key":"555_CR22","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. Algorithms 2, 178\u2013208 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"555_CR23","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 graphs. SIAM J. Discrete Math. 18, 83\u2013102 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"555_CR24","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. Sci. 602, 39\u201349 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"555_CR25","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. Sci. 648, 26\u201333 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"555_CR26","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. Discrete Math. 310, 734\u2013741 (2010)","journal-title":"Discrete Math."},{"key":"555_CR27","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, 120\u2013123 (2011)","journal-title":"Inf. Process. Lett."},{"key":"555_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y Lin","year":"1995","unstructured":"Lin, Y., Skiena, S.: Algorithms for square roots of graphs. SIAM J. Discrete Math. 8, 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"555_CR29","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":"555_CR30","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":"555_CR31","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, 81\u201388 (1994)","journal-title":"Discrete Appl. Math."},{"key":"555_CR32","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/S0021-9800(67)80030-9","volume":"2","author":"A Mukhopadhyay","year":"1967","unstructured":"Mukhopadhyay, A.: The square root of a graph. J. Comb. Theory 2, 290\u2013295 (1967)","journal-title":"J. Comb. Theory"},{"key":"555_CR33","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."},{"issue":"1930","key":"555_CR34","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"s2\u201330","author":"FP Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. s2\u201330(1930), 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"key":"555_CR35","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1002\/j.1538-7305.1960.tb03936.x","volume":"39","author":"IC Ross","year":"1960","unstructured":"Ross, I.C., Harary, F.: The square of a tree. Bell Syst. Tech. J. 39, 641\u2013647 (1960)","journal-title":"Bell Syst. Tech. J."},{"key":"555_CR36","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","volume":"26","author":"MM Sys\u0142o","year":"1979","unstructured":"Sys\u0142o, M.M.: Characterizations of outerplanar graphs. Discrete Math. 26, 47\u201353 (1979)","journal-title":"Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00555-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T19:08:26Z","timestamp":1583003306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00555-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,2]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["555"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00555-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,3,2]]},"assertion":[{"value":"2 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}