{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:48Z","timestamp":1725914688319},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_21","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"275-288","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Outerplanar Graph Roots and\u00a0Graph Roots of Pathwidth at Most 2"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Paloma T.","family":"Lima","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","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."},{"issue":"2","key":"21_CR2","doi-asserted-by":"crossref","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(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-45043-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Cochefert","year":"2013","unstructured":"Cochefert, M., Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: Sparse square roots. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 177\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45043-3_16"},{"key":"21_CR4","doi-asserted-by":"crossref","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":"21_CR5","first-page":"257","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Informatique Th\u00e9orique Appl. 26, 257\u2013286 (1992)","journal-title":"Informatique Th\u00e9orique Appl."},{"key":"21_CR6","volume-title":"Graph Structure and Monadic Second-Order Logic - A 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 - A Language-Theoretic Approach, Encyclopedia of Mathematics and its Applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"key":"21_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2012)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Ducoffe G., Finding cut-vertices in the square roots of a graph. In: Proceedings of the WG 2017. LNCS (to Appear)","DOI":"10.1007\/978-3-319-68705-6_18"},{"key":"21_CR9","unstructured":"Farzad, B., Karimi, M.: Square-root finding problem in graphs, a complete dichotomy theorem. CoRR abs\/1210.7684 (2012)"},{"key":"21_CR10","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":"21_CR11","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 2. CoRR abs\/1703.05102 (2017)","DOI":"10.1007\/978-3-319-68705-6_21"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-44543-4_28","volume-title":"Combinatorial Algorithms","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Finding cactus roots in polynomial time. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 361\u2013372. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_28"},{"key":"21_CR13","unstructured":"Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: A linear kernel for finding square roots of almost planar graphs. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, vol. 53, pp. 4:1\u20134:14. Leibniz International Proceedings in Informatics (2016)"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.endm.2016.10.048","volume":"55","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Squares of low clique number. Electron. Notes Discrete Math. 55, 195\u2013198 (2016). 14th Cologne Twente Workshop 2016, CTW 2016","journal-title":"Electron. Notes Discrete Math."},{"issue":"2\u20133","key":"21_CR15","doi-asserted-by":"crossref","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(2\u20133), 169\u2013213 (1994)","journal-title":"Discrete Appl. Math."},{"key":"21_CR16","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":"21_CR17","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 graphs. SIAM J. Discrete Math. 18, 83\u2013102 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR18","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 602, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR19","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 648, 26\u201333 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR20","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":"21_CR21","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":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-54945-5_44","volume-title":"ISA 1991 Algorithms","author":"Y-L Lin","year":"1991","unstructured":"Lin, Y.-L., Skiena, S.S.: Algorithms for square roots of graphs. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 12\u201321. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54945-5_44"},{"key":"21_CR23","doi-asserted-by":"crossref","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":"21_CR24","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":"21_CR25","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":"21_CR26","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":"21_CR27","doi-asserted-by":"crossref","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":"21_CR28","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."},{"issue":"1","key":"21_CR29","doi-asserted-by":"crossref","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(1), 47\u201353 (1979)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T08:11:37Z","timestamp":1570263097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}