Computing the largest empty rectangle

Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry

Maintenance of geometric extrema ∈

Journal of the ACM (JACM)

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)

Optimal parallel algorithms for direct dominance problems

Nordic Journal of Computing

Mining for Empty Rectangles in Large Data Sets

ICDT '01 Proceedings of the 8th International Conference on Database Theory

Largest empty rectangle among a point set

Journal of Algorithms

Mining for empty spaces in large data sets

Theoretical Computer Science - Database theory

On finding an empty staircase polygon of largest area (width) in a planar point-set

Computational Geometry: Theory and Applications

A rank-by-feature framework for interactive exploration of multidimensional data

Information Visualization

Fast algorithms for finding disjoint subsequences with extremal densities

Pattern Recognition

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Theoretical Computer Science

On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips

Information Processing Letters

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Discrete Applied Mathematics

Discovering interesting holes in data

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2

An intersection inequality for discrete distributions and related generation problems

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Computing a largest empty arbitrary oriented rectangle: theory and implementation

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

The mono- and bichromatic empty rectangle and square problems in all dimensions

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Fast algorithms for finding disjoint subsequences with extremal densities

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Generating all minimal integral solutions to monotone ∧,∨-systems of linear, transversal and polymatroid inequalities

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Finding the largest empty rectangle containing only a query point in large multidimensional databases

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management

An in-place min-max priority search tree

Computational Geometry: Theory and Applications

Approximate MaxRS in spatial databases

Proceedings of the VLDB Endowment