Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf

Vladimir Estivill-Castro, Michael Fellows, M Langston, Frances Rosamond

    Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedings

    Original languageEnglish
    Title of host publicationTexts in Algorithmics. Proceedings of the First ACiD Workshop, 8-10 July 2005
    Place of PublicationLondon, United Kingdom
    PublisherKings College London Publications
    Pages-
    Number of pages41
    Publication statusPublished - 2005
    EventAlgorithms and Complexity in Durham (ACiD 2005) - Durham, UK
    Duration: 8 Jul 200510 Jul 2005

    Conference

    ConferenceAlgorithms and Complexity in Durham (ACiD 2005)
    Period8/07/0510/07/05

    Cite this

    Estivill-Castro, V., Fellows, M., Langston, M., & Rosamond, F. (2005). Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf. In Texts in Algorithmics. Proceedings of the First ACiD Workshop, 8-10 July 2005 (pp. -). Kings College London Publications.