{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:24Z","timestamp":1759063764581},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,25]],"date-time":"2014-12-25T00:00:00Z","timestamp":1419465600000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00453-014-9967-4","type":"journal-article","created":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T15:08:38Z","timestamp":1419433718000},"page":"602-629","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Parameterized Algorithms for Finding Square Roots"],"prefix":"10.1007","volume":"74","author":[{"given":"Manfred","family":"Cochefert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Couturier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","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":[[2014,12,25]]},"reference":[{"key":"9967_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.37236\/626","volume":"18","author":"A Adamaszek","year":"2011","unstructured":"Adamaszek, A., Adamaszek, M.: Uniqueness of graph square roots of girth six. Electron. J. Comb. 18, 139 (2011)","journal-title":"Electron. J. Comb."},{"key":"9967_CR2","first-page":"223","volume":"54","author":"D Aingworth","year":"1998","unstructured":"Aingworth, D., Motwani, R., Harary, F.: The difference between a graph and its square. Utilitas Math. 54, 223\u2013228 (1998)","journal-title":"Utilitas Math."},{"key":"9967_CR3","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/s00453-010-9428-7","volume":"61","author":"N Alon","year":"2011","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving max- r-sat above a tight lower bound. Algorithmica 61, 638\u2013655 (2011)","journal-title":"Algorithmica"},{"key":"9967_CR4","doi-asserted-by":"crossref","unstructured":"Cochefert, M., Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: Sparse square roots. In: WG, Lecture Notes Computer Science, vol. 8165. Springer, pp. 177\u2013188 (2013)","DOI":"10.1007\/978-3-642-45043-3_16"},{"key":"9967_CR5","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"9967_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity, Texts in Computer Science","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, Texts in Computer Science. Springer, (2013)"},{"key":"9967_CR7","unstructured":"Farzad, B., Karimi, M.: Square-root finding problem in graphs, a complete dichotomy theorem. CoRR, abs\/1210.7684 (2012)"},{"key":"9967_CR8","doi-asserted-by":"crossref","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":"9967_CR9","volume-title":"Parameterized Complexity Theory, Texts in Theoretical Computer Science. An EATCS Series","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"9967_CR10","doi-asserted-by":"crossref","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":"9967_CR11","doi-asserted-by":"crossref","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, 83\u2013102 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"9967_CR12","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. CoRR, abs\/1402.0024 (2014)","DOI":"10.1007\/978-3-319-12340-0_30"},{"key":"9967_CR13","doi-asserted-by":"crossref","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":"9967_CR14","doi-asserted-by":"crossref","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":"9967_CR15","doi-asserted-by":"crossref","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. Discrete Math. 8, 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"9967_CR16","doi-asserted-by":"crossref","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":"9967_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"9967_CR18","doi-asserted-by":"crossref","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":"9967_CR19","doi-asserted-by":"crossref","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":"9967_CR20","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)"},{"key":"9967_CR21","doi-asserted-by":"crossref","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":"9967_CR22","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9967-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9967-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9967-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T11:01:47Z","timestamp":1598612507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9967-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,25]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9967"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9967-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,25]]}}}