Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57359830, #quickstatements; #temporary_batch_1705917335470
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1757816407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINTS BY AXIS-PARALLEL LINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering things with things / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Station Location - Complexity and Approximation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant approximation algorithms for rectangle stabbing and related problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:41, 29 June 2024

scientific article
Language Label Description Also known as
English
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
scientific article

    Statements

    Identifiers