Publication:5743404 - MaRDI portal

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68P05: Data structures

Related Items

On the number of maximum empty boxes amidst \(n\) points, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths, Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search

Cites Work

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