Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286): 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: 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: 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

Latest revision as of 20:45, 31 July 2024

scientific article
Language Label Description Also known as
English
Bottleneck convex subsets: finding \(k\) large convex sets in a point set
scientific article

    Statements

    Bottleneck convex subsets: finding \(k\) large convex sets in a point set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    0 references
    computational geometry
    0 references
    convex set
    0 references
    FPT-algorithm
    0 references
    NP-hard
    0 references
    0 references