Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956): Difference between revisions

@@ Property / OpenAlex ID @@
+W2103870323
@@ Property / OpenAlex ID: W2103870323 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to rectangle intersections part I
@@ Property / cites work: A new approach to rectangle intersections part I / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Scanline algorithms on a grid
@@ Property / cites work: Scanline algorithms on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+On optimum single-row routing
@@ Property / cites work: On optimum single-row routing / rank @@
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+New trie data structures which support very fast search operations
+Normal rank