Hitting and Harvesting Pumpkins (Q5892008): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q5894271
 
(7 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6382443
scientific article; zbMATH DE number 5948025
Property / author
 
Property / author: Steéphan Thomassé / rank
Normal rank
 
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1346.68111 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-23719-5_34 / rank
 
Normal rank
Property / author
 
Property / author: Steéphan Thomassé / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms – ESA 2011 / rank
 
Normal rank
Property / publication date
 
16 September 2011
Timestamp+2011-09-16T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 16 September 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C75 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5948025 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100974949 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004131100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.2704 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 6 May 2024

scientific article; zbMATH DE number 5948025
Language Label Description Also known as
English
Hitting and Harvesting Pumpkins
scientific article; zbMATH DE number 5948025

    Statements

    Hitting and Harvesting Pumpkins (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    16 September 2011
    0 references
    hitting and packing
    0 references
    parameterized complexity
    0 references
    approximation algorithm
    0 references
    single-exponential algorithm
    0 references
    iterative compression
    0 references
    graph minors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references