Show simple item record

dc.contributor.authorEstivill-Castro, Vladimiren_US
dc.contributor.authorFellows, M ichaelen_US
dc.contributor.authorLangston, Michaelen_US
dc.contributor.authorRosamond, Francesen_US
dc.contributor.editorHajo Broersma, Matthew Johnson, Stefan Szeideren_US
dc.date.accessioned2017-05-03T14:15:50Z
dc.date.available2017-05-03T14:15:50Z
dc.date.issued2005en_US
dc.date.modified2009-12-22T07:45:58Z
dc.identifier.urihttp://hdl.handle.net/10072/27923
dc.description.abstractWe describe a broad program of research in parameterized complexity, and hows this plays out for the MAX LEAF SPANNING TREE problem.en_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeBerlinen_US
dc.publisher.urihttp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.89.6749&rep=rep1&type=pdfen_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameFirst ACiD Workshopen_US
dc.relation.ispartofconferencetitleAlgorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshopen_US
dc.relation.ispartofdatefrom2005-07-08en_US
dc.relation.ispartofdateto2005-07-10en_US
dc.relation.ispartoflocationDurham UKen_US
dc.rights.retentionNen_AU
dc.subject.fieldofresearchcode280401en_US
dc.titleFPT is P-Time Extremal Structure Ien_US
dc.typeConference outputen_US
dc.type.descriptionE2 - Conference Publications (Non HERDC Eligible)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.date.issued2005
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record