What Makes Equitable Connected Partition Easy?

R Enciso, Michael Fellows, J Guo, Iyad Kanj, Frances Rosamond, A Suchy

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

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Place of PublicationBerlin, Germany
    PublisherSpringer
    Pages-
    Number of pages12
    ISBN (Print)0302-9743
    Publication statusPublished - 2009
    EventIWPEC 2009. International Workshop on Exact and Parameterized Computation - Copenhagen, Denmark
    Duration: 10 Sep 200911 Sep 2009

    Conference

    ConferenceIWPEC 2009. International Workshop on Exact and Parameterized Computation
    Period10/09/0911/09/09

    Cite this

    Enciso, R., Fellows, M., Guo, J., Kanj, I., Rosamond, F., & Suchy, A. (2009). What Makes Equitable Connected Partition Easy? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. -). Springer.