A note on maximum independent sets in rectangle intersection graphs (Q1029038): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2003.09.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2155875791
@@ Property / OpenAlex ID: W2155875791 / rank @@
+Normal rank
@@ Property / cites work @@
+Label placement by maximum independent set in rectangles
+Normal rank
@@ Property / cites work @@
+Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
+Normal rank
@@ Property / cites work @@
+Polynomial-time approximation schemes for packing and piercing fat objects
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+Q2768362
@@ Property / cites work: Q2768362 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
+Normal rank
@@ Property / cites work @@
+Q4250205
@@ Property / cites work: Q4250205 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast stabbing of boxes in high dimensions
@@ Property / cites work: Fast stabbing of boxes in high dimensions / rank @@
+Normal rank