On the Complexity of Some Colorful Problems Parameterized by Treewidth

Michael Fellows, Fedor Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen

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

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science
    Place of PublicationBerlin, Germany
    Number of pages12
    Publication statusPublished - 2007
    EventConference on Combinatorial Optimization and Applications (COCOA 2007) - Xi'an, China
    Duration: 14 Aug 200716 Aug 2007
    Conference number: 2007


    ConferenceConference on Combinatorial Optimization and Applications (COCOA 2007)
    Abbreviated titleCOCOA

    Cite this