{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T02:51:20Z","timestamp":1774320680110,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,3,13]],"date-time":"2009-03-13T00:00:00Z","timestamp":1236902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s00453-009-9296-1","type":"journal-article","created":{"date-parts":[[2009,3,12]],"date-time":"2009-03-12T11:20:11Z","timestamp":1236856811000},"page":"790-810","source":"Crossref","is-referenced-by-count":59,"title":["Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions"],"prefix":"10.1007","volume":"58","author":[{"given":"Frederic","family":"Dorn","sequence":"first","affiliation":[]},{"given":"Eelko","family":"Penninkx","sequence":"additional","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,13]]},"reference":[{"issue":"4","key":"9296_CR1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00453-001-0116-5","volume":"33","author":"J. Alber","year":"2002","unstructured":"Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461\u2013493 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"9296_CR2","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1016\/S0022-0000(03)00072-2","volume":"67","author":"J. Alber","year":"2003","unstructured":"Alber, J., Fernau, H., Niedermeier, R.: Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4), 808\u2013832 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9296_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jalgor.2004.03.005","volume":"52","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1), 26\u201356 (2004)","journal-title":"J. Algorithms"},{"key":"9296_CR4","first-page":"33","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998)","author":"S. Arora","year":"1998","unstructured":"Arora, S., Grigni, M., Karger, D., Klein, P.N., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 33\u201341. ACM, New York (1998)"},{"key":"9296_CR5","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/1.9781611972887.15","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008)","author":"Z. Bian","year":"2008","unstructured":"Bian, Z., Gu, Q.-P., Marzban, M., Tamaki, H., Yoshitake, Y.: Study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152\u2013165. ACM, New York (2008)"},{"key":"9296_CR6","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201321 (1993)","journal-title":"Acta Cybern."},{"key":"9296_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15, 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9296_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.orl.2005.04.013","volume":"34","author":"V.G. De\u012dneko","year":"2006","unstructured":"De\u012dneko, V.G., Klinz, B., Woeginger, G.J.: Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34(2), 269\u2013274 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"9296_CR9","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. J. Assoc. Comput. Math. 52(6), 866\u2013893 (2005)","journal-title":"J. Assoc. Comput. Math."},{"key":"9296_CR10","first-page":"590","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 590\u2013601. ACM, New York (2005)"},{"issue":"3","key":"9296_CR11","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"key":"9296_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/11785293_18","volume-title":"Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006)","author":"F. Dorn","year":"2006","unstructured":"Dorn, F., Fomin, F.V., Thilikos, D.M.: Fast subexponential algorithm for non-local problems on graphs of bounded genus. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). LNCS, vol. 4059, pp. 172\u2013183. Springer, Berlin (2006)"},{"key":"9296_CR13","first-page":"631","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)","author":"F. Dorn","year":"2008","unstructured":"Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming on H-minor-free graphs. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 631\u2013640. ACM, New York (2008)"},{"issue":"1","key":"9296_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.cosrev.2008.02.004","volume":"2","author":"F. Dorn","year":"2008","unstructured":"Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comput. Sci. Rev. 2(1), 29\u201339 (2008)","journal-title":"Comput. Sci. Rev."},{"key":"9296_CR15","series-title":"LNCS","first-page":"95","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005)","author":"F. Dorn","year":"2005","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005). LNCS, vol. 3669, pp. 95\u2013106. Springer, Berlin (2005)"},{"key":"9296_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"9296_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3, 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"9296_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/jgt.20121","volume":"51","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53\u201381 (2006)","journal-title":"J. Graph Theory"},{"key":"9296_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9296_CR20","doi-asserted-by":"crossref","unstructured":"Gu, Q.-P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n 3) time. ACM Trans. Algorithms 4(3) (2008). Article 30","DOI":"10.1145\/1367064.1367070"},{"key":"9296_CR21","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM 10, 196\u2013210 (1962)","journal-title":"J. SIAM"},{"issue":"4","key":"9296_CR22","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/BF01228511","volume":"9","author":"R.Z. Hwang","year":"1993","unstructured":"Hwang, R.Z., Chang, R.C., Lee, R.C.T.: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9(4), 398\u2013423 (1993)","journal-title":"Algorithmica"},{"key":"9296_CR23","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Proceedings of the 28th International Workshop on Graph-theoretic Concepts in Computer Science (WG 2002)","author":"T. Kloks","year":"2002","unstructured":"Kloks, T., Lee, C.M., Liu, J.: New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Proceedings of the 28th International Workshop on Graph-theoretic Concepts in Computer Science (WG 2002). Lecture Notes in Comput. Sci., vol. 2573, pp. 282\u2013295. Springer, Berlin (2002)"},{"issue":"4","key":"9296_CR24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0012-365X(72)90041-6","volume":"1","author":"G. Kreweras","year":"1972","unstructured":"Kreweras, G.: Sur les partitions non crois\u00e9es d\u2019un circle. Discrete Math. 1(4), 333\u2013350 (1972)","journal-title":"Discrete Math."},{"key":"9296_CR25","volume-title":"The Traveling Salesman Problem","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.): The Traveling Salesman Problem. Wiley, New York (1985)"},{"issue":"2","key":"9296_CR26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"9296_CR27","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"9296_CR28","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-85097-7_9","volume-title":"Proceedings of the Second International Conference on Combinatorial Optimization and Applications (COCOA 2008)","author":"M. Marzban","year":"2008","unstructured":"Marzban, M., Gu, Q.-P., Jia, X.: Computational study on dominating set problem of planar graphs. In: Proceedings of the Second International Conference on Combinatorial Optimization and Applications (COCOA 2008). Lecture Notes in Comput. Sci., vol. 5165, pp. 89\u2013102. Springer, Berlin (2008)"},{"key":"9296_CR29","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N. Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62, 323\u2013348 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"9296_CR30","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9296_CR31","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","volume":"15","author":"P. Seymour","year":"1994","unstructured":"Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica 15, 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"9296_CR32","first-page":"232","volume-title":"Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998)","author":"W.D. Smith","year":"1998","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 232\u2013243. IEEE Comput. Soc., Los Alamitos (1998)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9296-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9296-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9296-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:03Z","timestamp":1559123103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9296-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,13]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9296"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9296-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,13]]}}}