Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Nadja Betzler, Michael Fellows, Christian Komusiewicz, Rolf Niedermeier

    Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedingspeer-review

    33 Citations (Scopus)
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science CPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching
    Place of PublicationBerlin, Germany
    PublisherSpringer
    Pages-
    Number of pages13
    Publication statusPublished - 2008
    EventCPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching - Pisa, Italy
    Duration: 18 Jun 200820 Jun 2008

    Conference

    ConferenceCPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching
    Period18/06/0820/06/08

    Cite this