Pages that link to "Item:Q3031930"
From MaRDI portal
The following pages link to An Almost Linear Time Algorithm for Generalized Matrix Searching (Q3031930):
Displaying 19 items.
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- Guarding in a simple polygon (Q1607056) (← links)
- Approximate regular expression pattern matching with concave gap penalties (Q1894715) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- An almost linear time algorithm for field splitting in radiation therapy (Q1947981) (← links)
- Finding least-weight subsequences with fewer processors (Q2366242) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- (Q5009573) (← links)
- (Q5088992) (← links)
- (Q5743404) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
- Finding the largest separating rectangle among two point sets (Q6614025) (← links)
