Kernelization: New Upper and Lower Bound Techniques (Q3656848)

From MaRDI portal
Revision as of 09:16, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/iwpec/Bodlaender09, #quickstatements; #temporary_batch_1731483406851)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Kernelization: New Upper and Lower Bound Techniques
scientific article

    Statements

    title
    Kernelization: New Upper and Lower Bound Techniques (English)
    0 references
    publication date
    14 January 2010
    0 references
    zbMATH Keywords
    fixed parameter tractability
    0 references
    kernel
    0 references
    kernelization
    0 references
    preprocessing
    0 references
    data reduction
    0 references
    combinatorial problems
    0 references
    algorithms
    0 references
    author
    Hans L. Bodlaender
    0 references
    cites work
    Q4273870
    0 references
    Q4845370
    0 references
    (Meta) Kernelization
    0 references
    Q2934608
    0 references
    Q4255109
    0 references
    Q4503944
    0 references
    Q4263467
    0 references
    Q3570028
    0 references
    Q5417642
    0 references
    Q3549693
    0 references
    Q2996856
    0 references
    Q5710169
    0 references
    Q4633817
    0 references

    Identifiers

    zbMATH DE Number
    5658357
    0 references
    Wikidata QID
    Q59567698
    0 references
    OpenAlex ID
    W1606657688
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3656848&oldid=37901453"
    Powered by MediaWiki