{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

Info icon This preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
Image of page 3

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

View Full Document Right Arrow Icon
Image of page 4
Image of page 5

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

View Full Document Right Arrow Icon
Image of page 6
Image of page 7

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

View Full Document Right Arrow Icon
Image of page 8
Image of page 9

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

View Full Document Right 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-
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 I–III. 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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern