Q5111741 (Q5111741): Difference between revisions

@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+Algorithmic discrepancy beyond partial coloring
@@ Property / cites work: Algorithmic discrepancy beyond partial coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Static and Dynamic Algorithms for k-Point Clustering Problems
+Normal rank
@@ Property / cites work @@
+Covering many points with a small-area box
@@ Property / cites work: Covering many points with a small-area box / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+The complexity of selection and ranking in X+Y and matrices with sorted columns
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+Generalized Selection and Ranking: Sorted Matrices
+Normal rank
@@ Property / cites work @@
+Q3010463
@@ Property / cites work: Q3010463 / 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 @@
+Selection in \(X+Y\) and matrices with sorted rows and columns
+Normal rank
@@ Property / cites work @@
+A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
+Normal rank
@@ Property / cites work @@
+Enclosing \(k\) points in the smallest axis parallel rectangle
+Normal rank