Coloring and Maximum Independent Set of Rectangles (Q3088088): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-22935-0_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W146916075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Graphs of Rectangles and Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Coloring Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Vertex Cover in Rectangle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximum independent sets in rectangle intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum independent set of pseudo-disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Mining with optimized two-dimensional association rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast stabbing of boxes in high dimensions / rank
 
Normal rank

Latest revision as of 09:17, 4 July 2024

scientific article
Language Label Description Also known as
English
Coloring and Maximum Independent Set of Rectangles
scientific article

    Statements

    Coloring and Maximum Independent Set of Rectangles (English)
    0 references
    17 August 2011
    0 references

    Identifiers