{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L10 - [FGT09 Fedor V Fomin Petr A Golovach and Dimitrios M...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 2
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 10
References [DFHT05] Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Haji- aghayi, and Dimitrios M. Thilikos. Subexponential parame- terized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM , 52(6):866–893, 2005. [DH05a] Erik D. Demaine and Mohammad Taghi Hajiaghayi. Bidimen- sionality: new connections between FPT algorithms and PTASs. In SODA ’05: Proceedings of the 16th annual ACM-SIAM Sym- posium on Discrete Algorithms , pages 590–601, Philadelphia, PA, USA, 2005. [DH05b] Erik D. Demaine and MohammadTaghi Hajiaghayi. Graphs ex- cluding a fixed minor have grids as large as treewidth, with com- binatorial and algorithmic applications through bidimensional- ity. In SODA ’05: Proceedings of the 16th annual ACM-SIAM Symposium on Discrete Algorithms , pages 682–689, Philadel- phia, PA, USA, 2005. Society for Industrial and Applied Math-
Background image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: [FGT09] Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos. Contraction bidimensionality: The accurate picture. In ESA ’09: Proceedings of the 17th annual European Symposium on Al-gorithms , pages 706–717, 2009. [FLRS11] Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Bidimensionality and EPTAS. In SODA ’11: Proceedings of the 22nd annual ACM-SIAM Symposium on Dis-crete Algorithms , pages 748–759, 2011. [FLST10] Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dim-itrios M. Thilikos. Bidimensionality and kernels. In SODA ’10: Proceedings of the 21st annual ACM-SIAM Symposium on Dis-crete Algorithms , pages 503–510, 2010. [RST94] Neil Robertson, Paul Seymour, and Robin Thomas. Quickly excluding a planar graph. J. Comb. Theory Ser. B , 62(2):323– 348, 1994....
View Full Document

{[ snackBarMessage ]}