L24 - plied Mathematics. [KT12] Stephan Kreutzer and Siamak...

Info iconThis preview shows pages 1–10. 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 DocumentRight 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 DocumentRight 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 DocumentRight 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 DocumentRight 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 DocumentRight Arrow Icon
References [BDT09] Glencora Borradaile, Erik D. Demaine, and Siamak Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. In STACS ’09: Proceedings of the 26th Symposium on Theoretical Aspects of Computer Sci- ence , pages 171–182, 2009. [DGK07] Anuj Dawar, Martin Grohe, and Stephan Kreutzer. Locally ex- cluding a minor. In LICS ’07: Proceedings of the 22nd annual IEEE symposium on Logic in Computer Science , pages 270–279. IEEE Computer Society, 2007. [DHK10] Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Decomposition, approximation, and coloring of odd-minor-free graphs. In SODA ’10: Proceedings of the 21st an- nual ACM-SIAM Symposium on Discrete Algorithms , pages 329– 344, Philadelphia, PA, USA, 2010. Society for Industrial and Ap-
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: plied Mathematics. [KT12] Stephan Kreutzer and Siamak Tazari. Directed nowhere dense classes of graphs. In SODA 12: Proceedings of the 23rd annual ACM-SIAM Symposium on Discrete Algorithms , page to appear. SIAM, 2012. [Nd05] J. Ne set ril and P. Ossona de Mendez. Tree depth, subgraph col-oring and homomorphisms. European Journal of Combinatorics , 2005. [NO08] J. Ne set ril and P. Ossona de Mendez. Grad and classes with bounded expansion IIII. European Journal of Combinatorics , 29, 2008. Series of 3 papers appearing in volumes (3) and (4). [NO10] J. Ne set ril and P. Ossona de Mendez. First order properties on nowhere dense structures. Journal of Symbolic Logic , 75(3):868 887, 2010....
View Full Document

This note was uploaded on 01/20/2012 for the course CS 6.889 taught by Professor Erikdemaine during the Fall '11 term at MIT.

Page1 / 10

L24 - plied Mathematics. [KT12] Stephan Kreutzer and Siamak...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online