{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:50Z","timestamp":1725549950012},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_11","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:46:24Z","timestamp":1128588384000},"page":"95-106","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions"],"prefix":"10.1007","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","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","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\u00a033(4), 461\u2013493 (2002)","journal-title":"Algorithmica"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2004.01.013","volume":"145","author":"J. Alber","year":"2005","unstructured":"Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics\u00a0145, 219\u2013231 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR3","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a067, 808\u2013832 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR4","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a052, 26\u201356 (2004)","journal-title":"Journal of Algorithms"},{"key":"11_CR5","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernet.\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernet."},{"key":"11_CR6","doi-asserted-by":"publisher","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 Journal on Computing\u00a015, 233\u2013248 (2003)","journal-title":"INFORMS Journal on Computing"},{"unstructured":"De\u012dneko, V.G., Klinz, B., Woeginger, G.J.: Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. (2005) (to appear)","key":"11_CR7"},{"key":"11_CR8","first-page":"823","volume-title":"15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"E.D. Demaine","year":"2004","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. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 823\u2013832. ACM, New York (2004)"},{"key":"11_CR9","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":"11_CR10","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. Journal of Graph Algorithms and Applications\u00a03, 1\u201327 (1999)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR11","first-page":"168","volume-title":"14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"F. Fomin","year":"2003","unstructured":"Fomin, F., Thilikos, D.: Dominating sets in planar graphs: Branch-width and exponential speed-up. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 168\u2013177. ACM, New York (2003)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24749-4_6","volume-title":"STACS 2004","author":"F. Fomin","year":"2004","unstructured":"Fomin, F., Thilikos, D.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 56\u201367. Springer, Heidelberg (2004)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11523468_31","volume-title":"Automata, Languages and Programming","author":"Q.-P. Gu","year":"2005","unstructured":"Gu, Q.-P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n\n                        3). In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 373\u2013384. Springer, Heidelberg (2005) (to appear)"},{"key":"11_CR14","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM\u00a010, 196\u2013210 (1962)","journal-title":"Journal of SIAM"},{"key":"11_CR15","doi-asserted-by":"publisher","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\u00a09, 398\u2013423 (1993)","journal-title":"Algorithmica"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0012-365X(72)90041-6","volume":"1","author":"G. Kreweras","year":"1972","unstructured":"Kreweras, G.: Sur les partition non crois\u00e9es d\u2019un circle. Discrete Mathematics\u00a01, 333\u2013350 (1972)","journal-title":"Discrete Mathematics"},{"volume-title":"The traveling salesman problem","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R. (eds.): The traveling salesman problem. John Wiley & Sons Ltd., Chichester (1985)","key":"11_CR17"},{"key":"11_CR18","doi-asserted-by":"publisher","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 Journal on Applied Mathematics\u00a036, 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"11_CR19","doi-asserted-by":"publisher","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 Journal on Computing\u00a09, 615\u2013627 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR20","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory Series B\u00a062, 323\u2013348 (1994)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"11_CR21","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"11_CR22","doi-asserted-by":"publisher","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\u00a015, 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"11_CR23","first-page":"232","volume-title":"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: The 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1998), pp. 232\u2013243. IEEE Computer Society Press, Los Alamitos (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:23Z","timestamp":1619493203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11561071_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}