{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:31:50Z","timestamp":1791124310338,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_50","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"581-592","source":"Crossref","is-referenced-by-count":27,"title":["Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"50_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, 461\u2013493 (2002)","journal-title":"Algorithmica"},{"key":"50_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-45471-3_16","volume-title":"Algorithm Theory - SWAT 2002","author":"J. Alber","year":"2002","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Efficient data reduction for dominating set: A linear problem kernel for the planar case. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 150\u2013159. Springer, Heidelberg (2002); To appear in the Journal of the ACM"},{"key":"50_CR3","first-page":"7","volume-title":"Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI 2001)","author":"E. Amir","year":"2001","unstructured":"Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI 2001), San Francisco, CA, pp. 7\u201315. Morgan Kaufmann Publishers, San Francisco (2001)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/3-540-45061-0_65","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixedparameter algorithms for the (k, r)-center in planar graphs and map graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 829\u2013844. Springer, Heidelberg (2003)"},{"key":"50_CR5","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 823\u2013832 (2004) (to appear)"},{"key":"50_CR6","unstructured":"Demaine, E.D., Hajiaghayi, M.: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2004) (to appear)"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-36136-7_24","volume-title":"Algorithms and Computation","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., Hajiaghayi, M., Thilikos, D.M.: Exponential speedup of fixed-parameter algorithms on K3,3-minor-free or K5-minor-free graphs. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 262\u2013273. Springer, Heidelberg (2002)"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-60618-1_66","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.N. Djidjev","year":"1995","unstructured":"Djidjev, H.N., Venkatesan, S.M.: Planarization of graphs embedded on surfaces. In: Nagl, M. (ed.) WG 1995. LNCS, vol.\u00a01017, pp. 62\u201372. Springer, Heidelberg (1995)"},{"key":"50_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":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-45471-3_19","volume-title":"Algorithm Theory - SWAT 2002","author":"J. Ellis","year":"2002","unstructured":"Ellis, J., Fan, H., Fellows, M.: The dominating set problem is fixed parameter tractable for graphs of bounded genus. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 180\u2013189. Springer, Heidelberg (2002)"},{"key":"50_CR11","unstructured":"Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branchwidth and exponential speed-up. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 168\u2013177 (2003)"},{"key":"#cr-split#-50_CR12.1","unstructured":"Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs and fixed parameter algorithms, Technical Report 240, Department of Informatics, University of Bergen, Norway (2003);"},{"key":"#cr-split#-50_CR12.2","unstructured":"Extended abstract A Simple and Fast Approach for Solving Problems on Planar Graphs to appear in the proceedings of STACS 2004 (2004)"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-45687-2_33","volume-title":"Mathematical Foundations of Computer Science 2002","author":"I. Kanj","year":"2002","unstructured":"Kanj, I., Perkovi\u0107, L.: Improved parameterized algorithms for planar dominating set. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 399\u2013410. Springer, Heidelberg (2002)"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","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 set on plane and planar graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 282\u2013296. Springer, Heidelberg (2002)"},{"key":"50_CR15","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0095-8956(88)90070-6","volume":"45","author":"N. Robertson","year":"1988","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. VII. Disjoint paths on a surface. J. Combin. Theory Ser. B\u00a045, 212\u2013254 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"50_CR17","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 treedecomposition. Journal of Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"50_CR18","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1006\/jctb.1994.1007","volume":"60","author":"N. Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XI. Circuits on a surface. J. Combin. Theory Ser. B\u00a060, 72\u2013106 (1994)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T06:20:23Z","timestamp":1685773223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}