Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5692695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck convex subsets: finding \(k\) large convex sets in a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Point-Set Embeddability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Configurations in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum area \(k\)-gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-remainder / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of \(O(n^2)\) problems in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum rectilinear convex subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-remainder for convex sets and the Erdős-Szekeres theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of locating linear facilities in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdos-Szekeres problem on points in convex position – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a partition into convex polygons / rank
 
Normal rank

Revision as of 18:57, 1 August 2024

scientific article; zbMATH DE number 7715069
Language Label Description Also known as
English
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
scientific article; zbMATH DE number 7715069

    Statements

    Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2023
    0 references
    convex set
    0 references
    NP-hard
    0 references
    FPT-algorithms
    0 references

    Identifiers