Q5743404 (Q5743404): Difference between revisions

@@ Property / author @@
+Micha Sharir
@@ Property / author: Micha Sharir / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of generalized matrix searching to geometric algorithms
+Normal rank
@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+A note on finding a maximum empty rectangle
@@ Property / cites work: A note on finding a maximum empty rectangle / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Perspectives of Monge properties in optimization
@@ Property / cites work: Perspectives of Monge properties in optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Many distances in planar graphs
@@ Property / cites work: Many distances in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Largest empty rectangle among a point set
@@ Property / cites work: Largest empty rectangle among a point set / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Largest Empty Rectangle
@@ Property / cites work: Computing the Largest Empty Rectangle / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional cascading. I: A data structuring technique
+Normal rank
@@ Property / cites work @@
+Shortest path queries in planar graphs
@@ Property / cites work: Shortest path queries in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Dynamic algorithms for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+Normal rank
@@ Property / cites work @@
+Q5557602
@@ Property / cites work: Q5557602 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Superlinear bounds for matrix searching problems
@@ Property / cites work: Superlinear bounds for matrix searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Almost Linear Time Algorithm for Generalized Matrix Searching
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully dynamic approximation scheme for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
+Normal rank
@@ Property / cites work @@
+Q5743390
@@ Property / cites work: Q5743390 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
+Normal rank
@@ Property / cites work @@
+On the maximum empty rectangle problem
@@ Property / cites work: On the maximum empty rectangle problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4470502
@@ Property / cites work: Q4470502 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Distance Queries in Planar Graphs
@@ Property / cites work: Improved Distance Queries in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
+Normal rank
@@ Property / cites work @@
+Q4325546
@@ Property / cites work: Q4325546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5743404