scientific article; zbMATH DE number 6381708

MaRDI QIDQ2934665zbMATH OpenFDO

Authors Haim Kaplan, Natan Rubin, Elad Verbin, Micha Sharir

Publication date 18 December 2014

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computational aspects related to convexity (52B55) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Coloring numbers
• The Colouring Number
• Counting clusters in a coloring grid
• Monochromatic boxes in colored grids
• Counting colorful tilings of rectangular arrays
• On coloring box graphs
• A Coloring Problem
• Counting colorings on varieties
• Coloring \(t\)-dimensional \(m\)-boxes

Cited in

(10)

• A (slightly) faster algorithm for Klee's measure problem
• Box and ball system with numbered boxes
• Computing Klee's measure of grounded boxes
• Indexing and querying color sets of images
• Efficient Colored Orthogonal Range Counting
• The Colouring Number
• An improved algorithm for Klee's measure problem on fat boxes
• Indexed geometric jumbled pattern matching
• Range (Rényi) entropy queries and partitioning
• Approximating the volume of unions and intersections of high-dimensional geometric objects

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934665)