Show simple item record

AuthorBaste, Juliendc.contributor.author
AuthorSau, Ignasidc.contributor.author
AuthorThilikos, Dimitrios M.dc.contributor.author
Date of accession2020-03-03T11:10:20Zdc.date.accessioned
Available in OPARU since2020-03-03T11:10:20Zdc.date.available
Date of first publication2020dc.date.issued
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
KeywordParameterized complexitydc.subject
KeywordGraph minorsdc.subject
KeywordTreewidthdc.subject
KeywordHitting minorsdc.subject
KeywordTopological minorsdc.subject
KeywordDynamic programmingdc.subject
KeywordExponential Time Hypothesisdc.subject
Dewey Decimal GroupDDC 000 / Computer science, information & general worksdc.subject.ddc
TitleHitting minors on bounded treewidth graphs. III. Lower boundsdc.title
Resource typeWissenschaftlicher Artikeldc.type
FacultyFakultät für Mathematik und Wirtschaftswissenschaftenuulm.affiliationGeneral
InstitutionInstitut für Optimierung und Operations Researchuulm.affiliationSpecific
DCMI TypeTextuulm.typeDCMI
CategoryPublikationsnachweiseuulm.category
DOI (external)10.1016/j.jcss.2019.11.002dc.identifier.doiExternal
Source - Title of sourceJournal of Computer and System Sciencessource.title
Source - Place of publicationElseviersource.publisher
Source - Volume109source.volume
Source - Year2020source.year
Source - From page56source.fromPage
Source - To page77source.toPage
Source - ISSN0022-0000source.identifier.issn
Source - eISSN1090-2724source.identifier.eissn
CommunityFakultät für Mathematik und Wirtschaftswissenschaftenuulm.community
WoS000510316500004uulm.identifier.wos
Bibliographyuulmuulm.bibliographie


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record