Polynomial Time Algorithms for Bichromatic Problems (Q2971630): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2528293472 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.00300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bichromatic 2-center of pairs of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating the Depth and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane bichromatic trees of low degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest empty rectangle among a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Conflict‐Free Coloring for Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bichromatic separability with two boxes: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum box problem and its application to data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points on a line with respect to a set of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank

Latest revision as of 15:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Polynomial Time Algorithms for Bichromatic Problems
scientific article

    Statements

    Polynomial Time Algorithms for Bichromatic Problems (English)
    0 references
    0 references
    0 references
    7 April 2017
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references