Matching colored points with rectangles (Q511687): Difference between revisions

@@ Property / cites work @@
+Matching points with squares
@@ Property / cites work: Matching points with squares / rank @@
+Normal rank
@@ Property / cites work @@
+Admission control in networks with advance reservations
+Normal rank
@@ Property / cites work @@
+Independent set of intersection graphs of convex objects in 2D
+Normal rank
@@ Property / cites work @@
+Label placement by maximum independent set in rectangles
+Normal rank
@@ Property / cites work @@
+Covering points by disjoint boxes with outliers
@@ Property / cites work: Covering points by disjoint boxes with outliers / rank @@
+Normal rank
@@ Property / cites work @@
+Removing degeneracies by perturbing the problem or perturbing the world
+Normal rank
@@ Property / cites work @@
+Matching points with rectangles and squares
@@ Property / cites work: Matching points with rectangles and squares / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring and Maximum Independent Set of Rectangles
+Normal rank
@@ Property / cites work @@
+Q4633902
@@ Property / cites work: Q4633902 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time approximation schemes for packing and piercing fat objects
+Normal rank
@@ Property / cites work @@
+A note on maximum independent sets in rectangle intersection graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum independent set of pseudo-disks
+Normal rank
@@ Property / cites work @@
+Matching colored points in the plane: Some new results
+Normal rank
@@ Property / cites work @@
+On a matching problem in the plane
@@ Property / cites work: On a matching problem in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+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 @@
+The Problem of Compatible Representatives
@@ Property / cites work: The Problem of Compatible Representatives / rank @@
+Normal rank
@@ Property / cites work @@
+Q3348944
@@ Property / cites work: Q3348944 / rank @@
+Normal rank
@@ Property / cites work @@
+Problem-solving through problems.
@@ Property / cites work: Problem-solving through problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+On rectangle intersection and overlap graphs
@@ Property / cites work: On rectangle intersection and overlap graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Jump Number of Two-Directional Orthogonal Ray Graphs
+Normal rank