The parameterized complexity of stabbing rectangles (Q2428672)

From MaRDI portal
Revision as of 03:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The parameterized complexity of stabbing rectangles
scientific article

    Statements

    title
    The parameterized complexity of stabbing rectangles (English)
    0 references
    author
    Michael Dom
    0 references
    Michael R. Fellows
    0 references
    Somnath Sikdar
    0 references
    Frances A. Rosamond
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    zbMATH DE Number
    6028428
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    fixed-parameter algorithms
    0 references
    geometric covering problems
    0 references
    OpenAlex ID
    W2032054765
    0 references
    Wikidata QID
    Q57359642
    0 references
    cites work
    Q3396009
    0 references
    Q4198056
    0 references
    Q4474116
    0 references
    Q5710169
    0 references
    Q4226981
    0 references
    Q2766848
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2428672&oldid=35274970"
    Powered by MediaWiki