Pages that link to "Item:Q1894952"

The following pages link to A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952):

Displayed 6 items.

• In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) ‎ (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) ‎ (← links)
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) ‎ (← links)
• Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) ‎ (← links)
• Read Mapping on Genome Variation Graphs (Q5091734) ‎ (← links)
• (Q5111741) ‎ (← links)